43#include "EST_String.h"
44#include "EST_util_class.h"
76 for (
unsigned int i1 = 0; i1 <
sizeof(
strings) /
sizeof(
strings[0]); i1++)
80 slist.prepend(
"dove");
84 for (p =
slist.head(); p != 0; p = p->next())
85 if (
slist(p) ==
"eagle")
87 p =
slist.insert_before(p,
"hawk");
88 p =
slist.insert_after(p,
"sparrow");
110 cout <<
"[ List Accessed by LItem\n";
112 for (p =
slist.head(); p != 0; p = p->next())
119 cout <<
"\n[ List Accessed by integer index\n";
120 for (
int i2 = 0; i2 <
slist.length(); ++i2)
135 for (p =
slist.head(); p != 0; p = p->next())
136 slist(p).gsub(
"e",
"E");
155 slist.first() =
"Swallow";
156 slist.last() =
"TurkEy";
157 slist.nth(2) =
"SEagull";
161 cout <<
"\n[ List After Substitutions and Replacements\n";
162 for (p =
slist.head(); p != 0; p = p->next())
181 for (p =
slist.head(); p != 0; p = p->next())
182 if (
slist(p) ==
"EaglE")
187 cout <<
"\n[ List After Removing Eagle\n";
188 for (p =
slist.head(); p != 0; p = p->next())
200 cout <<
"\n[ List After Reverse\n";
201 for (p =
slist.head(); p != 0; p = p->next())
220 cout <<
"\n[ Sorted\n";
221 for(p=
slist.head(); p ; p=p->next())
226 qsort(
slist,&second_char_gt );
228 cout <<
"\n[ Sorted by second character\n";
229 for(p=
slist.head(); p ; p=p->next())
247 return (
bool)(
val1->val(1) >
val2->val(1));