| /external/ceres-solver/internal/ceres/ |
| H A D | 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/chrome/browser/profiles/ |
| H A D | profile_dependency_manager.cc | 31 EdgeMap::iterator it = edges_.begin();
32 while (it != edges_.end()) {
37 edges_.erase(temp);
45 edges_.insert(std::make_pair(depended, dependee));
81 for (EdgeMap::const_iterator it = edges_.begin();
82 it != edges_.end(); ++it) {
89 EdgeMap edges(edges_);
|
| H A D | profile_dependency_manager.h | 54 // Using the dependency graph defined in |edges_|, fills |destruction_order_|
60 EdgeMap edges_; member in class:ProfileDependencyManager
|
| H A D | profile_dependency_manager_unittest.cc | 14 EXPECT_TRUE(dependency_manager_.edges_.empty());
|
| /external/chromium_org/components/browser_context_keyed_service/ |
| H A D | dependency_graph.cc | 29 EdgeMap::iterator it = edges_.begin();
30 while (it != edges_.end()) {
35 edges_.erase(temp);
43 edges_.insert(std::make_pair(depended, dependee));
77 for (EdgeMap::const_iterator it = edges_.begin();
78 it != edges_.end(); ++it) {
85 EdgeMap edges(edges_);
136 for (EdgeMap::const_iterator it = edges_.begin(); it != edges_.end(); ++it) {
|
| H A D | dependency_graph.h | 59 EdgeMap edges_; member in class:DependencyGraph
|
| /external/chromium_org/extensions/common/matcher/ |
| H A D | substring_set_matcher.h | 96 const Edges& edges() const { return edges_; }
107 Edges edges_; member in class:extensions::SubstringSetMatcher::AhoCorasickNode
|
| H A D | 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/chromium_org/ash/wm/workspace/ |
| H A D | magnetism_matcher.cc | 126 : edges_(edges) {
169 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) &&
173 edges_) &&
180 if (CanMatchSecondaryEdge(edge, SECONDARY_MAGNETISM_EDGE_LEADING, edges_) &&
184 edges_) &&
|
| H A D | magnetism_matcher.h | 181 const int32 edges_; member in class:ash::internal::MagnetismMatcher
|
| /external/chromium_org/cc/trees/ |
| H A D | layer_sorter.h | 99 EdgeList edges_; member in class:cc::LayerSorter
|
| H A D | layer_sorter.cc | 332 edges_.push_back(GraphEdge(start_node, end_node, weight));
337 for (size_t i = 0; i < edges_.size(); i++) {
338 GraphEdge& edge = edges_[i];
465 edges_.clear();
|
| /external/chromium_org/courgette/ |
| H A D | 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/ |
| H A D | heap-snapshot-generator.h | 178 List<HeapGraphEdge>& edges() { return edges_; }
209 List<HeapGraphEdge> edges_; member in class:v8::internal::HeapSnapshot
|
| H A D | heap-snapshot-generator.cc | 355 GetMemoryUsedByList(edges_) +
|