tesseract::HeapTest Class Reference

Inheritance diagram for tesseract::HeapTest:

Public Member Functions
virtual	~HeapTest ()
void	PushTestData (GenericHeap< IntKDPair > *heap, KDVector *v)
void	VerifyHeapVectorMatch (GenericHeap< IntKDPair > *heap, KDVector *v)

Protected Member Functions
void	SetUp ()

Detailed Description

Definition at line 27 of file heap_test.cc.

Constructor & Destructor Documentation

~HeapTest()

tesseract::HeapTest::~HeapTest ( )

virtualdefault

Member Function Documentation

PushTestData()

void tesseract::HeapTest::PushTestData ( GenericHeap< IntKDPair > *  heap, KDVector *  v  )

inline

Definition at line 36 of file heap_test.cc.

                                                               {
    for (size_t i = 0; i < ARRAYSIZE(test_data); ++i) {
      IntKDPair pair(test_data[i], i);
      heap->Push(&pair);
      v->push_back(pair);
    }
  }

SetUp()

void tesseract::HeapTest::SetUp ( )

inlineprotected

Definition at line 29 of file heap_test.cc.

               {
    std::locale::global(std::locale(""));
  }

VerifyHeapVectorMatch()

void tesseract::HeapTest::VerifyHeapVectorMatch ( GenericHeap< IntKDPair > *  heap, KDVector *  v  )

inline

Definition at line 45 of file heap_test.cc.

                                                                        {
    EXPECT_FALSE(heap->empty());
    EXPECT_EQ(heap->size(), v->size());
    // Sort the vector and check that the keys come out of the heap in the same
    // order as v.
    // Also check that the indices match, except for 9, which is duplicated.
    v->sort();
    // Check that we have increasing order.
    EXPECT_LT((*v)[0].key, v->back().key);
    for (int i = 0; i < v->size(); ++i) {
      EXPECT_EQ((*v)[i].key, heap->PeekTop().key);
      // Indices don't necessarily match for equal keys, so don't test them.
      if (i + 1 < v->size() && (*v)[i + 1].key == (*v)[i].key) {
        while (i + 1 < v->size() && (*v)[i + 1].key == (*v)[i].key) {
          heap->Pop(nullptr);
          ++i;
          EXPECT_FALSE(heap->empty());
          EXPECT_EQ((*v)[i].key, heap->PeekTop().key);
        }
      } else {
        // The indices must also match if the key is unique.
        EXPECT_EQ((*v)[i].data, heap->PeekTop().data);
      }
      EXPECT_FALSE(heap->empty());
      EXPECT_TRUE(heap->Pop(nullptr));
    }
    EXPECT_TRUE(heap->empty());
  }

---

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

• /tesseract/unittest/heap_test.cc