| /external/chromium_org/v8/test/cctest/compiler/ |
| D | test-node-algorithm.cc | 200 printf("[%d] PRE EDGE: %d-%d\n", static_cast<int>(edges_.size()), in PreEdge()
202 edges_.push_back(std::make_pair(from->id(), to->id())); in PreEdge()
206 printf("[%d] POST EDGE: %d-%d\n", static_cast<int>(edges_.size()), in PostEdge()
208 edges_.push_back(std::make_pair(-from->id(), -to->id())); in PostEdge()
212 std::vector<std::pair<int, int> > edges_; member
232 CHECK_EQ(24, static_cast<int>(visitor.edges_.size())); in TEST()
235 CHECK(n0->id() == visitor.edges_[0].first); in TEST()
236 CHECK(n1->id() == visitor.edges_[0].second); in TEST()
239 CHECK(-n1->id() == visitor.edges_[1].second); in TEST()
240 CHECK(-n0->id() == visitor.edges_[1].first); in TEST()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | graph.h | 58 edges_[vertex] = HashSet<Vertex>(); in AddVertex()
76 const HashSet<Vertex>& sinks = edges_[vertex]; in RemoveVertex()
84 edges_[*it].erase(vertex); in RemoveVertex()
87 edges_.erase(vertex); in RemoveVertex()
101 if (edges_[vertex1].insert(vertex2).second) { in AddEdge()
102 edges_[vertex2].insert(vertex1); in AddEdge()
138 return FindOrDie(edges_, vertex); in Neighbors()
152 HashMap<Vertex, HashSet<Vertex> > edges_; variable
|
| /external/chromium_org/components/keyed_service/core/ |
| D | dependency_graph.cc | 25 EdgeMap::iterator it = edges_.begin(); in RemoveNode()
26 while (it != edges_.end()) { in RemoveNode()
31 edges_.erase(temp); in RemoveNode()
39 edges_.insert(std::make_pair(depended, dependee)); in AddEdge()
70 for (EdgeMap::const_iterator it = edges_.begin(); it != edges_.end(); ++it) { in BuildConstructionOrder()
77 EdgeMap edges(edges_); in BuildConstructionOrder()
128 for (EdgeMap::const_iterator it = edges_.begin(); it != edges_.end(); ++it) { in DumpAsGraphviz()
|
| D | dependency_graph.h | 58 EdgeMap edges_; variable
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector.h | 160 if (recycled_nodes_.getBit(edges_[i].from) || in newNode()
161 recycled_nodes_.getBit(edges_[i].to)) { in newNode()
162 Swap(edges_[i], edges_[n_edges_ - 1]); in newNode()
248 if (n_edges_ < ARRAY_SIZE(edges_)) { in addEdges()
252 edges_[n_edges_++] = e; in addEdges()
265 if (edges_[i].from == from_idx && edges_[i].to == to_idx) { in findEdge()
266 *stk_from = edges_[i].stk_from; in findEdge()
267 *stk_to = edges_[i].stk_to; in findEdge()
268 *unique_tid = edges_[i].unique_tid; in findEdge()
406 Edge edges_[BV::kSize * 32]; variable
|
| /external/chromium_org/components/url_matcher/ |
| D | substring_set_matcher.cc | 241 : edges_(other.edges_), in AhoCorasickNode()
248 edges_ = other.edges_; in operator =()
255 Edges::const_iterator i = edges_.find(c); in GetEdge()
256 return i == edges_.end() ? kNoSuchEdge : i->second; in GetEdge()
260 edges_[c] = node; in SetEdge()
|
| D | substring_set_matcher.h | 97 const Edges& edges() const { return edges_; } in edges()
108 Edges edges_;
|
| /external/chromium_org/ash/wm/workspace/ |
| D | magnetism_matcher.cc | 124 : edges_(edges) { in MagnetismMatcher()
167 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) && in AttachToSecondaryEdge()
171 edges_) && in AttachToSecondaryEdge()
178 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) && in AttachToSecondaryEdge()
182 edges_) && in AttachToSecondaryEdge()
|
| D | magnetism_matcher.h | 180 const int32 edges_; variable
|
| /external/chromium_org/cc/trees/ |
| D | layer_sorter.cc | 333 edges_.push_back(GraphEdge(start_node, end_node, weight)); in CreateGraphEdges()
338 for (size_t i = 0; i < edges_.size(); i++) { in CreateGraphEdges()
339 GraphEdge& edge = edges_[i]; in CreateGraphEdges()
466 edges_.clear(); in Sort()
|
| D | layer_sorter.h | 99 EdgeList edges_;
|
| /external/chromium_org/courgette/ |
| D | adjustment_method.cc | 145 Edges edges_; member
150 bool Extended() const { return !edges_.empty(); } in Extended()
513 Node::Edges::iterator e = m_parent->edges_.find(m_label); in FindModelNode()
514 if (e == m_parent->edges_.end()) { in FindModelNode()
540 Node*& slot = node->edges_[item]; in ExtendNode()
|
| /external/chromium_org/v8/src/ |
| D | heap-snapshot-generator.h | 161 List<HeapGraphEdge>& edges() { return edges_; } in edges()
193 List<HeapGraphEdge> edges_; variable
|
| D | heap-snapshot-generator.cc | 346 GetMemoryUsedByList(edges_) + in RawSnapshotSize()
|