Searched defs:graph_ (Results 1 - 25 of 35) sorted by relevance

12

/external/ceres-solver/internal/ceres/
H A Dcanonical_views_clustering_test.cc57 graph_.AddVertex(i, kVertexWeights[i]);
62 graph_.AddEdge(i, i, 1.0);
70 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]);
75 ComputeCanonicalViewsClustering(options_, graph_, &centers_, &membership_);
78 Graph<int> graph_; member in class:ceres::internal::CanonicalViewsTest
H A Dcanonical_views_clustering.cc77 const Graph<int>* graph_; member in class:ceres::internal::CanonicalViewsClustering
107 graph_ = &graph;
149 const IntSet& views = graph_->vertices();
153 if (graph_->VertexWeight(*view) != Graph<int>::InvalidWeight()) {
166 options_.view_score_weight * graph_->VertexWeight(candidate);
171 const IntSet& neighbors = graph_->Neighbors(candidate);
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
189 graph_->EdgeWeight(centers[i], candidate);
198 const IntSet& neighbors = graph_->Neighbors(canonical_view);
205 graph_
[all...]
H A Dgraph_algorithms.h52 : graph_(graph) {}
55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
62 const Graph<Vertex>& graph_; member in class:ceres::internal::VertexTotalOrdering
69 : graph_(graph) {}
72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
76 const Graph<Vertex>& graph_; member in class:ceres::internal::VertexDegreeLessThan
[all...]
/external/v8/src/compiler/
H A Dcommon-operator-reducer.h43 Graph* graph() const { return graph_; }
48 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dcontrol-flow-optimizer.h37 Graph* graph() const { return graph_; }
42 Graph* const graph_; member in class:v8::internal::compiler::final
H A Ddead-code-elimination.h37 Graph* graph() const { return graph_; }
41 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dgraph-trimmer.h48 Graph* graph() const { return graph_; }
50 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dload-elimination.h21 : AdvancedReducer(editor), graph_(graph), simplified_(simplified) {}
28 Graph* graph() const { return graph_; }
32 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dselect-lowering.h29 Graph* graph() const { return graph_; }
32 Graph* graph_; member in class:v8::internal::compiler::final
H A Dtail-call-optimization.h24 : common_(common), graph_(graph) {}
30 Graph* graph() const { return graph_; }
33 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dgraph-reducer.h127 Graph* graph() const { return graph_; }
170 Graph* const graph_; member in class:v8::internal::compiler::GraphReducer
H A Dgraph.h41 : graph_(graph), start_(graph->start()), end_(graph->end()) {}
43 graph_->SetStart(start_);
44 graph_->SetEnd(end_);
48 Graph* const graph_; member in class:v8::internal::compiler::final::final
H A Dint64-lowering.h41 Graph* graph() const { return graph_; }
68 Graph* const graph_; member in class:v8::internal::compiler::Int64Lowering
H A Dscheduler.h64 Graph* graph_; member in class:v8::internal::compiler::Scheduler
H A Dsource-position.h80 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dtyper.h46 Graph* graph() const { return graph_; }
55 Graph* const graph_; member in class:v8::internal::compiler::Typer
H A Dcontrol-equivalence.h35 graph_(graph),
161 Graph* const graph_; member in class:v8::internal::compiler::final
H A Dinstruction-scheduler.h198 ZoneVector<ScheduleGraphNode*> graph_; member in class:v8::internal::compiler::final
H A Djs-graph.h32 graph_(graph),
139 Graph* graph() const { return graph_; }
171 Graph* graph_; member in class:v8::internal::compiler::JSGraph
/external/v8/test/unittests/compiler/
H A Dgraph-unittest.h59 Graph* graph() { return &graph_; }
63 Graph graph_; member in class:v8::internal::compiler::GraphTest
H A Dvalue-numbering-reducer-unittest.cc31 ValueNumberingReducerTest() : graph_(zone()), reducer_(zone()) {}
36 Graph* graph() { return &graph_; }
39 Graph graph_; member in class:v8::internal::compiler::ValueNumberingReducerTest
H A Dgraph-reducer-unittest.cc86 explicit NewABReducer(Graph* graph) : graph_(graph) {}
92 return Replace(graph_->NewNode(&kOpB0));
95 return Replace(graph_->NewNode(&kOpB1, node->InputAt(0)));
99 graph_->NewNode(&kOpB2, node->InputAt(0), node->InputAt(1)));
105 Graph* const graph_; member in class:v8::internal::compiler::__anon18936::final
112 explicit A0Wrapper(Graph* graph) : graph_(graph) {}
118 return Replace(graph_->NewNode(&kOpB1, node));
124 Graph* const graph_; member in class:v8::internal::compiler::__anon18936::final
131 explicit B0Wrapper(Graph* graph) : graph_(graph) {}
137 return Replace(graph_
143 Graph* const graph_; member in class:v8::internal::compiler::__anon18936::final
229 Graph graph_; member in class:v8::internal::compiler::AdvancedReducerTest
452 Graph graph_; member in class:v8::internal::compiler::GraphReducerTest
[all...]
/external/v8/src/crankshaft/
H A Dhydrogen-flow-engine.h71 : graph_(graph),
78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone);
97 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) {
98 HBasicBlock* block = graph_->blocks()->at(i);
154 HBasicBlock* member = graph_->blocks()->at(i);
191 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_);
194 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_);
207 HGraph* graph_; // The hydrogen graph. member in class:v8::internal::HFlowEngine
/external/v8/test/cctest/compiler/
H A Dtest-js-context-specialization.cc22 : graph_(new (main_zone()) Graph(main_zone())),
38 Graph* graph() { return graph_; }
41 Graph* graph_; member in class:v8::internal::compiler::ContextSpecializationTester
/external/gmock/src/
H A Dgmock-matchers.cc201 : graph_(&graph),
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
263 if (!graph_->HasEdge(ilhs, irhs))
287 const MatchMatrix* graph_; // not owned member in class:testing::internal::MaxBipartiteMatchState

Completed in 436 milliseconds

12