 m_queue.num_elements();     int key_val= (*top)->key;     EXPECT_EQ(expected_key_val, key_val);     Test_element *element= (*top)->element;     EXPECT_EQ(expected_key_val, element->val);   } }   /*   Verifies that push and bounded size works, and that pop() gives sorted order.  