Home
last modified time | relevance | path

Searched refs:ptrs_ (Results 1 – 3 of 3) sorted by relevance

/external/tensorflow/tensorflow/core/graph/
Dedgeset.cc27 if (ptrs_[i] == value) { in insert()
28 ci.array_iter_ = &ptrs_[i]; in insert()
33 if (ptrs_[i] == nullptr) { in insert()
34 ptrs_[i] = value; in insert()
35 ci.array_iter_ = &ptrs_[i]; in insert()
41 s->insert(reinterpret_cast<const Edge**>(std::begin(ptrs_)), in insert()
42 reinterpret_cast<const Edge**>(std::end(ptrs_))); in insert()
43 ptrs_[0] = this; in insert()
44 ptrs_[1] = s; in insert()
57 if (ptrs_[i] == key) { in erase()
[all …]
Dedgeset.h58 const void* ptrs_[kInline]; variable
61 if (ptrs_[0] == this) { in get_set()
62 return static_cast<std::set<const Edge*>*>(const_cast<void*>(ptrs_[1])); in get_set()
122 ptrs_[i] = nullptr; in EdgeSet()
137 if (ptrs_[i]) result++; in size()
147 ptrs_[i] = nullptr; in clear()
158 ci.array_iter_ = &ptrs_[0]; in begin()
170 ci.array_iter_ = &ptrs_[size()]; in end()
/external/libchrome/mojo/public/cpp/bindings/
Dinterface_ptr_set.h36 ptrs_.emplace(std::piecewise_construct, std::forward_as_tuple(id), in AddPtr()
44 for (const auto& it : ptrs_) { in ForAllPtrs()
52 for (const auto& it : ptrs_) { in CloseAll()
56 ptrs_.clear(); in CloseAll()
59 bool empty() const { return ptrs_.empty(); } in empty()
64 for (const auto& it : ptrs_) { in FlushForTesting()
72 return ptrs_.find(id) != ptrs_.end(); in HasPtr()
76 auto it = ptrs_.find(id); in RemovePtr()
77 if (it == ptrs_.end()) in RemovePtr()
84 ptrs_.erase(it); in RemovePtr()
[all …]