/external/chromium_org/third_party/re2/benchlog/ |
H A D | mktable | 34 sub graph() { subroutine 119 "graph" => \&graph,
|
/external/clang/test/PCH/Inputs/ |
H A D | typo.hpp | 4 namespace graph { namespace in namespace:boost
|
/external/regex-re2/benchlog/ |
H A D | mktable | 34 sub graph() { subroutine 119 "graph" => \&graph,
|
/external/ceres-solver/internal/ceres/ |
H A D | graph_test.cc | 31 #include "ceres/graph.h" 41 Graph<int> graph; local 42 EXPECT_EQ(graph.vertices().size(), 0); 46 Graph<int> graph; local 47 graph.AddVertex(0, 1.0); 48 graph.AddVertex(1, 2.0); 49 graph.AddEdge(0, 1, 0.5); 51 const HashSet<int>& vertices = graph.vertices(); 53 EXPECT_EQ(graph.VertexWeight(0), 1.0); 54 EXPECT_EQ(graph 62 Graph<int> graph; local 87 Graph<int> graph; local 97 Graph<int> graph; local [all...] |
H A D | graph_algorithms_test.cc | 36 #include "ceres/graph.h" 44 Graph<int> graph; local 45 graph.AddVertex(0); 46 graph.AddVertex(1); 47 graph.AddVertex(2); 48 graph.AddVertex(3); 49 graph.AddVertex(4); 51 graph.AddEdge(0, 1); 52 graph.AddEdge(1, 2); 53 graph 74 Graph<int> graph; local 105 Graph<int> graph; local 122 Graph<int> graph; local 169 Graph<int> graph; local 201 Graph<int> graph; local [all...] |
H A D | schur_ordering.cc | 33 #include "ceres/graph.h" 49 scoped_ptr<Graph< ParameterBlock*> > graph( 51 int independent_set_size = IndependentSetOrdering(*graph, ordering); 67 Graph<ParameterBlock*>* graph = new Graph<ParameterBlock*>; local 72 graph->AddVertex(parameter_block); 92 graph->AddEdge(parameter_blocks[j], parameter_blocks[k]); 97 return graph;
|
/external/chromium_org/v8/src/ |
H A D | hydrogen-canonicalize.h | 39 explicit HCanonicalizePhase(HGraph* graph) argument 40 : HPhase("H_Canonicalize", graph) { }
|
H A D | hydrogen-dehoist.h | 39 explicit HDehoistIndexComputationsPhase(HGraph* graph) argument 40 : HPhase("H_Dehoist index computations", graph) { }
|
H A D | hydrogen-deoptimizing-mark.h | 41 explicit HPropagateDeoptimizingMarkPhase(HGraph* graph) argument 42 : HPhase("H_Propagate deoptimizing mark", graph) { }
|
H A D | hydrogen-redundant-phi.h | 41 explicit HRedundantPhiEliminationPhase(HGraph* graph) argument 42 : HPhase("H_Redundant phi elimination", graph) { }
|
H A D | hydrogen-removable-simulates.h | 39 explicit HMergeRemovableSimulatesPhase(HGraph* graph) argument 40 : HPhase("H_Merge removable simulates", graph) { }
|
H A D | hydrogen-representation-changes.h | 39 explicit HRepresentationChangesPhase(HGraph* graph) argument 40 : HPhase("H_Representation changes", graph) { }
|
H A D | hydrogen-sce.h | 39 explicit HStackCheckEliminationPhase(HGraph* graph) argument 40 : HPhase("H_Stack check elimination", graph) { }
|
H A D | hydrogen-bch.h | 39 explicit HBoundsCheckHoistingPhase(HGraph* graph) argument 40 : HPhase("H_Bounds checks hoisting", graph) { }
|
H A D | hydrogen-dce.h | 39 explicit HDeadCodeEliminationPhase(HGraph* graph) argument 40 : HPhase("H_Dead code elimination", graph) { }
|
H A D | hydrogen-infer-representation.h | 39 explicit HInferRepresentationPhase(HGraph* graph) argument 40 : HPhase("H_Infer representations", graph), 42 in_worklist_(graph->GetMaximumValueID(), zone()) { }
|
H A D | hydrogen-mark-deoptimize.h | 44 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) argument 45 : HPhase("H_Mark deoptimize on undefined", graph), 63 explicit HComputeChangeUndefinedToNaN(HGraph* graph) argument 64 : HPhase("H_Compute change undefined to nan", graph) {}
|
H A D | hydrogen-minus-zero.h | 39 explicit HComputeMinusZeroChecksPhase(HGraph* graph) argument 40 : HPhase("H_Compute minus zero checks", graph), 41 visited_(graph->GetMaximumValueID(), zone()) { }
|
H A D | hydrogen-range-analysis.h | 39 explicit HRangeAnalysisPhase(HGraph* graph) argument 40 : HPhase("H_Range analysis", graph), changed_ranges_(16, zone()) { }
|
H A D | hydrogen-uint32-analysis.h | 41 explicit HUint32AnalysisPhase(HGraph* graph) argument 42 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
|
H A D | hydrogen-bce.h | 54 explicit HBoundsCheckEliminationPhase(HGraph* graph) argument 55 : HPhase("H_Bounds checks elimination", graph), table_(zone()) { } 58 EliminateRedundantBoundsChecks(graph()->entry_block());
|
H A D | hydrogen-infer-types.h | 39 explicit HInferTypesPhase(HGraph* graph) argument 40 : HPhase("H_Inferring types", graph), worklist_(8, zone()), 41 in_worklist_(graph->GetMaximumValueID(), zone()) { } 44 InferTypes(0, graph()->blocks()->length() - 1);
|
H A D | hydrogen-escape-analysis.h | 40 explicit HEscapeAnalysisPhase(HGraph* graph) argument 41 : HPhase("H_Escape analysis", graph), 45 block_states_(graph->blocks()->length(), zone()) { }
|
/external/chromium_org/components/browser_context_keyed_service/ |
H A D | dependency_graph_unittest.cc | 16 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) { argument 32 DependencyGraph graph; local 33 DummyNode node(&graph); 36 EXPECT_TRUE(graph.GetConstructionOrder(&construction_order)); 41 EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order)); 48 DependencyGraph graph; local 49 DummyNode parent(&graph); 50 DummyNode child(&graph); 52 graph 69 DependencyGraph graph; local 94 DependencyGraph graph; local 130 DependencyGraph graph; local [all...] |
/external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
H A D | DependencyGraphOutput.cpp | 53 void TDependencyGraphOutput::outputAllSpanningTrees(TDependencyGraph& graph) argument 57 for (TGraphNodeVector::const_iterator iter = graph.begin(); iter != graph.end(); ++iter) 60 mSink << "--- Dependency graph spanning tree ---\n";
|