HomeSort by relevance Sort by last modified time
    Searched refs:ptrs_ (Results 1 - 3 of 3) sorted by null

  /external/tensorflow/tensorflow/core/graph/
edgeset.cc 27 if (ptrs_[i] == value) {
28 ci.array_iter_ = &ptrs_[i];
33 if (ptrs_[i] == nullptr) {
34 ptrs_[i] = value;
35 ci.array_iter_ = &ptrs_[i];
41 s->insert(reinterpret_cast<const Edge**>(std::begin(ptrs_)),
42 reinterpret_cast<const Edge**>(std::end(ptrs_)));
43 ptrs_[0] = this;
44 ptrs_[1] = s;
57 if (ptrs_[i] == key)
    [all...]
edgeset.h 55 // Up to kInline elements are stored directly in ptrs_ (nullptr means none).
56 // If ptrs_[0] == this then ptrs_[1] points to a set<const Edge*>.
58 const void* ptrs_[kInline]; member in class:tensorflow::EdgeSet
61 if (ptrs_[0] == this) {
62 return static_cast<std::set<const Edge*>*>(const_cast<void*>(ptrs_[1]));
122 ptrs_[i] = nullptr;
137 if (ptrs_[i]) result++;
147 ptrs_[i] = nullptr;
158 ci.array_iter_ = &ptrs_[0]
    [all...]
  /external/libchrome/mojo/public/cpp/bindings/
interface_ptr_set.h 36 ptrs_.emplace(std::piecewise_construct, std::forward_as_tuple(id),
44 for (const auto& it : ptrs_) {
52 for (const auto& it : ptrs_) {
56 ptrs_.clear();
59 bool empty() const { return ptrs_.empty(); }
64 for (const auto& it : ptrs_) {
72 return ptrs_.find(id) != ptrs_.end();
76 auto it = ptrs_.find(id);
77 if (it == ptrs_.end()
130 std::map<InterfacePtrSetElementId, base::WeakPtr<Element>> ptrs_; member in class:mojo::internal::PtrSet
    [all...]

Completed in 86 milliseconds