🚀 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.

According to my digital TECO pocket guide (C)1978
"Searches:
Searches that fail leave the pointer at position 0
Successful searches leave pointer after text found

nStext$:  Searches for the nth occurrence of the specified
text (following the pointer), but does not go beyond the end of the
current text buffer.  

-nStext$  Same as nStext$ but the search proceeds backwards  
"

As that is not very helpful... I remember using the -nStext$ command and,
as I remember it, the pointer is put at the beginning of the search string.
Certainly successive -S commands would find previous versions of the
string.

-Roe
Roe D McBurnett III Bellcore (908)699-2273 rdm2@chaucer.cc.bellcore.com
#insert <std.disclamer>