Lines Matching refs:kNumberOfElements
20 // Note: kNumberOfElements needs to be even.
21 const unsigned int kNumberOfElements = 10;
244 for (unsigned int i = 0; i < kNumberOfElements; ++i) {
260 for (unsigned int i = 0; i < kNumberOfElements; ++i) {
261 if (return_value->PushBack(kNumberOfElements - i - 1) == -1) {
270 // [0,kNumberOfElements - 1,1,kNumberOfElements - 2,...] (this is why
271 // kNumberOfElements need to be even)
280 for (unsigned int i = 0; i < kNumberOfElements; i++) {
286 push_value = kNumberOfElements - uneven_count - 1;
344 ASSERT_EQ(kNumberOfElements,descending_list->GetSize());
350 ASSERT_EQ(kNumberOfElements,ascending_list->GetSize());
382 EXPECT_EQ(kNumberOfElements - 2, ascending_list->GetUnsignedItem(
384 EXPECT_EQ(kNumberOfElements - 2, ascending_list->GetSize());
398 for (unsigned int i = 0; i < kNumberOfElements/2; ++i) {
402 ASSERT_EQ(kNumberOfElements/2, interleave_list->GetSize());
403 ASSERT_EQ(kNumberOfElements/2, descending_list->GetSize());
405 unsigned int insert_position = kNumberOfElements/2;
406 ASSERT_EQ(insert_position * 2, kNumberOfElements);
444 for (unsigned int i = 0; i < kNumberOfElements/2; ++i) {
448 ASSERT_EQ(kNumberOfElements/2, interleave_list->GetSize());
449 ASSERT_EQ(kNumberOfElements/2, ascending_list->GetSize());
451 unsigned int insert_position = kNumberOfElements/2;
452 ASSERT_EQ(insert_position * 2, kNumberOfElements);
