Home
last modified time | relevance | path

Searched refs:insert_position (Results 1 – 10 of 10) sorted by relevance

/external/webrtc/modules/audio_coding/neteq/
Daudio_vector_unittest.cc178 int insert_position = 5; in TEST_F() local
179 vec.InsertAt(new_array, kNewLength, insert_position); in TEST_F()
184 for (int i = 0; i < insert_position; ++i) { in TEST_F()
192 for (size_t i = insert_position; i < array_length(); ++i) { in TEST_F()
206 int insert_position = 5; in TEST_F() local
207 vec.InsertZerosAt(kNewLength, insert_position); in TEST_F()
209 vec_ref.InsertAt(new_array, kNewLength, insert_position); in TEST_F()
227 int insert_position = 0; in TEST_F() local
228 vec.InsertAt(new_array, kNewLength, insert_position); in TEST_F()
237 for (size_t i = insert_position; i < array_length(); ++i) { in TEST_F()
[all …]
/external/openscreen/third_party/abseil/src/absl/container/internal/
Dbtree.h813 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1673 void btree_node<P>::split(const int insert_position, btree_node *dest,
1682 if (insert_position == start()) {
1684 } else if (insert_position == kNodeValues) {
2248 int &insert_position = iter->position;
2264 (1 + (insert_position < static_cast<int>(kNodeValues)));
2267 if (insert_position - to_move >= node->start() ||
2272 insert_position = insert_position - to_move;
2273 if (insert_position < node->start()) {
2274 insert_position = insert_position + left->count() + 1;
[all …]
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/
Dbtree.h912 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1913 void btree_node<P>::split(const int insert_position, btree_node *dest,
1922 if (insert_position == start()) {
1924 } else if (insert_position == kNodeSlots) {
2585 int &insert_position = iter->position_;
2602 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2605 if (static_cast<field_type>(insert_position) - to_move >=
2611 insert_position = static_cast<int>(
2612 static_cast<field_type>(insert_position) - to_move);
2613 if (insert_position < node->start()) {
[all …]
/external/cronet/stable/third_party/abseil-cpp/absl/container/internal/
Dbtree.h939 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1932 void btree_node<P>::split(const int insert_position, btree_node *dest,
1943 if (insert_position == start()) {
1945 } else if (insert_position == kNodeSlots) {
2610 int &insert_position = iter->position_;
2627 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2630 if (static_cast<field_type>(insert_position) - to_move >=
2636 insert_position = static_cast<int>(
2637 static_cast<field_type>(insert_position) - to_move);
2638 if (insert_position < node->start()) {
[all …]
/external/abseil-cpp/absl/container/internal/
Dbtree.h939 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1932 void btree_node<P>::split(const int insert_position, btree_node *dest,
1943 if (insert_position == start()) {
1945 } else if (insert_position == kNodeSlots) {
2610 int &insert_position = iter->position_;
2627 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2630 if (static_cast<field_type>(insert_position) - to_move >=
2636 insert_position = static_cast<int>(
2637 static_cast<field_type>(insert_position) - to_move);
2638 if (insert_position < node->start()) {
[all …]
/external/angle/third_party/abseil-cpp/absl/container/internal/
Dbtree.h942 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1957 void btree_node<P>::split(const int insert_position, btree_node *dest,
1968 if (insert_position == start()) {
1970 } else if (insert_position == kNodeSlots) {
2713 int &insert_position = iter->position_;
2730 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2733 if (static_cast<field_type>(insert_position) - to_move >=
2739 insert_position = static_cast<int>(
2740 static_cast<field_type>(insert_position) - to_move);
2741 if (insert_position < node->start()) {
[all …]
/external/cronet/tot/third_party/abseil-cpp/absl/container/internal/
Dbtree.h939 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1932 void btree_node<P>::split(const int insert_position, btree_node *dest,
1943 if (insert_position == start()) {
1945 } else if (insert_position == kNodeSlots) {
2610 int &insert_position = iter->position_;
2627 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2630 if (static_cast<field_type>(insert_position) - to_move >=
2636 insert_position = static_cast<int>(
2637 static_cast<field_type>(insert_position) - to_move);
2638 if (insert_position < node->start()) {
[all …]
/external/deqp-deps/SPIRV-Tools/source/opt/
Dvector_dce.cpp128 uint32_t insert_position = in MarkInsertUsesAsLive() local
139 new_item.components.Clear(insert_position); in MarkInsertUsesAsLive()
144 if (current_item.components.Get(insert_position)) { in MarkInsertUsesAsLive()
/external/angle/third_party/spirv-tools/src/source/opt/
Dvector_dce.cpp128 uint32_t insert_position = in MarkInsertUsesAsLive() local
139 new_item.components.Clear(insert_position); in MarkInsertUsesAsLive()
144 if (current_item.components.Get(insert_position)) { in MarkInsertUsesAsLive()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dvector_dce.cpp128 uint32_t insert_position = in MarkInsertUsesAsLive() local
139 new_item.components.Clear(insert_position); in MarkInsertUsesAsLive()
144 if (current_item.components.Get(insert_position)) { in MarkInsertUsesAsLive()