| /external/ceres-solver/internal/ceres/ |
| graph.h | 58 edges_[vertex] = HashSet<Vertex>();
76 const HashSet<Vertex>& sinks = edges_[vertex];
84 edges_[*it].erase(vertex);
87 edges_.erase(vertex);
101 if (edges_[vertex1].insert(vertex2).second) {
102 edges_[vertex2].insert(vertex1);
138 return FindOrDie(edges_, vertex);
152 HashMap<Vertex, HashSet<Vertex> > edges_; member in class:ceres::internal::Graph
|
| /external/v8/test/cctest/compiler/ |
| test-node-algorithm.cc | 200 printf("[%d] PRE EDGE: %d-%d\n", static_cast<int>(edges_.size()),
202 edges_.push_back(std::make_pair(from->id(), to->id()));
206 printf("[%d] POST EDGE: %d-%d\n", static_cast<int>(edges_.size()),
208 edges_.push_back(std::make_pair(-from->id(), -to->id()));
212 std::vector<std::pair<int, int> > edges_; member in struct:ReenterNodeVisitor
232 CHECK_EQ(24, static_cast<int>(visitor.edges_.size()));
235 CHECK(n0->id() == visitor.edges_[0].first);
236 CHECK(n1->id() == visitor.edges_[0].second);
239 CHECK(-n1->id() == visitor.edges_[1].second);
240 CHECK(-n0->id() == visitor.edges_[1].first)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_deadlock_detector.h | 163 if (recycled_nodes_.getBit(edges_[i].from) ||
164 recycled_nodes_.getBit(edges_[i].to)) {
165 Swap(edges_[i], edges_[n_edges_ - 1]);
252 if (n_edges_ < ARRAY_SIZE(edges_)) {
256 edges_[n_edges_++] = e;
269 if (edges_[i].from == from_idx && edges_[i].to == to_idx) {
270 *stk_from = edges_[i].stk_from;
271 *stk_to = edges_[i].stk_to
410 Edge edges_[BV::kSize * 32]; member in class:__sanitizer::DeadlockDetector
[all...] |
| /external/v8/src/ |
| heap-snapshot-generator.h | 161 List<HeapGraphEdge>& edges() { return edges_; }
193 List<HeapGraphEdge> edges_; member in class:v8::internal::HeapSnapshot
|
