| /aosp_15_r20/external/pigweed/pw_containers/ |
| H A D | intrusive_set_test.cc | 51 void SetUp() override { set_.insert(items_.begin(), items_.end()); } in SetUp()
53 void TearDown() override { set_.clear(); } in TearDown()
68 IntrusiveSet set_; member in __anonb368cb8d0111::IntrusiveSetTest
84 set_.clear(); in TEST_F()
99 set_.clear(); in TEST_F()
115 set_.clear(); in TEST_F()
134 set_.clear(); in TEST_F()
169 const IntrusiveSet& set = set_; in TEST_F()
190 const IntrusiveSet& set = set_; in TEST_F()
211 EXPECT_EQ(set_.end(), set_.cend()); in TEST_F()
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/ADT/ |
| H A D | SetVector.h | 67 set_.clear(); in takeVector()
142 bool result = set_.insert(X).second; in insert()
152 if (set_.insert(*Start).second) in insert()
158 if (set_.erase(X)) { in remove()
173 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
174 set_.erase(V); in erase()
194 llvm::remove_if(vector_, TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
203 return set_.find(key) != set_.end(); in contains()
209 return set_.count(key); in count()
214 set_.clear(); in clear()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/ADT/ |
| D | SetVector.h | 88 set_.clear(); in takeVector()
174 bool result = set_.insert(X).second; in insert()
199 if (set_.erase(X)) { in remove()
218 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
219 set_.erase(V); in erase()
244 TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
259 return set_.find(key) != set_.end(); in contains()
269 return set_.count(key); in count()
274 set_.clear(); in clear()
281 set_.erase(back()); in pop_back()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/ADT/ |
| D | SetVector.h | 88 set_.clear(); in takeVector()
174 bool result = set_.insert(X).second; in insert()
199 if (set_.erase(X)) { in remove()
218 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
219 set_.erase(V); in erase()
244 TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
259 return set_.find(key) != set_.end(); in contains()
269 return set_.count(key); in count()
274 set_.clear(); in clear()
281 set_.erase(back()); in pop_back()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/llvm/ADT/ |
| D | SetVector.h | 88 set_.clear(); in takeVector()
174 bool result = set_.insert(X).second; in insert()
199 if (set_.erase(X)) { in remove()
218 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
219 set_.erase(V); in erase()
244 TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
259 return set_.find(key) != set_.end(); in contains()
269 return set_.count(key); in count()
274 set_.clear(); in clear()
281 set_.erase(back()); in pop_back()
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/ADT/ |
| D | SetVector.h | 88 set_.clear(); in takeVector()
174 bool result = set_.insert(X).second; in insert()
199 if (set_.erase(X)) { in remove()
218 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
219 set_.erase(V); in erase()
244 TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
259 return set_.find(key) != set_.end(); in contains()
269 return set_.count(key); in count()
274 set_.clear(); in clear()
281 set_.erase(back()); in pop_back()
[all …]
|
| /aosp_15_r20/external/cronet/base/task/thread_pool/ |
| H A D | worker_thread_set.cc | 26 auto old_first = set_.begin(); in Insert()
27 set_.insert(worker); in Insert()
28 if (worker != *set_.begin()) in Insert()
30 else if (old_first != set_.end()) in Insert()
37 WorkerThreadWaitableEvent* const worker = *set_.begin(); in Take()
38 set_.erase(set_.begin()); in Take()
40 (*set_.begin())->EndUnusedPeriod(); in Take()
47 return *set_.begin(); in Peek()
51 return set_.count(const_cast<WorkerThreadWaitableEvent*>(worker)) > 0; in Contains()
56 DCHECK_NE(worker, *set_.begin()); in Remove()
[all …]
|
| /aosp_15_r20/external/webrtc/rtc_base/numerics/ |
| H A D | percentile_filter.h | 52 std::multiset<T> set_; variable
61 percentile_it_(set_.begin()), in PercentileFilter()
70 set_.insert(value); in Insert()
71 if (set_.size() == 1u) { in Insert()
73 percentile_it_ = set_.begin(); in Insert()
84 typename std::multiset<T>::const_iterator it = set_.lower_bound(value); in Erase()
86 if (it == set_.end() || *it != value) in Erase()
91 percentile_it_ = set_.erase(it); in Erase()
93 set_.erase(it); in Erase()
104 if (set_.empty()) in UpdatePercentileIterator()
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | SetVector.h | 67 set_.clear(); in takeVector()
142 bool result = set_.insert(X).second; in insert()
152 if (set_.insert(*Start).second) in insert()
158 if (set_.erase(X)) { in remove()
173 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
174 set_.erase(V); in erase()
201 llvm::remove_if(vector_, TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
211 return set_.count(key); in count()
216 set_.clear(); in clear()
223 set_.erase(back()); in pop_back()
[all …]
|
| /aosp_15_r20/external/llvm/include/llvm/ADT/ |
| H A D | SetVector.h | 129 bool result = set_.insert(X).second; in insert()
139 if (set_.insert(*Start).second) in insert()
145 if (set_.erase(X)) { in remove()
161 assert(set_.count(V) && "Corrupted SetVector instances!"); in erase()
162 set_.erase(V); in erase()
190 TestAndEraseFromSet<UnaryPredicate>(P, set_)); in remove_if()
200 return set_.count(key); in count()
205 set_.clear(); in clear()
212 set_.erase(back()); in pop_back()
259 /// call set_.erase(x) on each element which is slated for removal.
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/regex/include/boost/regex/v5/ |
| D | perl_matcher.hpp | 121 const re_set_long<char_classT>* set_, in re_is_set_member() argument
124 const charT* p = reinterpret_cast<const charT*>(set_+1); in re_is_set_member()
140 for(i = 0; i < set_->csingles; ++i) in re_is_set_member()
151 return set_->isnot ? next : (ptr == next) ? ++next : ptr; in re_is_set_member()
164 return set_->isnot ? next : (ptr == next) ? ++next : ptr; in re_is_set_member()
173 if(set_->cranges || set_->cequivalents) in re_is_set_member()
178 if(set_->cranges) in re_is_set_member()
187 for(i = 0; i < set_->cranges; ++i) in re_is_set_member()
194 return set_->isnot ? next : ++next; in re_is_set_member()
209 if(set_->cequivalents) in re_is_set_member()
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/regex/include/boost/regex/v4/ |
| D | perl_matcher.hpp | 158 const re_set_long<char_classT>* set_, in re_is_set_member() argument
161 const charT* p = reinterpret_cast<const charT*>(set_+1); in re_is_set_member()
177 for(i = 0; i < set_->csingles; ++i) in re_is_set_member()
188 return set_->isnot ? next : (ptr == next) ? ++next : ptr; in re_is_set_member()
201 return set_->isnot ? next : (ptr == next) ? ++next : ptr; in re_is_set_member()
210 if(set_->cranges || set_->cequivalents) in re_is_set_member()
215 if(set_->cranges) in re_is_set_member()
224 for(i = 0; i < set_->cranges; ++i) in re_is_set_member()
231 return set_->isnot ? next : ++next; in re_is_set_member()
246 if(set_->cequivalents) in re_is_set_member()
[all …]
|
| /aosp_15_r20/art/runtime/ |
| H A D | intern_table.cc | 84 auto it = table.set_.FindWithHash(GcRoot<mirror::String>(old_ref), hash); in VisitRoots()
85 if (it != table.set_.end()) { in VisitRoots()
326 auto it = table.set_.FindWithHash(GcRoot<mirror::String>(s), hash); in Remove()
327 if (it != table.set_.end()) { in Remove()
328 table.set_.erase(it); in Remove()
342 DCHECK(table.set_.FindWithHash(GcRoot<mirror::String>(s), hash) == table.set_.end()); in Find()
347 auto it = table.set_.FindWithHash(GcRoot<mirror::String>(s), hash); in Find()
348 if (it != table.set_.end()) { in Find()
361 auto it = table.set_.FindWithHash(string, hash); in Find()
362 if (it != table.set_.end()) { in Find()
[all …]
|
| /aosp_15_r20/external/pytorch/torch/distributed/_composable/fsdp/ |
| H A D | _fsdp_param.py | 68 lib.define("set_(Tensor(a!) tensor, Tensor data) -> ()")
71 @torch.library.impl(lib, "set_", "Meta")
72 @torch.library.impl(lib, "set_", "CUDA")
73 @torch.library.impl(lib, "set_", "CPU")
74 def set_(tensor, data): function
75 tensor.set_(data)
79 [Note: Avoiding functionalization for fsdp.set_ and inductor.resize_storage_bytes_(0)]
81 Currently we don't functionalize `fsdp.set_` op or `inductor.resize_storage_bytes_(0)` op
87 (2) One of them is mutated (set_ and resize_(0) to handle the all-gathered param).
92 The compromise we use is to avoid functionalization for the FSDP2 set_ and resize_(0) ops.
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/SPIRV-Tools/source/ |
| H A D | enum_set.h | 92 : set_(other.set_), in Iterator()
98 if (bucketIndex_ >= set_->buckets_.size()) {
99 bucketIndex_ = set_->buckets_.size();
111 } while (bucketIndex_ < set_->buckets_.size() &&
112 !set_->HasEnumAt(bucketIndex_, bucketOffset_));
123 assert(set_->HasEnumAt(bucketIndex_, bucketOffset_) &&
125 return GetValueFromBucket(set_->buckets_[bucketIndex_], bucketOffset_);
129 return set_ != other.set_ || bucketOffset_ != other.bucketOffset_ ||
138 set_ = other.set_;
146 : set_(set), bucketIndex_(bucketIndex), bucketOffset_(bucketOffset) {} in Iterator()
[all …]
|
| /aosp_15_r20/external/angle/third_party/spirv-tools/src/source/ |
| H A D | enum_set.h | 92 : set_(other.set_), in Iterator()
98 if (bucketIndex_ >= set_->buckets_.size()) {
99 bucketIndex_ = set_->buckets_.size();
111 } while (bucketIndex_ < set_->buckets_.size() &&
112 !set_->HasEnumAt(bucketIndex_, bucketOffset_));
123 assert(set_->HasEnumAt(bucketIndex_, bucketOffset_) &&
125 return GetValueFromBucket(set_->buckets_[bucketIndex_], bucketOffset_);
129 return set_ != other.set_ || bucketOffset_ != other.bucketOffset_ ||
138 set_ = other.set_;
146 : set_(set), bucketIndex_(bucketIndex), bucketOffset_(bucketOffset) {} in Iterator()
[all …]
|
| /aosp_15_r20/external/deqp-deps/SPIRV-Tools/source/ |
| D | enum_set.h | 92 : set_(other.set_), in Iterator()
98 if (bucketIndex_ >= set_->buckets_.size()) {
99 bucketIndex_ = set_->buckets_.size();
111 } while (bucketIndex_ < set_->buckets_.size() &&
112 !set_->HasEnumAt(bucketIndex_, bucketOffset_));
123 assert(set_->HasEnumAt(bucketIndex_, bucketOffset_) &&
125 return GetValueFromBucket(set_->buckets_[bucketIndex_], bucketOffset_);
129 return set_ != other.set_ || bucketOffset_ != other.bucketOffset_ ||
138 set_ = other.set_;
146 : set_(set), bucketIndex_(bucketIndex), bucketOffset_(bucketOffset) {} in Iterator()
[all …]
|
| /aosp_15_r20/external/pytorch/torch/_functorch/_aot_autograd/ |
| H A D | functional_utils.py | 155 # Note: "storage mutations" coming from set_() are a type of metadata mutation. So:
180 # This is true if the current tensor experienced at least one set_() call
182 # However, multiple set_() calls can cancel out. So we also check whether the
184 # Note: if an input experienced two set_() calls that cancel out, **and**
185 # it experiences an data mutation, we pessimistically think that the set_()
217 …e consider a tensor to have been metadata mutated if its storage was mutated through a set_() call.
406 torch.ops.aten.set_.source_Tensor,
408 if hasattr(torch.ops.fsdp, "set_"):
409 allowed_mutation_ops.append(torch.ops.fsdp.set_.default)
422 # Can only copy_/set_ into an input
[all …]
|
| /aosp_15_r20/external/cronet/third_party/re2/src/python/ |
| H A D | _re2.cc | 154 : set_(options, anchor) {} in Set()
165 int index = set_.Add(pattern, /*error=*/NULL); // -1 on error in Add()
171 return set_.Compile(); in Compile()
179 set_.Match(text, &matches); in Match()
184 RE2::Set set_; member in re2_python::Set
210 set_ = std::make_unique<RE2::Set>(options, RE2::UNANCHORED); in Compile()
212 if (set_->Add(atoms[i], /*error=*/NULL) != i) { in Compile()
214 py::pybind11_fail("set_->Add() failed"); in Compile()
218 return set_->Compile(); in Compile()
222 if (set_ == nullptr) { in Match()
[all …]
|
| /aosp_15_r20/external/libopus/dnn/torch/weight-exchange/wexchange/torch/ |
| H A D | torch.py | 243 gru.weight_ih_l0.set_(torch.from_numpy(w_ih))
244 gru.weight_hh_l0.set_(torch.from_numpy(w_hh))
245 gru.bias_ih_l0.set_(torch.from_numpy(b_ih))
246 gru.bias_hh_l0.set_(torch.from_numpy(b_hh))
273 dense.weight.set_(torch.from_numpy(w))
275 dense.bias.set_(torch.from_numpy(b))
301 conv.weight.set_(torch.from_numpy(w))
305 conv.bias.set_(torch.from_numpy(b))
331 conv.weight.set_(torch.from_numpy(w))
335 conv.bias.set_(torch.from_numpy(b))
[all …]
|
| /aosp_15_r20/external/pytorch/test/profiler/ |
| H A D | test_torch_tidy.py | 90 # `.set_` points a Tensor at an existing storage.
92 c.set_(d.storage())
121 # Calling `set_` with an existing Tensor makes them share an ID.
163 x.set_()
165 x.set_(torch.ones((1,)).storage())
191 x.set_()
192 x.set_(torch.ones((1,)).storage())
195 # (Despite the `set_()` call.)
207 x.set_()
210 x.set_(torch.ones((1,)).storage())
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/upb/protos_generator/ |
| D | gen_accessors.cc | 119 void set_$1($0 value); in WriteFieldAccessorsInHeader()
135 inline void set_$1($0 value) { return $2_set_$3(msg_, value); } in WriteFieldAccessorsInHeader()
188 bool set_$0($1 key, $3 value); in WriteMapFieldAccessors()
189 bool set_$0($1 key, $4 value); in WriteMapFieldAccessors()
198 bool set_$0($1 key, $2 value); in WriteMapFieldAccessors()
250 void $0::set_$2($1 value) { in WriteAccessorsInSource()
312 bool $0::set_$1($2 key, $3 value) { in WriteMapAccessorDefinitions()
324 bool $0::set_$1($2 key, $3 value) { in WriteMapAccessorDefinitions()
361 bool $0::set_$1($2 key, $3 value) { in WriteMapAccessorDefinitions()
394 bool $0::set_$1($2 key, $3 value) { in WriteMapAccessorDefinitions()
[all …]
|
| /aosp_15_r20/external/perfetto/src/traced/probes/ftrace/ |
| H A D | printk_formats_parser.h | 48 set_.insert(PrintkEntry(address, name)); in insert()
52 auto it = set_.find(address); in at()
53 if (it == set_.end()) { in at()
59 size_t size() const { return set_.size(); } in size()
61 size_t empty() const { return set_.empty(); } in empty()
63 base::FlatSet<PrintkEntry> set_; variable
|
| /aosp_15_r20/external/libchrome/base/sampling_heap_profiler/ |
| H A D | lock_free_address_hash_set_unittest.cc | 120 : SimpleThread("ReaderThread"), set_(set), cancel_(cancel) {} in WriterThread()
125 set_->Insert(ptr); in Run()
126 EXPECT_TRUE(set_->Contains(ptr)); in Run()
127 set_->Remove(ptr); in Run()
128 EXPECT_FALSE(set_->Contains(ptr)); in Run()
131 set_->Insert(reinterpret_cast<void*>(0x1337)); in Run()
135 LockFreeAddressHashSet* set_; member in base::__anon32f36d4e0111::WriterThread
|
| /aosp_15_r20/external/cronet/base/sampling_heap_profiler/ |
| H A D | lock_free_address_hash_set_unittest.cc | 122 : SimpleThread("ReaderThread"), set_(set), cancel_(cancel) {} in WriterThread()
128 set_->Insert(ptr); in Run()
129 EXPECT_TRUE(set_->Contains(ptr)); in Run()
130 set_->Remove(ptr); in Run()
131 EXPECT_FALSE(set_->Contains(ptr)); in Run()
134 set_->Insert(reinterpret_cast<void*>(0x1337)); in Run()
138 raw_ptr<LockFreeAddressHashSet> set_; member in base::__anon48a927040111::WriterThread
|