Searched refs:list_ (Results 1 - 25 of 67) sorted by relevance

123

/external/perfetto/src/tracing/core/
H A Dpatch_list.h71 PatchList() : last_(list_.before_begin()) {}
76 last_ = list_.emplace_after(last_, chunk_id, offset);
81 PERFETTO_DCHECK(!list_.empty());
82 list_.pop_front();
84 last_ = list_.before_begin();
88 PERFETTO_DCHECK(!list_.empty());
89 return list_.front();
93 PERFETTO_DCHECK(!list_.empty());
97 ListType::const_iterator begin() const { return list_.begin(); }
98 ListType::const_iterator end() const { return list_
102 ListType list_; member in class:perfetto::PatchList
[all...]
/external/tensorflow/tensorflow/contrib/py2tf/utils/
H A Dtensor_list.py33 self.list_ = list_ops.tensor_list_push_back(self.list_, value)
36 self.list_, value = list_ops.tensor_list_pop_back(self.list_, self.dtype)
40 self.list_ = list_ops.empty_tensor_list(self.shape, self.dtype)
43 return list_ops.tensor_list_length(self.list_)
46 return list_ops.tensor_list_get_item(self.list_, key, self.dtype)
49 self.list_ = list_ops.tensor_list_set_item(self.list_, key, value)
/external/libchrome/base/
H A Dcallback_list.h81 : list_(list),
86 if (list_->active_iterator_count_) {
89 list_->callbacks_.erase(iter_);
90 if (!list_->removal_callback_.is_null())
91 list_->removal_callback_.Run();
96 CallbackListBase<CallbackType>* list_; member in class:base::internal::CallbackListBase::Subscription
128 : list_(list),
129 list_iter_(list_->callbacks_.begin()) {
130 ++list_->active_iterator_count_;
134 : list_(ite
158 CallbackListBase<CallbackType>* list_; member in class:base::internal::CallbackListBase::Iterator
[all...]
H A Dobserver_list.h114 return std::min(max_index_, list_->observers_.size());
117 bool is_end() const { return !list_ || index_ == clamped_max_index(); }
119 WeakPtr<ObserverListBase<ObserverType>> list_; member in class:base::ObserverListBase::Iter
191 : list_(const_cast<ObserverListBase<ObserverType>*>(list)->AsWeakPtr()),
196 DCHECK(list_);
197 ++list_->notify_depth_;
203 if (list_ && --list_->notify_depth_ == 0)
204 list_->Compact();
213 return list_
[all...]
H A Dvalues.cc125 list_.Init();
381 if (lhs.list_->size() != rhs.list_->size())
384 std::begin(*lhs.list_), std::end(*lhs.list_), std::begin(*rhs.list_),
426 std::begin(*lhs.list_), std::end(*lhs.list_), std::begin(*rhs.list_),
427 std::end(*rhs.list_),
[all...]
H A Dobserver_list_unittest.cc45 : list_(list), doomed_(doomed), remove_self_(remove_self) {}
55 list_->RemoveObserver(this);
57 list_->RemoveObserver(doomed_);
63 ObserverList<Foo>* list_; member in class:base::__anon10907::Disrupter
71 : list_(list),
75 void Observe(int x) override { list_->RemoveObserver(doomed_); }
78 ObserverListThreadSafe<Foo>* list_; member in class:base::__anon10907::ThreadSafeDisrupter
111 : list_(list),
145 list_->AddObserver(this);
150 list_
178 ObserverListThreadSafe<Foo>* list_; member in class:base::__anon10907::AddRemoveThread
402 const scoped_refptr<ObserverListThreadSafe<Foo> > list_; member in class:base::FooRemover
560 ObserverList<Foo>* const list_; member in class:base::AddInClearObserve
600 ObserverList<Foo>* list_; member in class:base::ListDestructor
[all...]
H A Dvalues.h201 ManualConstructor<ListStorage> list_; member in union:base::Value::__anon11090
391 size_t GetSize() const { return list_->size(); }
394 bool empty() const { return list_->empty(); }
481 iterator begin() { return list_->begin(); }
482 iterator end() { return list_->end(); }
484 const_iterator begin() const { return list_->begin(); }
485 const_iterator end() const { return list_->end(); }
/external/perfetto/src/traced/probes/filesystem/
H A Dlru_inode_cache.cc31 return &list_.begin()->second;
42 list_.emplace_front(k, std::move(v));
45 list_.erase(list_it);
46 list_it = list_.begin();
48 map_.emplace(std::move(k), list_.begin());
52 auto list_last_it = list_.end();
55 list_.erase(list_last_it);
H A Dlru_inode_cache.h50 std::list<ItemType> list_; member in class:perfetto::LRUInodeCache
/external/v8/src/compiler/
H A Dast-loop-assignment-analyzer.h25 for (size_t i = 0; i < list_.size(); i++) {
27 if (list_[i].first == loop) return list_[i].second;
37 explicit LoopAssignmentAnalysis(Zone* zone) : list_(zone) {}
38 ZoneVector<std::pair<IterationStatement*, BitVector*>> list_; member in class:v8::internal::compiler::LoopAssignmentAnalysis
/external/v8/src/regexp/
H A Dregexp-parser.h27 BufferedZoneList() : list_(NULL), last_(NULL) {}
34 if (list_ == NULL) {
35 list_ = new (zone) ZoneList<T*>(initial_size, zone);
37 list_->Add(last_, zone);
50 if ((list_ != NULL) && (list_->length() > 0))
51 last_ = list_->RemoveLast();
59 if (list_ == NULL) {
63 if (i == list_->length()) {
67 return list_
94 ZoneList<T*>* list_; member in class:v8::internal::BufferedZoneList
[all...]
/external/tensorflow/tensorflow/contrib/py2tf/converters/
H A Dlist_comprehension.py45 def make_update_list_node(self, list_, elt):
46 return templates.replace('list_.append(elt)', list_=list_, elt=elt)[0]
61 'list_ = create_list',
62 list_=result_node,
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_quarantine.h126 list_.clear();
134 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) {
138 QuarantineBatch *b = list_.back();
146 list_.append_back(&c->list_);
152 list_.push_back(b);
157 if (list_.empty())
159 QuarantineBatch *b = list_.front();
160 list_
166 IntrusiveList<QuarantineBatch> list_; member in class:__sanitizer::QuarantineCache
[all...]
/external/webrtc/webrtc/modules/remote_bitrate_estimator/test/
H A Dbwe.cc228 if (node_it != list_.begin()) {
229 list_.erase(node_it);
230 list_.push_front(node);
231 map_[sequence_number] = list_.begin();
248 map_.erase(list_.back()->sequence_number);
249 delete list_.back();
250 list_.pop_back();
253 list_.push_front(new_head);
254 map_[new_head->sequence_number] = list_.begin();
260 list_
[all...]
H A Dbwe.h87 PacketNodeIt begin() { return list_.begin(); }
88 PacketNodeIt end() { return list_.end(); }
90 bool empty() const { return list_.empty(); }
91 size_t size() const { return list_.size(); }
108 std::list<PacketIdentifierNode*> list_; member in class:webrtc::testing::bwe::LinkedSet
/external/vixl/src/aarch32/
H A Dinstructions-aarch32.h460 RegisterList() : list_(0) {}
462 : list_(RegisterToList(reg)) {}
464 : list_(RegisterToList(reg1) | RegisterToList(reg2)) {}
466 : list_(RegisterToList(reg1) | RegisterToList(reg2) |
469 : list_(RegisterToList(reg1) | RegisterToList(reg2) |
471 explicit RegisterList(uint32_t list) : list_(list) {}
472 uint32_t GetList() const { return list_; }
473 void SetList(uint32_t list) { list_ = list; }
475 return (list_ & RegisterToList(reg)) != 0;
477 void Combine(const RegisterList& other) { list_ |
[all...]
/external/webrtc/webrtc/base/
H A Dflags.cc108 Flag* FlagList::list_ = NULL; member in class:rtc::FlagList
112 list_ = NULL;
119 for (Flag* f = list_; f != NULL; f = f->next()) {
132 Flag* f = list_;
262 flag->next_ = list_;
263 list_ = flag;
H A Dflags.h195 static Flag* list() { return list_; }
243 static Flag* list_; member in class:rtc::FlagList
/external/vixl/src/aarch64/
H A Doperands-aarch64.h524 : list_(reg1.GetBit() | reg2.GetBit() | reg3.GetBit() | reg4.GetBit()),
532 : list_(list), size_(size), type_(type) {
546 list_ = (UINT64_C(1) << (last_reg + 1)) - 1;
547 list_ &= ~((UINT64_C(1) << first_reg) - 1);
566 list_ |= other.GetList();
576 list_ &= ~other.GetList();
597 list_ |= (UINT64_C(1) << code);
603 list_ &= ~(UINT64_C(1) << code);
609 return CPURegList(list_1.type_, list_1.size_, list_1.list_ | list_2.list_);
[all...]
H A Doperands-aarch64.cc37 int index = CountTrailingZeros(list_);
38 VIXL_ASSERT((1 << index) & list_);
49 int index = CountLeadingZeros(list_);
51 VIXL_ASSERT((1 << index) & list_);
62 if (((list_ >> i) & 1) != 0) {
69 return list_ == 0;
/external/autotest/site_utils/bootperf-bin/
H A Dresultset.py43 def _ListStats(list_):
49 @param list_ The list over which to calculate.
54 for v in list_:
57 n = len(list_)
/external/webrtc/talk/app/webrtc/
H A Dstatstypes.cc725 for (auto* r : list_)
731 return list_.begin();
736 return list_.end();
741 return list_.size();
748 list_.push_back(report);
761 Container::iterator it = std::find_if(list_.begin(), list_.end(),
776 Container::iterator it = std::find_if(list_.begin(), list_.end(),
778 return it == list_
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
H A DAST.stg205 if (list_<label> == NULL)
207 list_<label>=ctx->vectors->newVector(ctx->vectors);
209 list_<label>->add(list_<label>, <label>.tree, NULL);
228 if (list_<label> == NULL)
230 list_<label>=ctx->vectors->newVector(ctx->vectors);
237 list_<label>->add(list_<label>, (void *)tcopy, freeScope); /* Add whatever the return type is */<\n>
314 :{it | stream_<it>=antlr3RewriteRule<rewriteElementType>StreamNewAEV(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token <it>", list_<it>); };
322 :{it | stream_<it>=antlr3RewriteRuleSubtreeStreamNewAEV(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token <it>", list_<i
[all...]
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
H A Dgraphcycles.cc71 Vec<int32> list_; // All nodes to reprocess member in struct:tensorflow::GraphCycles::Rep
72 Vec<int32> merged_; // Rank values to assign to list_ entries
251 // Adds contents of delta lists to list_ (backwards deltas first).
252 r->list_.clear();
253 MoveToList(r, &r->deltab_, &r->list_);
254 MoveToList(r, &r->deltaf_, &r->list_);
262 for (Vec<int32>::size_type i = 0; i < r->list_.size(); i++) {
263 r->nodes_[r->list_[i]]->rank = r->merged_[i];
/external/tensorflow/tensorflow/contrib/graph_editor/
H A Dutil.py67 def __init__(self, list_):
68 if not isinstance(list_, list):
69 raise TypeError("Expected a list, got: {}.".format(type(list_)))
70 self._list = list_

Completed in 2108 milliseconds

123