| /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...] |
| 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...] |
| parameter_block_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
51 const HashSet<ParameterBlock*>& vertices = graph->vertices();
58 int independent_set_size = StableIndependentSetOrdering(*graph, ordering);
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
76 int independent_set_size = IndependentSetOrdering(*graph, ordering);
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program))
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); local
[all...] |
| schur_ordering.cc | 33 #include "ceres/graph.h"
49 scoped_ptr<Graph< ParameterBlock*> > graph(
51 int independent_set_size = IndependentSetOrdering(*graph, ordering);
65 Graph<ParameterBlock*>*
67 Graph<ParameterBlock*>* graph = new Graph<ParameterBlock*>; local
72 graph->AddVertex(parameter_block);
92 graph->AddEdge(parameter_blocks[j], parameter_blocks[k])
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-sce.h | 39 explicit HStackCheckEliminationPhase(HGraph* graph)
40 : HPhase("H_Stack check elimination", graph) { }
|
| hydrogen-bch.h | 39 explicit HBoundsCheckHoistingPhase(HGraph* graph)
40 : HPhase("H_Bounds checks hoisting", graph) { }
|
| hydrogen-canonicalize.h | 39 explicit HCanonicalizePhase(HGraph* graph)
40 : HPhase("H_Canonicalize", graph) { }
|
| hydrogen-dehoist.h | 39 explicit HDehoistIndexComputationsPhase(HGraph* graph)
40 : HPhase("H_Dehoist index computations", graph) { }
|
| hydrogen-load-elimination.h | 38 explicit HLoadEliminationPhase(HGraph* graph)
39 : HPhase("H_Load elimination", graph) { }
|
| hydrogen-mark-unreachable.h | 39 explicit HMarkUnreachableBlocksPhase(HGraph* graph)
40 : HPhase("H_Mark unreachable blocks", graph) { }
|
| hydrogen-removable-simulates.h | 39 explicit HMergeRemovableSimulatesPhase(HGraph* graph)
40 : HPhase("H_Merge removable simulates", graph) { }
|
| hydrogen-infer-types.h | 39 explicit HInferTypesPhase(HGraph* graph)
40 : HPhase("H_Inferring types", graph), worklist_(8, zone()),
41 in_worklist_(graph->GetMaximumValueID(), zone()) { }
44 InferTypes(0, graph()->blocks()->length() - 1);
|
| hydrogen-mark-deoptimize.h | 44 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph)
45 : HPhase("H_Mark deoptimize on undefined", graph),
63 explicit HComputeChangeUndefinedToNaN(HGraph* graph)
64 : HPhase("H_Compute change undefined to nan", graph) {}
|
| hydrogen-infer-representation.h | 39 explicit HInferRepresentationPhase(HGraph* graph)
40 : HPhase("H_Infer representations", graph),
42 in_worklist_(graph->GetMaximumValueID(), zone()) { }
|
| hydrogen-minus-zero.h | 39 explicit HComputeMinusZeroChecksPhase(HGraph* graph)
40 : HPhase("H_Compute minus zero checks", graph),
41 visited_(graph->GetMaximumValueID(), zone()) { }
|
| hydrogen-dce.h | 39 explicit HDeadCodeEliminationPhase(HGraph* graph)
40 : HPhase("H_Dead code elimination", graph) { }
|
| hydrogen-redundant-phi.h | 41 explicit HRedundantPhiEliminationPhase(HGraph* graph)
42 : HPhase("H_Redundant phi elimination", graph) { }
|
| hydrogen-representation-changes.h | 39 explicit HRepresentationChangesPhase(HGraph* graph)
40 : HPhase("H_Representation changes", graph) { }
|
| hydrogen-check-elimination.h | 41 explicit HCheckEliminationPhase(HGraph* graph)
42 : HPhase("H_Check Elimination", graph), aliasing_() {
|
| hydrogen-uint32-analysis.h | 41 explicit HUint32AnalysisPhase(HGraph* graph)
42 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
|
| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /external/chromium_org/components/browser_context_keyed_service/ |
| dependency_graph_unittest.cc | 16 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) {
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.AddEdge(&parent, &child)
69 DependencyGraph graph; local
94 DependencyGraph graph; local
130 DependencyGraph graph; local
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| Scheduler.java | 31 Scheduler(FilterGraph graph) {
32 mGraph = graph;
|
| SimpleScheduler.java | 28 public SimpleScheduler(FilterGraph graph) {
29 super(graph);
|
| /external/chromium_org/tools/gyp/pylib/gyp/ |
| common_test.py | 16 """Test that sorting works on a valid graph with one possible order."""
17 graph = {
24 return tuple(graph[node])
26 gyp.common.TopologicallySorted(graph.keys(), GetEdge),
30 """Test that an exception is thrown on a cyclic graph."""
31 graph = {
38 return tuple(graph[node])
41 graph.keys(), GetEdge)
|
