Home
last modified time | relevance | path

Searched refs:to_erase (Results 1 – 25 of 31) sorted by relevance

12

/aosp_15_r20/external/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.push_back(Obj(i, i)); in TEST()
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/
Dlist.hpp319 node_ptr to_erase = node_traits::get_previous(this->get_root_node()); in pop_back_and_dispose() local
320 node_algorithms::unlink(to_erase); in pop_back_and_dispose()
323 node_algorithms::init(to_erase); in pop_back_and_dispose()
324 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_back_and_dispose()
352 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose() local
353 node_algorithms::unlink(to_erase); in pop_front_and_dispose()
356 node_algorithms::init(to_erase); in pop_front_and_dispose()
357 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose()
668 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
670 node_algorithms::unlink(to_erase); in erase_and_dispose()
[all …]
Dslist.hpp412 node_ptr to_erase(it.pointed_node()); in clear_and_dispose() local
415 node_algorithms::init(to_erase); in clear_and_dispose()
416 disposer(priv_value_traits().to_value_ptr(to_erase)); in clear_and_dispose()
491 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose() local
495 node_algorithms::init(to_erase); in pop_front_and_dispose()
496 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose()
1050 node_ptr to_erase(it.pointed_node()); in erase_after_and_dispose() local
1054 if(cache_last && (to_erase == this->get_last_node())){ in erase_after_and_dispose()
1058 node_algorithms::init(to_erase); in erase_after_and_dispose()
1059 disposer(priv_value_traits().to_value_ptr(to_erase)); in erase_after_and_dispose()
[all …]
Dtreap.hpp855 node_ptr to_erase(i.pointed_node()); in erase() local
856 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase)); in erase()
858 (this->tree_type::header_ptr(), to_erase, this->prio_node_prio_comp(this->priv_pcomp())); in erase()
861 node_algorithms::init(to_erase); in erase()
927 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
929 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
Dsgtree.hpp616 node_ptr to_erase(i.pointed_node()); in erase() local
617 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase)); in erase()
620 ( this->tree_type::header_ptr(), to_erase, (std::size_t)this->size() in erase()
625 node_algorithms::init(to_erase); in erase()
653 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
655 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
Dbstree.hpp1417 node_ptr to_erase(i.pointed_node()); in erase() local
1418 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase)); in erase()
1419 node_algorithms::erase(this->header_ptr(), to_erase); in erase()
1422 node_algorithms::init(to_erase); in erase()
1491 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
1493 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
/aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/tfrt/jit/transforms/
H A Dtf_jitrt_copy_removal.cc33 mlir::SmallVector<mlir::Operation*> to_erase; in runOnOperation() local
34 function.walk([&to_erase](mlir::memref::CopyOp copy) { in runOnOperation()
49 to_erase.push_back(alloc); in runOnOperation()
50 to_erase.push_back(dealloc); in runOnOperation()
51 to_erase.push_back(copy); in runOnOperation()
55 for (auto op : to_erase) { in runOnOperation()
/aosp_15_r20/external/cronet/components/nacl/browser/
H A Dpnacl_host.cc561 auto to_erase(it++); in RendererClosing() local
562 if (to_erase->first.first == render_process_id) { in RendererClosing()
564 if (to_erase->second.nexe_fd) { in RendererClosing()
565 std::unique_ptr<base::File> file(to_erase->second.nexe_fd); in RendererClosing()
566 to_erase->second.nexe_fd = nullptr; in RendererClosing()
569 std::string key(to_erase->second.cache_key); in RendererClosing()
570 bool may_be_cached = TranslationMayBeCached(to_erase); in RendererClosing()
571 pending_translations_.erase(to_erase); in RendererClosing()
/aosp_15_r20/external/pytorch/torch/fx/
H A Dgraph.py1047 def erase_node(self, to_erase : Node) -> None:
1056 if len(to_erase.users) > 0:
1059 if to_erase.graph != self:
1061 if to_erase._erased:
1067 f(to_erase)
1069 self._find_nodes_lookup_table.remove(to_erase)
1070 to_erase._remove_from_list()
1071 to_erase._erased = True # iterators may retain handles to erased nodes
1076 new_args = map_arg(to_erase.args, lambda n: None)
1078 to_erase.args = new_args
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/range/doc/reference/algorithm_ext/
Derase.qbk14 iterator_range<typename Container::iterator> to_erase);
19 `erase` the iterator range `to_erase` from the container `target`.
35 Linear. Proprotional to `distance(to_erase)`.
/aosp_15_r20/external/pytorch/torch/csrc/jit/frontend/
H A Dparse_string_literal.h42 size_t to_erase = 2; in parseStringLiteral() local
75 to_erase = 4; in parseStringLiteral()
81 ret_str.replace(pos, to_erase, /* num copies */ 1, c); in parseStringLiteral()
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/range/include/boost/range/algorithm_ext/
Derase.hpp28 iterator_range<BOOST_DEDUCED_TYPENAME Container::iterator> to_erase ) in erase() argument
31 on.erase( boost::begin(to_erase), boost::end(to_erase) ); in erase()
/aosp_15_r20/external/ComputeLibrary/src/core/helpers/
H A DMemoryHelpers.h110 const bool to_erase = wk.lifetime == experimental::MemoryLifetime::Prepare; in release_prepare_tensors()
111 if(to_erase) in release_prepare_tensors()
115 return to_erase; in release_prepare_tensors()
/aosp_15_r20/external/tensorflow/tensorflow/core/ir/importexport/tests/roundtrip/
H A Droundtrip.cc140 llvm::SmallVector<int> to_erase; in NormalizeTensorData() local
143 to_erase.push_back(arg_attr.first); in NormalizeTensorData()
146 for (int idx : to_erase) func->mutable_arg_attr()->erase(idx); in NormalizeTensorData()
/aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/tfrt/jit/
H A Dtf_cpurt_passes.cc268 mlir::SmallVector<mlir::Operation*> to_erase; in runOnFunction() local
269 function.walk([&to_erase](mlir::linalg::CopyOp copy) { in runOnFunction()
283 to_erase.push_back(alloc); in runOnFunction()
284 to_erase.push_back(dealloc); in runOnFunction()
285 to_erase.push_back(copy); in runOnFunction()
289 for (auto op : to_erase) { in runOnFunction()
/aosp_15_r20/external/executorch/exir/
H A Dgraph.py37 def erase_node(self, to_erase: fx.Node) -> None:
42 return self._graph.erase_node(to_erase)
/aosp_15_r20/external/webrtc/modules/rtp_rtcp/source/
H A Dpacket_loss_stats.cc120 auto to_erase = it++; in PruneBuffer() local
121 lost_packets_buffer_.erase(to_erase); in PruneBuffer()
/aosp_15_r20/external/pytorch/torch/csrc/jit/runtime/static/
H A Dpasses.cpp1242 std::vector<Node*> to_erase; in UseSplitAndSqueeze() local
1289 to_erase.insert(to_erase.end(), squeeze_nodes.begin(), squeeze_nodes.end()); in UseSplitAndSqueeze()
1290 to_erase.push_back(list_unpack_node); in UseSplitAndSqueeze()
1291 to_erase.push_back(node); in UseSplitAndSqueeze()
1293 for (auto* node : to_erase) { in UseSplitAndSqueeze()
/aosp_15_r20/external/openscreen/third_party/abseil/src/absl/container/internal/
H A Dbtree.h804 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1563 const field_type to_erase,
1566 value_destroy_n(i, to_erase, alloc);
1568 const field_type src_i = i + to_erase;
1573 for (int j = 0; j < to_erase; ++j) {
1577 for (int j = i + to_erase + 1; j <= orig_finish; ++j) {
1578 set_child(j - to_erase, child(j));
1582 set_finish(orig_finish - to_erase);
2194 const size_type to_erase =
2196 begin.node->remove_values(begin.position, to_erase, mutable_allocator());
[all …]
/aosp_15_r20/external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/container/internal/
H A Dbtree.h903 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1803 const field_type to_erase,
1806 value_destroy_n(i, to_erase, alloc);
1808 const field_type src_i = i + to_erase;
1813 for (field_type j = 0; j < to_erase; ++j) {
1817 for (field_type j = i + to_erase + 1; j <= orig_finish; ++j) {
1818 set_child(j - to_erase, child(j));
1822 set_finish(orig_finish - to_erase);
2530 const field_type to_erase = static_cast<field_type>(
2533 to_erase, mutable_allocator());
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/
Dbtree.h903 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1803 const field_type to_erase,
1806 value_destroy_n(i, to_erase, alloc);
1808 const field_type src_i = i + to_erase;
1813 for (field_type j = 0; j < to_erase; ++j) {
1817 for (field_type j = i + to_erase + 1; j <= orig_finish; ++j) {
1818 set_child(j - to_erase, child(j));
1822 set_finish(orig_finish - to_erase);
2530 const field_type to_erase = static_cast<field_type>(
2533 to_erase, mutable_allocator());
[all …]
/aosp_15_r20/external/webrtc/third_party/abseil-cpp/absl/container/internal/
H A Dbtree.h903 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1760 const field_type to_erase,
1763 value_destroy_n(i, to_erase, alloc);
1765 const field_type src_i = i + to_erase;
1770 for (field_type j = 0; j < to_erase; ++j) {
1774 for (field_type j = i + to_erase + 1; j <= orig_finish; ++j) {
1775 set_child(j - to_erase, child(j));
1779 set_finish(orig_finish - to_erase);
2487 const field_type to_erase = static_cast<field_type>(
2490 to_erase, mutable_allocator());
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/container/include/boost/container/
Dlist.hpp1460 size_type to_erase = len - new_size; in priv_try_shrink() local
1462 if(to_erase < len/2u){ in priv_try_shrink()
1464 while(to_erase--){ in priv_try_shrink()
1470 size_type to_skip = len - to_erase; in priv_try_shrink()
/aosp_15_r20/external/abseil-cpp/absl/container/internal/
H A Dbtree.h930 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1822 const field_type to_erase,
1825 value_destroy_n(i, to_erase, alloc);
1827 const field_type src_i = i + to_erase;
1832 for (field_type j = 0; j < to_erase; ++j) {
1836 for (field_type j = i + to_erase + 1; j <= orig_finish; ++j) {
1837 set_child(j - to_erase, child(j));
1841 set_finish(orig_finish - to_erase);
2555 const field_type to_erase = static_cast<field_type>(
2558 to_erase, mutable_allocator());
[all …]
/aosp_15_r20/external/cronet/third_party/abseil-cpp/absl/container/internal/
H A Dbtree.h930 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1822 const field_type to_erase,
1825 value_destroy_n(i, to_erase, alloc);
1827 const field_type src_i = i + to_erase;
1832 for (field_type j = 0; j < to_erase; ++j) {
1836 for (field_type j = i + to_erase + 1; j <= orig_finish; ++j) {
1837 set_child(j - to_erase, child(j));
1841 set_finish(orig_finish - to_erase);
2555 const field_type to_erase = static_cast<field_type>(
2558 to_erase, mutable_allocator());
[all …]

12