🚀 go-pugleaf

In article <DRW.92Sep8135859@nevanlinna.mit.edu>, drw@nevanlinna.mit.edu (Dale R. Worley) writes:
|>If one searches backwards (using a negative argument to S), is the
|>point left at the beginning of the string (so that -Sstring$ when
|>executed repeatedly finds successive occurrences backwards), or is the
|>point left at the end of the string (as when S searches forward)?
|>
|>Dale
|>
|>Dale Worley		Dept. of Math., MIT		drw@math.mit.edu
|>--
|>Measure with a micrometer.  Mark with chalk.  Cut with an axe.

That's not a religious question..  The answer is "the latter".
The only difference between forward and backward search is the direction
"dot" is moved in between successive compares of the target string
against the buffer contents.  Note, for example, that -S will find the
string that begins at "dot" (since that is the first string compared).
Similarly, -::S and ::S are equivalent.

Now if you want to rephrase that as a religious question, you might ask
"how SHOULD it work".   :-)

	paul