| /external/srec/tools/grxmlcompile/ |
| 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/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/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/ceres-solver/internal/ceres/ |
| graph.h | 46 // A weighted undirected graph templated over the vertex ids. Vertex
49 class Graph {
51 Graph() {}
53 // Add a weighted vertex. If the vertex already exists in the graph,
92 // AddEdge on a pair of vertices which do not exist in the graph yet
117 // Calling VertexWeight on a vertex not in the graph will result in
124 // vertices is not present in the graph will result in undefined
135 // Calling Neighbors on a vertex not in the graph will result in
155 CERES_DISALLOW_COPY_AND_ASSIGN(Graph);
|
| /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_;
|
| heads_up_display_layer_impl.cc | 52 HeadsUpDisplayLayerImpl::Graph::Graph(double indicator_value,
61 double HeadsUpDisplayLayerImpl::Graph::UpdateUpperBound() {
279 const Graph& graph) const {
291 // top of graph).
295 bounds.height() * (1.0 - graph.indicator / graph.current_upper_bound) -
365 // Collect graph and histogram data.
434 // Draw FPS graph
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
36 public class Graph {
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| 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...] |
| 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...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| 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...] |
| 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...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
26 /// PBQP Graph class.
28 class Graph {
144 inline void copyFrom(const Graph &other);
147 /// \brief Construct an empty PBQP graph.
148 Graph() : numNodes(0), numEdges(0) {}
150 /// \brief Copy construct this graph from "other". Note: Does not copy node
151 /// and edge data, only graph structure and costs
[all...] |
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 54 CvGraph* Graph;
163 // pLCM : in, information about graph
165 // Returns: pointer to graph node
196 // Purpose: Function create graph node
199 // pLCM : in, information about graph
200 // Returns: pointer to graph node
208 // Purpose: Function create graph edge
211 // pLCM : in, information about graph
212 // Returns: pointer to graph edge
223 // LCMNode : in, graph nod
[all...] |
| /external/clang/test/SemaCXX/ |
| warn-thread-safety-parsing.cpp | [all...] |
| warn-thread-safety-analysis.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /external/opencv/cvaux/include/ |
| cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder
314 int N; //graph size
342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse,
347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/
353 // Purpose: finds weight of subgraph in a graph
356 // graph - input graph.
364 // weight_vtx - optional vector of floats, with size = graph->total.
368 // that vertices of graph are inherited from CvGraphWeightedVtx.
369 // weight_edge - optional matrix of floats, of width and height = graph->total
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
| compiler.jar | |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /prebuilts/misc/common/antlr/ |
| antlr-3.4-complete.jar | |
| /prebuilts/tools/common/m2/internal/com/google/code/findbugs/findbugs/2.0.1/ |
| findbugs-2.0.1.jar | |
