home *** CD-ROM | disk | FTP | other *** search
- Using a sorted sequence to list all elements in a sequence of strings lying
- lexicographically between two given search strings.
-
- \#include $<$LEDA/sortseq.h$>$
- \medskip
- {\bf declare2}(sortseq,string,int);
- \medskip
- \cleartabs
- \+main()\cr
- \+$\{$\ \
- &sortseq(string,int) $S$;\cr
- \+ &string $s,s1,s2$;\cr
- \smallskip
- \+ &\While ( cin $>>$ $s$ \&\& $s$ != ``stop'' ) $S$.insert($s,0$);\cr
- \smallskip
- \+ &\While ( cin $>>$ $s1$ $>>$ $s2$ )\cr
- \+ &\ \ \ &$\{$\ \
- &seq\_item $it1 = S$.locate($s1$);\cr
- \+ & & &seq\_item $it2 = S$.locate($s2$);\cr
- \smallskip
- \+ & & &\While ($it1 != it2$)\cr
- \+ & & &\ \ \ &$\{$ &cout $<<$ $S$.key($it1$) $<<$ ``\n"; \cr
- \+ & & & & &$it1 = S$.succ($it1$);\cr
- \+ & & & &\ $\}$\cr
- \+ & &\ $\}$\cr
- \+\ $\}$\cr
-