Home
last modified time | relevance | path

Searched refs:to_erase (Results 1 - 3 of 3) sorted by relevance

/third_party/vixl/test/
H A Dtest-invalset.cc253 std::vector<Obj> to_erase; in TEST() local
256 to_erase.push_back(Obj(i, i)); in TEST()
258 to_erase.push_back(Obj(set.size() - 1, set.size() - 1)); // The last element. in TEST()
259 to_erase.push_back(Obj(set.size(), set.size())); // Not in the set. in TEST()
262 while (!to_erase.empty()) { in TEST()
263 size_t erased = set.erase(to_erase.back()); in TEST()
266 expected_total -= to_erase.back().val_; in TEST()
269 to_erase.pop_back(); in TEST()
322 std::vector<Obj> to_erase; in TEST() local
325 to_erase in TEST()
[all...]
/third_party/libabigail/tests/data/test-abidiff-exit/
H A Dtest2-filtered-removed-fns-v0.c4 to_erase() in to_erase() function
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree.h834 // Removes the values at positions [i, i + to_erase), shifting all existing
835 // values and children after that range to the left by to_erase. Clears all
836 // children between [i, i + to_erase).
837 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1609 const field_type to_erase, in remove_values()
1612 value_destroy_n(i, to_erase, alloc); in remove_values()
1614 const field_type src_i = i + to_erase; in remove_values()
1619 for (int j = 0; j < to_erase; ++j) { in remove_values()
1623 for (int j = i + to_erase + 1; j <= orig_finish; ++j) { in remove_values()
1624 set_child(j - to_erase, chil in remove_values()
1608 remove_values(const field_type i, const field_type to_erase, allocator_type *alloc) remove_values() argument
[all...]

Completed in 5 milliseconds