Searched refs:graph (Results 1 - 25 of 81) sorted by relevance

1234

/external/clang/test/PCH/Inputs/
H A Dtypo.hpp4 namespace graph { namespace in namespace:boost
/external/libvorbis/examples/
H A Dframeview.pl289 my($graph)=@_;
294 my$w=$graph->{"canvas"};
304 if($graph->{"vars"}->[$i]){
306 if(!defined($graph->{"minx"})){
308 $graph->{"maxx"}=$1;
309 $graph->{"minx"}=$1;
310 $graph->{"maxy"}=$2;
311 $graph->{"miny"}=$2;
317 $rescale=1 if($1>$graph->{"maxx"});
318 $rescale=1 if($1<$graph
[all...]
/external/opencv/cvaux/src/
H A Dcvclique.cpp56 CvGraph* graph;
58 int N; //graph size
92 void _MarkNodes( CvGraph* graph )
95 for( int i = 0; i < graph->total; i++ )
97 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
105 void _FillAdjMatrix( CvGraph* graph, int** connected, int reverse )
108 for( int i = 0; i < graph->total; i++ )
110 for( int j = 0; j < graph->total; j++ )
114 //memset( connected[i], 0, sizeof(int)*graph->total );
115 CvGraphVtx* ver = cvGetGraphVtx( graph,
[all...]
H A Denmin.cpp73 // struct Vertex is used for storing vertices of graph
81 // struct Edge is used for storing edges of graph
167 // function makeGraph creates initial graph to find maximum flow in it
202 CvGraph* graph = *graphPtr;
210 cvGraphAddVtx( graph, NULL, &newVtxPtr );
214 cvGraphAddVtx( graph, NULL, &newVtxPtr );
217 cvGraphAddVtx( graph, NULL, &newVtxPtr );
221 int alphaVtx = graph -> total - 2;
222 int betaVtx = graph -> total - 1;
225 if( graph
[all...]
/external/bison/src/
H A Dvcg.h112 /* VCG graph orientation. */
172 coordinates of the graph. Locations are specified in the form
174 if the whole graph is fully specified with locations and no part is
219 scale value of a node relatively to a scale value of the graph,
220 i.e. if (stretch,shrink) = (2,1) for the graph and (stretch,shrink)
221 = (2,1) for the node of the graph, then the node is scaled by the
229 (with k ? 0) means that the graph part that is reachable via edges
272 combines additional text labels with a node or a folded graph. info1,
443 | Graph attributs list. Structure that describes a graph. |
446 struct graph
445 struct graph struct
937 typedef struct graph graph; typedef in typeref:struct:graph
[all...]
/external/svox/pico/lib/
H A Dpicoklex.h102 /** lookup lex by graph; result(s) are in lexres, ie. the phones are
110 const picoos_uint8 *graph,
H A Dpicoklex.c58 - for one graph we can have two or three solutions from the lex
66 - 3 bytes for graph-prefix
270 /* convert graph-prefix to number with 'lexicographic' ordering */
359 const picoos_uint8 *graph,
368 PICODBG_TRACE(("%d|%d graph|lex: %c|%c", graphlen, lexlen,
369 graph[i], lexgraph[i]));
370 if (lexgraph[i] < graph[i]) {
372 } else if (lexgraph[i] > graph[i]) {
419 const picoos_uint8 *graph,
431 rv = klex_lexMatch(&(this->lexblocks[lexpos]), graph, graphle
358 klex_lexMatch(picoos_uint8 *lexentry, const picoos_uint8 *graph, const picoos_uint16 graphlen) argument
416 klex_lexblockLookup(klex_SubObj this, const picoos_uint32 lexposStart, const picoos_uint32 lexposEnd, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument
482 picoklex_lexLookup(const picoklex_Lex this, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument
[all...]
H A Dpicokdt.h167 /* graph attributes: values to be used if the graph attribute is
173 /* graph attributes (special case for g2p): values to be used if the
174 graph attribute is directly outside the grapheme string (ie. at the
205 graph: the grapheme string of the word for wich POS will be predicted
206 graphlen: length of graph in number of bytes
212 const picoos_uint8 *graph,
285 graph: the grapheme string used to determine invec[0:8]
286 graphlen: length of graph in number of bytes
289 nrvow number of vowel-like graphemes in graph i
[all...]
/external/webkit/Source/JavaScriptCore/dfg/
H A DDFGScoreBoard.h38 // This class is used in performing a virtual register allocation over the graph.
45 ScoreBoard(Graph& graph, uint32_t firstTemporary) argument
46 : m_graph(graph)
113 // The graph, so we can get refCounts for nodes, to determine when values are dead.
H A DDFGAliasTracker.h45 AliasTracker(Graph& graph) argument
46 : m_graph(graph)
112 // The graph, to look up potentially aliasing nodes.
H A DDFGJITCompiler.h101 // DFG::JITCompiler is responsible for generating JIT code from the dataflow graph.
119 Graph& graph() { return m_graph; }
253 return graph()[nodeIndex].isConstant();
257 return graph()[nodeIndex].op == Int32Constant;
261 return graph()[nodeIndex].op == DoubleConstant;
265 return graph()[nodeIndex].op == JSConstant;
272 return graph()[nodeIndex].int32Constant();
277 return graph()[nodeIndex].numericConstant();
282 unsigned constantIndex = graph()[nodeIndex].constantNumber();
315 // The dataflow graph currentl
[all...]
H A DDFGJITCodeGenerator.h97 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
137 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
143 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
154 , m_blockHeads(jit.graph().m_blocks.size())
187 VirtualRegister virtualRegister = m_jit.graph()[nodeIndex].virtualRegister;
294 Node& node = m_jit.graph()[nodeIndex];
383 Node& node = m_jit.graph()[nodeIndex];
402 Node& node = m_jit.graph()[nodeIndex];
411 Node& node = m_jit.graph()[nodeIndex];
424 Node& node = m_jit.graph()[nodeInde
[all...]
/external/valgrind/main/massif/
H A Dms_print.in71 --x=<4..1000> graph width, in columns [72]
72 --y=<4..1000> graph height, in rows [20]
341 # - the graph
477 # Setup for graph.
479 # The ASCII graph.
482 # The rest ([1][1]..[graph_x][graph_y]) is the usable graph area.
483 my @graph;
492 # Setup graph[][].
493 $graph[0][0] = '+'; # axes join point
494 for ($x = 1; $x <= $graph_x; $x++) { $graph[
[all...]
/external/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h43 PBQP::Graph& getGraph() { return graph; }
45 const PBQP::Graph& getGraph() const { return graph; }
99 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
/external/opencv/cxcore/src/
H A Dcxdatastructs.cpp2875 /* Create a new graph: */
2880 CvGraph *graph = 0; local
2900 graph = (CvGraph*)vertices;
2901 graph->edges = edges;
2905 return graph;
2909 /* Remove all vertices and edges from a graph: */
2911 cvClearGraph( CvGraph * graph )
2917 if( !graph )
2920 cvClearSet( graph->edges );
2921 cvClearSet( (CvSet*)graph );
2929 cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* _vertex, CvGraphVtx** _inserted_vertex ) argument
2962 cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx ) argument
2995 cvGraphRemoveVtx( CvGraph* graph, int index ) argument
3032 cvFindGraphEdgeByPtr( const CvGraph* graph, const CvGraphVtx* start_vtx, const CvGraphVtx* end_vtx ) argument
3073 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) argument
3102 cvGraphAddEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument
3175 cvGraphAddEdge( CvGraph* graph, int start_idx, int end_idx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument
3204 cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx ) argument
3269 cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx ) argument
3292 cvGraphVtxDegreeByPtr( const CvGraph* graph, const CvGraphVtx* vertex ) argument
3318 cvGraphVtxDegree( const CvGraph* graph, int vtx_idx ) argument
3679 cvCloneGraph( const CvGraph* graph, CvMemStorage* storage ) argument
[all...]
/external/regex-re2/benchlog/
H A Dmktable34 sub graph() { subroutine
119 "graph" => \&graph,
/external/sonivox/jet_tools/JetCreator/
H A DJetPreview.py44 self.graph = None
46 def SetGraphCtrl(self, graph, parentWin):
47 """ Sets the graph control for the player """
48 self.graph = graph
52 """ Sets the callback function for the graph control to update """
/external/v8/src/
H A Dhydrogen.cc55 HBasicBlock::HBasicBlock(HGraph* graph) argument
56 : block_id_(graph->GetNextBlockID()),
57 graph_(graph),
437 // Checks reachability of the blocks in this graph and stores a bit in
439 // from the start block of the graph. If "dont_visit" is non-null, the given
440 // block is treated as if it would not be part of the graph. "visited_count()"
536 // Check that the graph is fully connected.
982 explicit HRangeAnalysis(HGraph* graph) : argument
983 graph_(graph), zone_(graph
1326 HStackCheckEliminator(HGraph* graph) argument
1408 HGlobalValueNumberer(HGraph* graph, CompilationInfo* info) argument
1441 HGraph* graph() { return graph_; } function in class:v8::internal::BASE_EMBEDDED
1728 HInferRepresentation(HGraph* graph) argument
7887 TraceHydrogen(const char* name, HGraph* graph) argument
7892 Trace(const char* name, HGraph* graph, LChunk* chunk) argument
8151 Begin(const char* name, HGraph* graph, LChunk* chunk, LAllocator* allocator) argument
[all...]
/external/opencv/cxcore/include/
H A Dcxcore.h1155 /* Creates new graph */
1160 /* Adds new vertex to the graph */
1161 CVAPI(int) cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* vtx CV_DEFAULT(NULL),
1165 /* Removes vertex from the graph together with all incident edges */
1166 CVAPI(int) cvGraphRemoveVtx( CvGraph* graph, int index );
1167 CVAPI(int) cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx );
1174 CVAPI(int) cvGraphAddEdge( CvGraph* graph,
1179 CVAPI(int) cvGraphAddEdgeByPtr( CvGraph* graph,
1185 CVAPI(void) cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx );
1186 CVAPI(void) cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVt
1198 CVAPI(void) cvClearGraph( CvGraph* graph ); variable
1245 CvGraph* graph; /* the graph */ member in struct:CvGraphScanner
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/
H A DScenarioData.java98 TimeLineGraph graph = new TimeLineGraph(scenarioName + ": " + dim.getName(), dim);
121 graph.addItem("main", label, dim.getDisplayValue(value), value, color, true, Utils.getDateFromBuildID(buildID), true);
125 graph.addItem("main", label, dim.getDisplayValue(value), value, black, false, Utils.getDateFromBuildID(buildID, false), true);
130 graph.addItem("main", buildID, dim.getDisplayValue(value), value, yellow, false, Utils.getDateFromBuildID(buildID), false);
136 graph.addItem("main", buildID, dim.getDisplayValue(value), value, black, false, Utils.getDateFromBuildID(buildID), false);
142 graph.addItem("reference", label, dim.getDisplayValue(value), value, magenta, true, Utils.getDateFromBuildID(buildID, true), true, drawBaseline);
147 graph.addItem("reference", label, dim.getDisplayValue(value), value, magenta, false, Utils.getDateFromBuildID(buildID, true), false);
152 return graph;
270 stream.print("<b>Click measurement name to view line graph of measured values over builds.</b><br><br>\n");
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
H A Dtoy.ml41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
H A Dtoy.ml41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
H A Dtoy.ml41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dtoy.ml45 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
/external/dropbear/libtommath/
H A Dbooker.pl15 $graph = "";
17 $graph = ".ps";
254 print OUT "\\begin{center}\n\\begin{figure}[here]\n\\includegraphics{pics/$m[1]$graph}\n";

Completed in 242 milliseconds

1234