| /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 | single_linkage_clustering_test.cc | 39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
54 graph.AddEdge(0, 1, 1.0);
55 graph.AddEdge(1, 2, 1.0);
56 graph.AddEdge(2, 3, 1.0);
57 graph.AddEdge(4, 5, 1.0);
61 ComputeSingleLinkageClustering(options, graph, &membership);
73 Graph<int> graph; local
76 graph
102 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...] |
| /external/chromium_org/v8/src/ |
| H A D | hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph) argument
17 : HPhase("H_Canonicalize", graph) { }
|
| H A D | hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph) argument
17 : HPhase("H_Dehoist index computations", graph) { }
|
| H A D | hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph) argument
16 : HPhase("H_Load elimination", graph) { }
|
| H A D | hydrogen-mark-unreachable.h | 16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) argument
17 : HPhase("H_Mark unreachable blocks", graph) { }
|
| H A D | hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph) argument
19 : HPhase("H_Redundant phi elimination", graph) { }
|
| H A D | hydrogen-removable-simulates.h | 16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) argument
17 : HPhase("H_Merge removable simulates", graph) { }
|
| H A D | hydrogen-representation-changes.h | 16 explicit HRepresentationChangesPhase(HGraph* graph) argument
17 : HPhase("H_Representation changes", graph) { }
|
| H A D | hydrogen-sce.h | 16 explicit HStackCheckEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Stack check elimination", graph) { }
|
| H A D | hydrogen-bch.h | 16 explicit HBoundsCheckHoistingPhase(HGraph* graph) argument
17 : HPhase("H_Bounds checks hoisting", graph) { }
|
| H A D | hydrogen-dce.h | 16 explicit HDeadCodeEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Dead code elimination", graph) { }
|
| H A D | hydrogen-infer-representation.h | 16 explicit HInferRepresentationPhase(HGraph* graph) argument
17 : HPhase("H_Infer representations", graph),
19 in_worklist_(graph->GetMaximumValueID(), zone()) { }
|
| H A D | hydrogen-mark-deoptimize.h | 21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) argument
22 : HPhase("H_Mark deoptimize on undefined", graph),
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph) argument
41 : HPhase("H_Compute change undefined to nan", graph) {}
|
| H A D | hydrogen-store-elimination.h | 16 explicit HStoreEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Store elimination", graph),
|
| H A D | hydrogen-uint32-analysis.h | 18 explicit HUint32AnalysisPhase(HGraph* graph) argument
19 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
|
| H A D | hydrogen-bce.h | 31 explicit HBoundsCheckEliminationPhase(HGraph* graph) argument
32 : HPhase("H_Bounds checks elimination", graph), table_(zone()) { }
35 EliminateRedundantBoundsChecks(graph()->entry_block());
|
| H A D | hydrogen-infer-types.h | 16 explicit HInferTypesPhase(HGraph* graph) argument
17 : HPhase("H_Inferring types", graph), worklist_(8, zone()),
18 in_worklist_(graph->GetMaximumValueID(), zone()) { }
21 InferTypes(0, graph()->blocks()->length() - 1);
|
| /external/chromium_org/v8/src/compiler/ |
| H A D | graph-visualizer.h | 20 explicit AsDOT(const Graph& g) : graph(g) {}
21 const Graph& graph; member in struct:v8::internal::compiler::AsDOT
|
| H A D | graph-unittest.h | 9 #include "src/compiler/graph.h"
47 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::GraphTest
|
| /external/chromium_org/components/keyed_service/core/ |
| H A D | dependency_graph_unittest.cc | 15 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) { argument
29 DependencyGraph graph; local
30 DummyNode node(&graph);
33 EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
38 EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
45 DependencyGraph graph; local
46 DummyNode parent(&graph);
47 DummyNode child(&graph);
49 graph
66 DependencyGraph graph; local
91 DependencyGraph graph; local
127 DependencyGraph graph; local
[all...] |