Re: avoid narrow-to-region (was: Re: replace-regexp)

[Emanuel Berg]

Yuri Khan wrote:

> From the Wikipedia article I linked to previously, which you
> apparently chose to read later:
>
> In principle this shuffling method can even result in
> program failures like endless loops or access violations,
> because the correctness of a sorting algorithm may depend on
> properties of the order relation (like transitivity) that
> a comparison producing random values will certainly not
> have.

In principle maybe - but not in practice, it seems.

Proposal: Instead of quoting computer science theory, why
don't _you_ write some Elisp and show us how you think it
should be done?

It isn't because it is easier and more comfortable to broadly
criticize someone or something else, than to be active and
creative oneself - is it?

-- 
underground experts united
https://dataswamp.org/~incal