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

  /external/ceres-solver/internal/ceres/
graph.h 57 edges_[vertex] = HashSet<Vertex>();
75 const HashSet<Vertex>& sinks = edges_[vertex];
83 edges_[*it].erase(vertex);
86 edges_.erase(vertex);
100 if (edges_[vertex1].insert(vertex2).second) {
101 edges_[vertex2].insert(vertex1);
137 return FindOrDie(edges_, vertex);
151 HashMap<Vertex, HashSet<Vertex> > edges_; member in class:ceres::internal::Graph
  /external/chromium/chrome/browser/profiles/
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_);
profile_dependency_manager.h 54 // Using the dependency graph defined in |edges_|, fills |destruction_order_|
60 EdgeMap edges_; member in class:ProfileDependencyManager
profile_dependency_manager_unittest.cc 14 EXPECT_TRUE(dependency_manager_.edges_.empty());

Completed in 84 milliseconds