| /external/chromium_org/third_party/re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /external/regex-re2/benchlog/ |
| mktable | 34 sub graph() { subroutine
119 "graph" => \&graph,
|
| /external/ceres-solver/internal/ceres/ |
| graph_test.cc | 31 #include "ceres/graph.h"
40 TEST(Graph, EmptyGraph) {
41 Graph<int> graph; local
42 EXPECT_EQ(graph.vertices().size(), 0);
45 TEST(Graph, AddVertexAndEdge) {
46 Graph<int> graph; local
47 graph.AddVertex(0, 1.0);
48 graph.AddVertex(1, 2.0)
62 Graph<int> graph; local
87 Graph<int> graph; local
97 Graph<int> graph; local
[all...] |
| single_linkage_clustering_test.cc | 39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
51 // Graph structure:
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
102 Graph<int> graph; local
[all...] |
| 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)
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...] |
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| GraphBasicTypes.h | 13 namespace graph { namespace in namespace:mcld
16 * \brief Undirected graph category.
21 * \brief Directed graph category.
25 } // namespace of graph
|
| Digraph.h | 16 namespace graph { namespace in namespace:mcld
78 } // namespace of graph
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 41 HGraph* graph = builder.BuildGraph(*item); local
42 ASSERT_NE(graph, nullptr);
44 graph->BuildDominatorTree();
45 graph->TransformToSSA();
46 graph->FindNaturalLoops();
48 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, InstructionSet::kX86);
49 SsaLivenessAnalysis liveness(*graph, codegen);
60 // Structure of this graph (+ are back edges)
85 // Structure of this graph (+ are back edges)
110 // Structure of this graph (+ are back edges
[all...] |
| dominator_test.cc | 32 HGraph* graph = builder.BuildGraph(*item); local
33 ASSERT_NE(graph, nullptr);
34 graph->BuildDominatorTree();
35 ASSERT_EQ(graph->GetBlocks().Size(), blocks_length);
38 ASSERT_EQ(nullptr, graph->GetBlocks().Get(i)->GetDominator());
40 ASSERT_NE(nullptr, graph->GetBlocks().Get(i)->GetDominator());
41 ASSERT_EQ(blocks[i], graph->GetBlocks().Get(i)->GetDominator()->GetBlockId());
|
| find_loops_test.cc | 34 HGraph* graph = builder.BuildGraph(*item); local
35 graph->BuildDominatorTree();
36 graph->FindNaturalLoops();
37 return graph;
47 HGraph* graph = TestCode(data, &arena); local
48 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
49 ASSERT_EQ(graph->GetBlocks().Get(i)->GetLoopInformation(), nullptr);
59 HGraph* graph = TestCode(data, &arena); local
60 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
61 ASSERT_EQ(graph->GetBlocks().Get(i)->GetLoopInformation(), nullptr)
74 HGraph* graph = TestCode(data, &arena); local
90 HGraph* graph = TestCode(data, &arena); local
104 HGraph* graph = TestCode(data, &arena); local
149 HGraph* graph = TestCode(data, &arena); local
176 HGraph* graph = TestCode(data, &arena); local
200 HGraph* graph = TestCode(data, &arena); local
225 HGraph* graph = TestCode(data, &arena); local
251 HGraph* graph = TestCode(data, &arena); local
276 HGraph* graph = TestCode(data, &arena); local
307 HGraph* graph = TestCode(data, &arena); local
336 HGraph* graph = TestCode(data, &arena); local
350 HGraph* graph = TestCode(data, &arena); local
[all...] |
| live_ranges_test.cc | 33 HGraph* graph = builder.BuildGraph(*item); local
34 graph->BuildDominatorTree();
35 graph->TransformToSSA();
36 graph->FindNaturalLoops();
37 return graph;
45 * Which becomes the following graph (numbered by lifetime position):
59 HGraph* graph = BuildGraph(data, &allocator); local
61 CodeGenerator* codegen = CodeGenerator::Create(&allocator, graph, InstructionSet::kX86);
62 SsaLivenessAnalysis liveness(*graph, codegen);
70 HBasicBlock* block = graph->GetBlocks().Get(1)
106 HGraph* graph = BuildGraph(data, &allocator); local
155 HGraph* graph = BuildGraph(data, &allocator); local
231 HGraph* graph = BuildGraph(data, &allocator); local
[all...] |
| pretty_printer_test.cc | 35 HGraph* graph = builder.BuildGraph(*item); local
36 ASSERT_NE(graph, nullptr);
37 StringPrettyPrinter printer(graph);
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph_unittest.cc | 15 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) {
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.AddEdge(&parent, &child)
66 DependencyGraph graph; local
91 DependencyGraph graph; local
127 DependencyGraph graph; local
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 15 using namespace mcld::graph;
42 ListDigraph graph; local
44 ListDigraph::Node* u1 = graph.addNode();
45 ListDigraph::Node* u2 = graph.addNode();
46 ListDigraph::Node* u3 = graph.addNode();
64 graph.getHead(head);
67 graph.erase(*u2);
84 graph.getHead(head);
90 ListDigraph graph; local
92 ListDigraph::Node* u1 = graph.addNode()
138 ListDigraph graph; local
187 ListDigraph graph; local
208 ListDigraph graph; local
229 ListDigraph graph; local
257 ListDigraph graph; local
284 ListDigraph graph; local
311 ListDigraph graph; local
331 Digraph graph; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/x86_64-linux/32/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/x86_64-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/ |
| ctype_base.h | 56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/ |
| ctype_base.h | 56 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
| ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
