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

  /external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/
audio_vector_unittest.cc 189 int insert_position = 5; local
190 vec.InsertAt(new_array, kNewLength, insert_position);
192 // {0, 1, ..., |insert_position| - 1, 100, 101, ..., 100 + kNewLength - 1,
193 // |insert_position|, |insert_position| + 1, ..., kLength - 1}.
195 for (int i = 0; i < insert_position; ++i) {
203 for (size_t i = insert_position; i < array_length(); ++i) {
217 int insert_position = 5; local
218 vec.InsertZerosAt(kNewLength, insert_position);
220 vec_ref.InsertAt(new_array, kNewLength, insert_position);
238 int insert_position = 0; local
264 int insert_position = array_length(); local
293 int insert_position = array_length() + 10; \/\/ Too large. local
319 size_t insert_position = 2; local
349 int insert_position = array_length() - 2; local
    [all...]
  /external/webrtc/src/system_wrappers/source/
list_unittest.cc 405 unsigned int insert_position = kNumberOfElements/2; local
406 ASSERT_EQ(insert_position * 2, kNumberOfElements);
419 for (unsigned int j = 0; j < insert_position - 1; ++j) {
424 --insert_position;
451 unsigned int insert_position = kNumberOfElements/2; local
452 ASSERT_EQ(insert_position * 2, kNumberOfElements);
465 for (unsigned int j = 0; j < insert_position - 1; ++j) {
470 --insert_position;
  /external/chromium_org/components/bookmarks/browser/
bookmark_utils.cc 267 std::vector<const BookmarkNode*>::iterator insert_position = local
270 if (nodes->size() < count || insert_position != nodes->end()) {
271 nodes->insert(insert_position, node);

Completed in 3071 milliseconds