container_test::OrderedList_test Class Reference

Polymorphic code for testing concrete sub-classes of container::OrderedList. More...

#include <orderedlist_test.h>

Inheritance diagram for container_test::OrderedList_test:

[legend]

Collaboration diagram for container_test::OrderedList_test:

[legend]

List of all members.

Protected Member Functions
void	append (const Object::Info *type)
void	insertingAndRemoving (const Object::Info *type)

---

Detailed Description

Polymorphic code for testing concrete sub-classes of container::OrderedList.

There are no actual unit tests in OrderedList_test that the googletest framework will recognize and execute automatically. The googletest framework doesn't provide an elegant solution for testing the compliance of derived classes. This class is sub-classed by OrderedLinkedList_test and OrderedArrayList_test in order to re-use common unit test code.

---

Member Function Documentation

void container_test::OrderedList_test::append

(

const Object::Info *

type

)

[protected]

                                                    {
   // Null check, probably not necessary, but I'm just trying to figure
   // out this new framework.
   OrderedList* a = orderedListFactory(type);

   cout << "List a is empty" << endl;
   cout << "  " << a << endl;
   EXPECT_TRUE(a->isEmpty());

   Entity* e1 = new Entity();
   a->append(e1);
   cout << "List a has one item." << endl;
   cout << "  " << a << endl;
   EXPECT_FALSE(a->isEmpty());

   delete a;
}

Here is the call graph for this function:

void container_test::OrderedList_test::insertingAndRemoving

(

const Object::Info *

type

)

[protected]

                                                                  {
   OrderedList* a = orderedListFactory(type);

   const int LIST_SIZE = 5;
   Entity ** data;
   generateDataAndPopulateList(data, a, LIST_SIZE, true);

   EXPECT_TRUE(a->toFirst());
   cout << "Iterating from first to last." << endl;
   for (int i = 0; !a->isTail(); i++ + a->toNext()) {
      cout << "  node[" << i << "] contains: " << *a->currentEntity() << endl;
      EXPECT_EQ(data[i], a->currentEntity());
      EXPECT_TRUE(data[i] == a->currentEntity());
      verifyNonEmptyStateCoherence_notTail(*a, LIST_SIZE);
   }
   verifyNonEmptyStateCoherence_tail(*a, LIST_SIZE);

   cout << "Iterating from last to first." << endl;
   for (int i = (LIST_SIZE - 1); a->toPrev(); i--) {
      cout << "  node[" << i << "] contains: " << *a->currentEntity() << endl;
      EXPECT_EQ(data[i], a->currentEntity());
      EXPECT_TRUE(data[i]->compareKeyTo(*a->currentEntity()) == 0);
      verifyNonEmptyStateCoherence_notTail(*a, LIST_SIZE);
   }
   EXPECT_TRUE(a->isFirst());
   verifyNonEmptyStateCoherence_notTail(*a, LIST_SIZE);

   cout << "Extracting from first to last." << endl;
   int index = 0;
   do {
      Entity *e = a->extractCurrentEntity();
      cout << "  extracted " << *e << endl;
      cout << "    " << a << endl;
      EXPECT_EQ(data[index], e);
      EXPECT_TRUE(data[index]->compareKeyTo(*e) == 0);
      if (index < (LIST_SIZE - 1)) {
         verifyNonEmptyStateCoherence_notTail(*a, LIST_SIZE - index - 1);
      } else {
         verifyEmptyStateCoherence(*a);
      }
      index++;
   } while (!a->isTail());

   cout << "Repopulating same list with extracted Entities" << endl;
   cout << "  " << a << endl;
   for (int i = 0; i < LIST_SIZE; i++) {
      a->insertBefore(data[i]); // should work the same as append() in this case
      cout << "  After insertBefore() " << *data[i] << endl;
      cout << "    " << a << endl;
      verifyNonEmptyStateCoherence_tail(*a, i + 1);
   }

   cout << "Deleting from first to last." << endl;
   index = 0;
   a->toFirst();
   do {
      EXPECT_EQ(data[index], a->currentEntity());
      EXPECT_TRUE(a->deleteCurrent());
      cout << "  deleteCurrent()" << endl;
      cout << "    " << a << endl;
      if (index < (LIST_SIZE - 1)) {
         verifyNonEmptyStateCoherence_notTail(*a, LIST_SIZE - index - 1);
      } else {
         verifyEmptyStateCoherence(*a);
      }
      index++;
   } while (!a->isTail());

   delete a;
   delete data;
}

Here is the call graph for this function:

---

The documentation for this class was generated from the following files:

• orderedlist_test.h
• orderedlist_test.cpp