43 #include "EST_String.h"
44 #include "EST_util_class.h"
45 #include "EST_types.h"
52 EST_String strings[] = {
"quail",
"wood pigeon",
"eagle",
"emu",
"rook" };
61 for (
unsigned int i1 = 0; i1 <
sizeof(strings) /
sizeof(strings[0]); i1++)
69 for (p = slist.head(); p != 0; p = p->next())
70 if (slist(p) ==
"eagle")
79 cout <<
"[ List Accessed by LItem\n";
81 for (p = slist.head(); p != 0; p = p->next())
82 cout <<
" " << slist(p) <<
"\n";
88 cout <<
"\n[ List Accessed by integer index\n";
89 for (
int i2 = 0; i2 < slist.length(); ++i2)
90 cout <<
" " << slist.
nth(i2) <<
"\n";
98 for (p = slist.head(); p != 0; p = p->next())
99 slist(p).gsub(
"e",
"E");
103 cout <<
"Last item: " << slist(p) << endl;
106 cout <<
"Last item: " << slist.
last() << endl;
109 cout <<
"First item: " << slist.
first() << endl;
112 cout <<
"4th item: " << slist.
nth(4) << endl;
118 slist.
first() =
"Swallow";
119 slist.
last() =
"TurkEy";
120 slist.
nth(2) =
"SEagull";
124 cout <<
"\n[ List After Substitutions and Replacements\n";
125 for (p = slist.head(); p != 0; p = p->next())
126 cout <<
" " << slist(p) <<
"\n";
137 for (p = slist.head(); p != 0; p = p->next())
138 if (slist(p) ==
"EaglE")
143 cout <<
"\n[ List After Removing Eagle\n";
144 for (p = slist.head(); p != 0; p = p->next())
145 cout <<
" " << slist(p) <<
"\n";
153 cout <<
"\n[ List After Reverse\n";
154 for (p = slist.head(); p != 0; p = p->next())
155 cout <<
" " << slist(p) <<
"\n";
163 cout <<
"\n[ Sorted\n";
164 for(p=slist.head(); p ; p=p->next())
165 cout <<
" " << slist(p) <<
"\n";
169 qsort(slist,&second_char_gt );
171 cout <<
"\n[ Sorted by second character\n";
172 for(p=slist.head(); p ; p=p->next())
173 cout <<
" " << slist(p) <<
"\n";
185 return (
bool)(val1->val(1) > val2->val(1));
EST_Litem * insert_before(EST_Litem *ptr, const T &item)
const T & last() const
return const reference to last item in list
T & nth(int n)
return the Nth value
const T & first() const
return const reference to first item in list
void append(const T &item)
add item onto end of list
EST_Litem * insert_after(EST_Litem *ptr, const T &item)
EST_Litem * remove(EST_Litem *ptr)
void prepend(const T &item)
add item onto start of list