Function TestInt

be/src/util/priority-queue-test.cc:33–70

Basic Push and Pop operations on total_num_values integers.

// Basic Push and Pop operations on total_num_values integers.
void TestInt(int total_num_values) {

  IntComparator int_comparator;
  PriorityQueue<int, IntComparator> queue(int_comparator);
  int values[total_num_values];

  // Setup a total of total_num_values distinct integers in arrayvalues[].
  for (int i = 0; i < total_num_values; i++) {
    values[i] = i;
  }
  // Randomize all elements in values[].
  srand(19);
  for (int i = 0; i < total_num_values - 1; i++) {
    // find an element to swap with the current element at i.
    int index = i + rand() % (total_num_values - i - 1) + 1;
    //
    ASSERT_GE(index, i + 1);
    ASSERT_LE(index, total_num_values - 1);
    // swap elements at i and index
    int t = values[i];
    values[i] = values[index];
    values[index] = t;
  }
  // Push all elements in values[] into the heap.
  for (int i = 0; i < total_num_values; i++) {
    queue.Push(values[i]);
  }
  // Checkout the heap size and allocation capacity.
  ASSERT_EQ(queue.Size(), total_num_values);
  // Pop each element out. Since this is a max-heap, we expect to see
  // elements poped in descending order.
  int v = -1;
  for (int i = 0; i < total_num_values; i++) {
    v = queue.Pop();
    ASSERT_EQ(v, total_num_values - i - 1);
    ASSERT_EQ(queue.Size(), total_num_values - i - 1);
  }
}

TEST(PriorityQueueTest, TestBasic) {
  TestInt(100);