| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the
28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
33 /// edge into the PBQP graph (by R2).
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
49 /// node/edge in the PBQP graph.
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g
[all...] |
| Solution.h | 17 #include "Graph.h"
29 typedef std::map<Graph::ConstNodeItr, unsigned,
76 void setSelection(Graph::NodeItr nItr, unsigned selection) {
83 unsigned getSelection(Graph::ConstNodeItr nItr) const {
|
| HeuristicSolver.h | 19 #include "Graph.h"
29 /// to HeuristicSolver<HImpl>::solve(Graph&).
33 /// backpropagation phase, and maintains the internal copy of the graph on
43 typedef std::list<Graph::EdgeItr> SolverEdges;
47 /// \brief Iterator type for edges in the solver graph.
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
104 Graph &g;
107 std::vector<Graph::NodeItr> stack;
118 /// graph.
119 /// @param g The graph representing the problem instance to be solved
[all...] |
| /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...] |
| schur_ordering.h | 38 #include "ceres/graph.h"
64 // Builds a graph on the parameter blocks of a Problem, whose
69 Graph<ParameterBlock*>* CreateHessianGraph(const Program& program);
|
| visibility.h | 42 #include "ceres/graph.h"
62 // function above, construct and return a graph whose vertices are
68 // This graph reflects the sparsity structure of reduced camera
72 // Caller acquires ownership of the returned Graph pointer
74 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility);
|
| canonical_views_clustering.h | 49 #include "ceres/graph.h"
59 // Compute a partitioning of the vertices of the graph using the
63 // interchangably. Given a weighted Graph G(V,E), the canonical views
65 // of the graph. If w_ij i s the weight connecting the vertex i to
80 // for each vertex in the graph which best explains it, while trying
103 const Graph<int>& graph,
|
| parameter_block_ordering.h | 36 #include "ceres/graph.h"
74 // Builds a graph on the parameter blocks of a Problem, whose
79 Graph<ParameterBlock*>* CreateHessianGraph(const Program& program);
|
| 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...] |
| 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...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
39 Graph g = new Graph();
60 Graph g = new Graph();
74 Graph g = new Graph();
88 Graph g = new Graph();
102 Graph g = new Graph()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DOTGraphTraitsPass.h | 29 Analysis *Graph = &getAnalysis<Analysis>();
30 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
33 ViewGraph(Graph, Name, Simple, Title);
54 Analysis *Graph = &getAnalysis<Analysis>();
61 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph);
65 WriteGraph(File, Graph, Simple, Title);
89 Analysis *Graph = &getAnalysis<Analysis>();
90 std::string Title = DOTGraphTraits<Analysis*>::getGraphName(Graph);
92 ViewGraph(Graph, Name, Simple, Title);
113 Analysis *Graph = &getAnalysis<Analysis>()
[all...] |
| /external/srec/tools/grxmlcompile/ |
| gr_iface.cpp | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
30 int Graph::addSubGraph (SubGraph *sbGraph)
68 int Graph::getSubGraphIndex (int subId)
76 int Graph::getSubGraphIndex (SubGraph *sGraph)
86 void Graph::BeginRule (SubGraph *subg)
95 void Graph::EndRule (SubGraph *subg)
104 void Graph::BeginItem (SubGraph *subg)
113 void Graph::BeginItemRepeat (SubGraph *subg, int minCount, int maxCount)
122 void Graph::AddRuleRef (SubGraph *subg, int ruleNo)
132 void Graph::AddLabel (SubGraph *subg, int labNo
[all...] |
| grph.h | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
23 class Graph
26 Graph (const char *name)
36 ~Graph()
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
46 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
49 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
| Briggs.h | 11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
50 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
63 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
77 Graph *g;
80 typedef std::list<Graph::NodeItr> RNAllocableList;
83 typedef std::list<Graph::NodeItr> RNUnallocableList;
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 21 #include "llvm/CodeGen/PBQP/Graph.h"
44 PBQP::Graph& getGraph() { return graph; }
46 const PBQP::Graph& getGraph() const { return graph; }
55 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node,
67 unsigned getVRegForNode(PBQP::Graph::ConstNodeItr node) const;
70 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
95 typedef std::map<PBQP::Graph::ConstNodeItr, unsigned,
97 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node
100 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 49 const ScheduleDAG *Graph) {
57 const ScheduleDAG *Graph) {
66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
68 const ScheduleDAG *Graph) {
99 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());
|
| /external/chromium_org/cc/layers/ |
| heads_up_display_layer_impl.h | 51 class Graph {
53 Graph(double indicator_value, double start_upper_bound);
56 // graph, so that the graph always scales to either it's max or
95 const Graph& graph) const;
117 Graph fps_graph_;
118 Graph paint_time_graph_;
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
21 class Graph {
24 Graph(const Graph&);
25 Graph& operator=(const Graph&);
32 /// NodeSubset - A subset of the graph's nodes.
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!");
101 /// Nodes - The list of nodes for this graph
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| CallPrinter.cpp | 1 //===- CallPrinter.cpp - DOT printer for call graph -----------------------===//
11 // containing the call graph of a module.
29 static std::string getGraphName(CallGraph *Graph) {
30 return "Call graph";
33 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
69 "View call graph",
74 "Print call graph to 'dot' file",
|
