/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/chromium_org/components/keyed_service/core/ |
dependency_graph.cc | 25 EdgeMap::iterator it = edges_.begin(); 26 while (it != edges_.end()) { 31 edges_.erase(temp); 39 edges_.insert(std::make_pair(depended, dependee)); 70 for (EdgeMap::const_iterator it = edges_.begin(); it != edges_.end(); ++it) { 77 EdgeMap edges(edges_); 128 for (EdgeMap::const_iterator it = edges_.begin(); it != edges_.end(); ++it) {
|
dependency_graph.h | 58 EdgeMap edges_; member in class:DependencyGraph
|
/external/chromium_org/components/url_matcher/ |
substring_set_matcher.h | 97 const Edges& edges() const { return edges_; } 108 Edges edges_; member in class:url_matcher::SubstringSetMatcher::AhoCorasickNode
|
substring_set_matcher.cc | 241 : edges_(other.edges_), 248 edges_ = other.edges_; 255 Edges::const_iterator i = edges_.find(c); 256 return i == edges_.end() ? kNoSuchEdge : i->second; 260 edges_[c] = node;
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_deadlock_detector.h | 160 if (recycled_nodes_.getBit(edges_[i].from) || 161 recycled_nodes_.getBit(edges_[i].to)) { 162 Swap(edges_[i], edges_[n_edges_ - 1]); 248 if (n_edges_ < ARRAY_SIZE(edges_)) { 252 edges_[n_edges_++] = e; 265 if (edges_[i].from == from_idx && edges_[i].to == to_idx) { 266 *stk_from = edges_[i].stk_from; 267 *stk_to = edges_[i].stk_to 406 Edge edges_[BV::kSize * 32]; member in class:__sanitizer::DeadlockDetector [all...] |
/external/chromium_org/ash/wm/workspace/ |
magnetism_matcher.cc | 124 : edges_(edges) { 167 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) && 171 edges_) && 178 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) && 182 edges_) &&
|
magnetism_matcher.h | 180 const int32 edges_; member in class:ash::MagnetismMatcher
|
/external/chromium_org/cc/trees/ |
layer_sorter.h | 99 EdgeList edges_; member in class:cc::LayerSorter
|
layer_sorter.cc | 333 edges_.push_back(GraphEdge(start_node, end_node, weight)); 338 for (size_t i = 0; i < edges_.size(); i++) { 339 GraphEdge& edge = edges_[i]; 466 edges_.clear();
|
/external/chromium_org/courgette/ |
adjustment_method.cc | 145 Edges edges_; member in struct:courgette::Node 150 bool Extended() const { return !edges_.empty(); } 513 Node::Edges::iterator e = m_parent->edges_.find(m_label); 514 if (e == m_parent->edges_.end()) { 540 Node*& slot = node->edges_[item];
|
/external/chromium_org/v8/src/ |
heap-snapshot-generator.h | 162 List<HeapGraphEdge>& edges() { return edges_; } 194 List<HeapGraphEdge> edges_; member in class:v8::internal::HeapSnapshot
|
heap-snapshot-generator.cc | 339 GetMemoryUsedByList(edges_) + [all...] |