/external/tensorflow/tensorflow/python/autograph/operators/ |
D | data_structures.py | 171 def list_append(list_, x): argument 189 if isinstance(list_, tensor_array_ops.TensorArray): 190 return _tf_tensorarray_append(list_, x) 191 elif tensor_util.is_tensor(list_): 192 if list_.dtype == dtypes.variant: 193 return _tf_tensor_list_append(list_, x) 197 ' instead found %s' % list_) 199 return _py_list_append(list_, x) 202 def _tf_tensor_list_append(list_, x): argument 210 list_ = control_flow_ops.cond( [all …]
|
/external/libchrome/base/ |
D | observer_list.h | 114 : list_(const_cast<ObserverList*>(list)->AsWeakPtr()), in Iter() 119 DCHECK(list_); in Iter() 120 DCHECK(allow_reentrancy || !list_->live_iterator_count_); in Iter() 122 ++list_->live_iterator_count_; in Iter() 126 if (!list_) in ~Iter() 129 DCHECK_GT(list_->live_iterator_count_, 0); in ~Iter() 130 if (--list_->live_iterator_count_ == 0) in ~Iter() 131 list_->Compact(); in ~Iter() 135 : list_(other.list_), in Iter() 138 if (list_) in Iter() [all …]
|
D | callback_list.h | 79 : list_(list), in Subscription() 84 if (list_->active_iterator_count_) { in ~Subscription() 87 list_->callbacks_.erase(iter_); in ~Subscription() 88 if (!list_->removal_callback_.is_null()) in ~Subscription() 89 list_->removal_callback_.Run(); in ~Subscription() 94 CallbackListBase<CallbackType>* list_; 126 : list_(list), in Iterator() 127 list_iter_(list_->callbacks_.begin()) { in Iterator() 128 ++list_->active_iterator_count_; in Iterator() 132 : list_(iter.list_), in Iterator() [all …]
|
D | values.cc | 127 new (&list_) ListStorage(); in Value() 174 Value::Value(const ListStorage& in_list) : type_(Type::LIST), list_() { in Value() 175 list_.reserve(in_list.size()); in Value() 177 list_.emplace_back(val.Clone()); in Value() 181 : type_(Type::LIST), list_(std::move(in_list)) {} in Value() 207 return Value(list_); in Clone() 256 return list_; in GetList() 261 return list_; in GetList() 573 return lhs.list_ == rhs.list_; in operator ==() 612 return lhs.list_ < rhs.list_; in operator <() [all …]
|
D | observer_list_unittest.cc | 60 : list_(list), doomed_(doomed), remove_self_(remove_self) {} in Disrupter() 70 list_->RemoveObserver(this); in Observe() 72 list_->RemoveObserver(doomed_); in Observe() 78 ObserverList<Foo>* list_; member in base::__anone249295e0111::Disrupter 114 : list_(list), in AddRemoveThread() 154 list_->AddObserver(this); in AddTask() 159 list_->Notify(FROM_HERE, &Foo::Observe, 10); in AddTask() 180 list_->RemoveObserver(this); in Observe() 185 ObserverListThreadSafe<Foo>* list_; member in base::__anone249295e0111::AddRemoveThread 546 explicit FooRemover(ObserverListThreadSafe<Foo>* list) : list_(list) {} in FooRemover() [all …]
|
D | values.h | 369 ListStorage list_; member 610 size_t GetSize() const { return list_.size(); } in GetSize() 614 bool empty() const { return list_.empty(); } in empty() 718 iterator begin() { return list_.begin(); } in begin() 720 iterator end() { return list_.end(); } in end() 723 const_iterator begin() const { return list_.begin(); } in begin() 725 const_iterator end() const { return list_.end(); } in end()
|
/external/perfetto/src/tracing/core/ |
D | patch_list.h | 71 PatchList() : last_(list_.before_begin()) {} in PatchList() 76 last_ = list_.emplace_after(last_, chunk_id, offset); in emplace_back() 81 PERFETTO_DCHECK(!list_.empty()); in pop_front() 82 list_.pop_front(); in pop_front() 84 last_ = list_.before_begin(); in pop_front() 88 PERFETTO_DCHECK(!list_.empty()); in front() 89 return list_.front(); in front() 93 PERFETTO_DCHECK(!list_.empty()); in back() 97 ListType::const_iterator begin() const { return list_.begin(); } in begin() 98 ListType::const_iterator end() const { return list_.end(); } in end() [all …]
|
/external/v8/src/regexp/ |
D | regexp-parser.h | 27 BufferedZoneList() : list_(nullptr), last_(nullptr) {} in BufferedZoneList() 34 if (list_ == nullptr) { in Add() 35 list_ = new (zone) ZoneList<T*>(initial_size, zone); in Add() 37 list_->Add(last_, zone); in Add() 50 if ((list_ != nullptr) && (list_->length() > 0)) in RemoveLast() 51 last_ = list_->RemoveLast(); in RemoveLast() 59 if (list_ == nullptr) { in Get() 63 if (i == list_->length()) { in Get() 67 return list_->at(i); in Get() 73 list_ = nullptr; in Clear() [all …]
|
/external/tensorflow/tensorflow/python/autograph/utils/ |
D | tensor_list.py | 52 self.list_ = list_ops.tensor_list_push_back(self.list_, value) 55 self.list_, value = list_ops.tensor_list_pop_back(self.list_, self.dtype) 59 self.list_ = list_ops.empty_tensor_list(self.shape, self.dtype) 62 return list_ops.tensor_list_length(self.list_) 65 return list_ops.tensor_list_get_item(self.list_, key, self.dtype) 68 self.list_ = list_ops.tensor_list_set_item(self.list_, key, value)
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_quarantine.h | 126 list_.clear(); in QuarantineCache() 134 if (list_.empty() || list_.back()->count == QuarantineBatch::kSize) { in Enqueue() 138 QuarantineBatch *b = list_.back(); in Enqueue() 146 list_.append_back(&c->list_); in Transfer() 152 list_.push_back(b); in EnqueueBatch() 157 if (list_.empty()) in DequeueBatch() 159 QuarantineBatch *b = list_.front(); in DequeueBatch() 160 list_.pop_front(); in DequeueBatch() 166 IntrusiveList<QuarantineBatch> list_; 181 list_.push_back(b); in AllocBatch()
|
/external/perfetto/src/traced/probes/filesystem/ |
D | lru_inode_cache.cc | 31 return &list_.begin()->second; in Get() 42 list_.emplace_front(k, std::move(v)); in Insert() 45 list_.erase(list_it); in Insert() 46 list_it = list_.begin(); in Insert() 48 map_.emplace(std::move(k), list_.begin()); in Insert() 52 auto list_last_it = list_.end(); in Insert() 55 list_.erase(list_last_it); in Insert()
|
/external/vixl/src/aarch32/ |
D | instructions-aarch32.h | 460 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_ |= other.GetList(); } [all …]
|
D | instructions-aarch32.cc | 99 if (((list_ >> i) & 1) != 0) return Register(i); in GetFirstAvailableRegister() 134 if (((list_ >> (i * 4)) & 0xf) == 0xf) return QRegister(i); in GetFirstAvailableQRegister() 142 if (((list_ >> (i * 2)) & 0x3) == 0x3) return DRegister(i); in GetFirstAvailableDRegister() 150 if (((list_ >> i) & 0x1) != 0) return SRegister(i); in GetFirstAvailableSRegister()
|
/external/webrtc/webrtc/modules/remote_bitrate_estimator/test/ |
D | bwe.cc | 228 if (node_it != list_.begin()) { in Insert() 229 list_.erase(node_it); in Insert() 230 list_.push_front(node); in Insert() 231 map_[sequence_number] = list_.begin(); in Insert() 248 map_.erase(list_.back()->sequence_number); in RemoveTail() 249 delete list_.back(); in RemoveTail() 250 list_.pop_back(); in RemoveTail() 253 list_.push_front(new_head); in UpdateHead() 254 map_[new_head->sequence_number] = list_.begin(); in UpdateHead() 260 list_.erase(node_it); in Erase()
|
D | bwe.h | 87 PacketNodeIt begin() { return list_.begin(); } in begin() 88 PacketNodeIt end() { return list_.end(); } in end() 90 bool empty() const { return list_.empty(); } in empty() 91 size_t size() const { return list_.size(); } in size() 108 std::list<PacketIdentifierNode*> list_; variable
|
/external/vixl/src/aarch64/ |
D | operands-aarch64.h | 556 : list_(reg1.GetBit() | reg2.GetBit() | reg3.GetBit() | reg4.GetBit()), 564 : list_(list), size_(size), type_(type) { in CPURegList() 578 list_ = (UINT64_C(1) << (last_reg + 1)) - 1; in CPURegList() 579 list_ &= ~((UINT64_C(1) << first_reg) - 1); in CPURegList() 598 list_ |= other.GetList(); in Combine() 608 list_ &= ~other.GetList(); in Remove() 629 list_ |= (UINT64_C(1) << code); in Combine() 635 list_ &= ~(UINT64_C(1) << code); in Remove() 641 return CPURegList(list_1.type_, list_1.size_, list_1.list_ | list_2.list_); in Union() 655 return CPURegList(list_1.type_, list_1.size_, list_1.list_ & list_2.list_); in Intersection() [all …]
|
D | operands-aarch64.cc | 37 int index = CountTrailingZeros(list_); in PopLowestIndex() 38 VIXL_ASSERT((1 << index) & list_); in PopLowestIndex() 49 int index = CountLeadingZeros(list_); in PopHighestIndex() 51 VIXL_ASSERT((1 << index) & list_); in PopHighestIndex() 62 if (((list_ >> i) & 1) != 0) { in IsValid() 69 return list_ == 0; in IsValid()
|
/external/webrtc/webrtc/base/ |
D | flags.cc | 108 Flag* FlagList::list_ = NULL; member in rtc::FlagList 112 list_ = NULL; in FlagList() 119 for (Flag* f = list_; f != NULL; f = f->next()) { in Print() 132 Flag* f = list_; in Lookup() 262 flag->next_ = list_; in Register() 263 list_ = flag; in Register()
|
/external/webrtc/talk/app/webrtc/ |
D | statstypes.cc | 725 for (auto* r : list_) in ~StatsCollection() 731 return list_.begin(); in begin() 736 return list_.end(); in end() 741 return list_.size(); in size() 748 list_.push_back(report); in InsertNew() 761 Container::iterator it = std::find_if(list_.begin(), list_.end(), in ReplaceOrAddNew() 776 Container::iterator it = std::find_if(list_.begin(), list_.end(), in Find() 778 return it == list_.end() ? nullptr : *it; in Find()
|
/external/v8/src/torque/ |
D | declarable.h | 263 const std::vector<Macro*>& list() { return list_; } in list() 265 list_.emplace_back(macro); in AddMacro() 273 std::vector<Macro*> list_; variable 334 const std::vector<Generic*>& list() { return list_; } in list() 336 list_.push_back(generic); in AddGeneric() 344 std::vector<Generic*> list_; variable
|
/external/autotest/site_utils/bootperf-bin/ |
D | resultset.py | 43 def _ListStats(list_): argument 54 for v in list_: 57 n = len(list_)
|
/external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
D | graphcycles.cc | 71 Vec<int32> list_; // All nodes to reprocess member 252 r->list_.clear(); in Reorder() 253 MoveToList(r, &r->deltab_, &r->list_); in Reorder() 254 MoveToList(r, &r->deltaf_, &r->list_); in Reorder() 262 for (Vec<int32>::size_type i = 0; i < r->list_.size(); i++) { in Reorder() 263 r->nodes_[r->list_[i]]->rank = r->merged_[i]; in Reorder()
|
/external/libchrome/libchrome_tools/patch/ |
D | values.patch | 28 - return base::trace_event::EstimateMemoryUsage(list_); 43 +// return base::trace_event::EstimateMemoryUsage(list_);
|
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/C/ |
D | AST.stg | 205 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 */<… 314 …e<rewriteElementType>StreamNewAEV(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token <it>", list_<it>); }; 322 …tlr3RewriteRuleSubtreeStreamNewAEV(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token <it>", list_<it>);};
|
/external/tensorflow/tensorflow/contrib/graph_editor/ |
D | util.py | 72 def __init__(self, list_): argument 73 if not isinstance(list_, list): 74 raise TypeError("Expected a list, got: {}.".format(type(list_))) 75 self._list = list_
|