12  CHECK (s->search_next (
"abc", 0) == 0);
 
   13  CHECK (s->search_next (
"abc", 1) == 3);
 
   14  CHECK (s->search_next (
"abc", 4) == 6);
 
   15  CHECK (s->search_next (
"abc", 7) == -1);
 
   16  CHECK (s->search_next (
"", 0) == 0);
 
   17  CHECK (s->search_next (
"", 1) == 1);
 
   18  CHECK (s->search_next (
"", 2) == 2);
 
   19  CHECK (s->search_next (
"", 3) == 3);
 
   20  CHECK (s->search_next (
"", 4) == 4);
 
   21  CHECK (s->search_next (
"", 5) == 5);
 
   22  CHECK (s->search_next (
"", 6) == 6);
 
   23  CHECK (s->search_next (
"", 7) == 7);
 
   24  CHECK (s->search_next (
"", 8) == 8);
 
   25  CHECK (s->search_next (
"d", 0) == -1);
 
   26  CHECK (s->search_next (
"d", 1) == -1);
 
   27  CHECK (s->search_next (
"d", 2) == -1);
 
   28  CHECK (s->search_next (
"d", 3) == -1);
 
   29  CHECK (s->search_next (
"d", 4) == -1);
 
   30  CHECK (s->search_next (
"d", 5) == -1);
 
   31  CHECK (s->search_next (
"d", 6) == -1);
 
   32  CHECK (s->search_next (
"d", 7) == -1);
 
   33  CHECK (s->search_next (
"d", 8) == -1);
 
   34  CHECK (s->search_next (
"abcabcabc", 0) == 0);
 
   35  CHECK (s->search_next (
"abcabcabc", 1) == -1);
 
   36  CHECK (s->search_next (
"abcabcabc", 2) == -1);
 
   37  CHECK (s->search_next (
"abcabcabc", 3) == -1);
 
   38  CHECK (s->search_next (
"abcabcabc", 4) == -1);
 
   39  CHECK (s->search_next (
"abcabcabc", 5) == -1);
 
   40  CHECK (s->search_next (
"abcabcabc", 6) == -1);
 
 
   45  CHECK_EQ (s->get_string () == 
"abcabcabc", 
true);
 
 
   51  CHECK (s->search_all (
"") !=
 
   55  CHECK (s->search_all (
"abcabcabc")[0] == (0));
 
 
array< T > append(T a, array< T > b)
Append an element to the beginning of an array.
 
The list class represents a linked list.
 
void get_longest_common(string s1, string s2, int &b1, int &e1, int &b2, int &e2)
 
TEST_CASE("test for operator+= and advance()")