HomeSort by relevance Sort by last modified time
    Searched refs:kNumberOfElements (Results 1 - 6 of 6) sorted by null

  /external/webrtc/src/system_wrappers/test/map/
map.cc 16 const int kNumberOfElements = 10;
55 int element_array[kNumberOfElements];
56 for (int i = 0; i < kNumberOfElements; i++)
62 for (int i = 0; i < kNumberOfElements; i++)
78 FailTest(test_map.Size() != kNumberOfElements - 2);
99 FailTest(test_map.Find(kNumberOfElements + 2) != NULL);
106 int swapped_item = kNumberOfElements;
  /external/webrtc/src/system_wrappers/test/list/
list.cc 16 const int kNumberOfElements = 10;
75 int element_array[kNumberOfElements];
76 for (int i = 0; i < kNumberOfElements; i++)
82 for (int i = 2; i < kNumberOfElements - 2; i++)
87 FailTest(test_list.PushBack(element_array[kNumberOfElements - 2]) != 0);
88 FailTest(test_list.PushBack(element_array[kNumberOfElements - 1]) != 0);
94 FailTest(test_list.GetSize() != kNumberOfElements);
101 FailTest(test_list.GetSize() != kNumberOfElements - 2);
122 kNumberOfElements - 2);
127 kNumberOfElements - 3)
    [all...]
  /external/webrtc/src/system_wrappers/source/
list_unittest.cc 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
    [all...]
map_unittest.cc 18 const int kNumberOfElements = 10;
56 for (int i = 0; i < kNumberOfElements; ++i) {
184 EXPECT_EQ(kNumberOfElements-1,ascending_map_.Size());
192 EXPECT_TRUE(last_value == kNumberOfElements - 1);
198 EXPECT_EQ(kNumberOfElements-2,ascending_map_.Size());
  /external/v8/src/
mark-compact.h 293 ASSERT(0 <= idx_ && idx_ < kNumberOfElements);
316 (buffer->chain_length_ - 1) * kNumberOfElements);
320 return idx_ == kNumberOfElements;
324 return idx_ < kNumberOfElements - 1;
374 static const int kNumberOfElements = 1021;
382 ObjectSlot slots_[kNumberOfElements];
  /external/chromium_org/v8/src/
mark-compact.h 293 ASSERT(0 <= idx_ && idx_ < kNumberOfElements);
336 (buffer->chain_length_ - 1) * kNumberOfElements);
340 return idx_ == kNumberOfElements;
344 return idx_ < kNumberOfElements - 1;
394 static const int kNumberOfElements = 1021;
402 ObjectSlot slots_[kNumberOfElements];
    [all...]

Completed in 249 milliseconds