Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 185) sorted by relevance

12345678

/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/
Den-US_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Den-US_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/es-ES/
Des-ES_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Des-ES_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/fr-FR/
Dfr-FR_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dfr-FR_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/it-IT/
Dit-IT_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dit-IT_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/
Den-GB_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Den-GB_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/
Dde-DE_kdt_posp.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
Dde-DE_kdt_g2p.dtfmt19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
/external/opencv/cvaux/src/
Dcvclique.cpp92 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++ )
115 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
129 void cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse, int weighted, int wei…
137 finder->vertex_weights = (float*)malloc( sizeof(float)*(graph->total+1));
138 finder->cur_weight = (float*)malloc( sizeof(float)*(graph->total+1));
[all …]
Denmin.cpp202 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 -> total > 2 )
229 vtxPtr = cvGetGraphVtx( graph, i );
232 cvGraphAddEdge( graph, alphaVtx, i, NULL, &newEdgePtr );
240 CvGraphVtx* tempVtxPtr = cvGetGraphVtx( graph, i - 1 );
[all …]
/external/llvm/lib/CompilerDriver/
DMain.cpp68 int BuildTargets(CompilationGraph& graph, const LanguageMap& langMap) { in BuildTargets() argument
76 ret = graph.Build(tempDir, langMap); in BuildTargets()
98 CompilationGraph graph; in Main() local
107 if (int ret = autogenerated::RunInitialization(langMap, graph)) in Main()
111 ret = graph.Check(); in Main()
119 graph.viewGraph(); in Main()
128 return graph.writeGraph(Out); in Main()
136 ret = BuildTargets(graph, langMap); in Main()
/external/bison/src/
Dvcg.h445 struct graph struct
937 typedef struct graph graph; argument
939 void new_graph (graph *g);
943 void add_node (graph *g, node *n);
944 void add_edge (graph *g, edge *e);
946 void add_colorentry (graph *g, int color_idx, int red_cp,
948 void add_classname (graph *g, int val, const char *name);
949 void add_infoname (graph *g, int val, const char *name);
960 void output_graph (graph *g, FILE *fout);
961 void close_graph (graph *g, FILE *fout);
/external/valgrind/main/massif/
Dms_print.in71 --x=<4..1000> graph width, in columns [72]
72 --y=<4..1000> graph height, in rows [20]
483 my @graph;
493 $graph[0][0] = '+'; # axes join point
494 for ($x = 1; $x <= $graph_x; $x++) { $graph[$x][0] = '-'; } # X-axis
495 for ($y = 1; $y <= $graph_y; $y++) { $graph[0][$y] = '|'; } # Y-axis
496 $graph[$graph_x][0] = '>'; # X-axis arrow
497 $graph[0][$graph_y] = '^'; # Y-axis arrow
500 $graph[$x][$y] = ' ';
558 $graph[$x2][$prev_y_max] = $prev_char;
[all …]
/external/opencv/cxcore/src/
Dcxdatastructs.cpp2880 CvGraph *graph = 0; in cvCreateGraph() local
2900 graph = (CvGraph*)vertices; in cvCreateGraph()
2901 graph->edges = edges; in cvCreateGraph()
2905 return graph; in cvCreateGraph()
2911 cvClearGraph( CvGraph * graph ) in cvClearGraph() argument
2917 if( !graph ) in cvClearGraph()
2920 cvClearSet( graph->edges ); in cvClearGraph()
2921 cvClearSet( (CvSet*)graph ); in cvClearGraph()
2929 cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* _vertex, CvGraphVtx** _inserted_vertex ) in cvGraphAddVtx() argument
2938 if( !graph ) in cvGraphAddVtx()
[all …]
/external/webkit/Source/WebCore/inspector/front-end/
DnetworkPanel.css106 .network-sidebar .small .network-graph-side {
216 .network-graph-side {
226 .network-graph-bar-area {
234 .network-graph-label {
252 .network-graph-side:hover .network-graph-label {
256 .network-graph-label:empty {
260 .network-graph-label.waiting {
264 .network-graph-label.waiting-right {
268 .network-graph-label.before {
275 .network-graph-label.before::after {
[all …]
/external/svox/pico/lib/
Dpicoklex.c359 const picoos_uint8 *graph, in klex_lexMatch() argument
369 graph[i], lexgraph[i])); in klex_lexMatch()
370 if (lexgraph[i] < graph[i]) { in klex_lexMatch()
372 } else if (lexgraph[i] > graph[i]) { in klex_lexMatch()
419 const picoos_uint8 *graph, in klex_lexblockLookup() argument
431 rv = klex_lexMatch(&(this->lexblocks[lexpos]), graph, graphlen); in klex_lexblockLookup()
449 if (klex_lexMatch(&(this->lexblocks[lexpos]), graph, in klex_lexblockLookup()
483 const picoos_uint8 *graph, in picoklex_lexLookup() argument
504 tgraph[i] = graph[i]; in picoklex_lexLookup()
527 klex_lexblockLookup(klex, lexposStart, lexposEnd, graph, graphlen, lexres); in picoklex_lexLookup()
/external/webkit/Source/JavaScriptCore/dfg/
DDFGJITCompiler.h119 Graph& graph() { return m_graph; } in graph() function
253 return graph()[nodeIndex].isConstant(); in isConstant()
257 return graph()[nodeIndex].op == Int32Constant; in isInt32Constant()
261 return graph()[nodeIndex].op == DoubleConstant; in isDoubleConstant()
265 return graph()[nodeIndex].op == JSConstant; in isJSConstant()
272 return graph()[nodeIndex].int32Constant(); in valueOfInt32Constant()
277 return graph()[nodeIndex].numericConstant(); in valueOfDoubleConstant()
282 unsigned constantIndex = graph()[nodeIndex].constantNumber(); in valueOfJSConstant()
/external/v8/src/
Dhydrogen.cc55 HBasicBlock::HBasicBlock(HGraph* graph) in HBasicBlock() argument
56 : block_id_(graph->GetNextBlockID()), in HBasicBlock()
57 graph_(graph), in HBasicBlock()
848 explicit HRangeAnalysis(HGraph* graph) : graph_(graph), changed_ranges_(16) {} in HRangeAnalysis() argument
1197 explicit HStackCheckEliminator(HGraph* graph) : graph_(graph) { } in HStackCheckEliminator() argument
1249 explicit HGlobalValueNumberer(HGraph* graph, CompilationInfo* info) in HGlobalValueNumberer() argument
1250 : graph_(graph), in HGlobalValueNumberer()
1274 HGraph* graph() { return graph_; } in graph() function in v8::internal::BASE_EMBEDDED
1487 explicit HInferRepresentation(HGraph* graph) in HInferRepresentation() argument
1488 : graph_(graph), worklist_(8), in_worklist_(graph->GetMaximumValueID()) {} in HInferRepresentation()
[all …]
/external/llvm/tools/llvmc/doc/
DLLVMC-Reference.rst27 structure as an abstract graph. The structure of this graph is described in
100 * ``--check-graph`` - Check the compilation for common errors like mismatched
105 * ``--view-graph`` - Show a graphical representation of the compilation graph
109 * ``--write-graph`` - Write a ``compilation-graph.dot`` file in the current
110 directory with the compilation graph description in Graphviz format (identical
111 to the file used by the ``--view-graph`` option). The ``-o`` option can be
131 compilation graph; its format is documented in the following
170 Customizing LLVMC: the compilation graph
178 form of a graph. Nodes in this graph represent tools, and edges between two
183 The definition of the compilation graph (see file ``llvmc/src/Base.td`` for an
[all …]
DLLVMC-Tutorial.rst88 // Compilation graph
92 map, and the compilation graph definition.
94 At the heart of LLVMC is the idea of a compilation graph: vertices in this graph
97 executable code by an assembler). The compilation graph is basically a list of
98 edges; a special node named ``root`` is used to mark graph entry points.
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h43 PBQP::Graph& getGraph() { return graph; } in getGraph()
45 const PBQP::Graph& getGraph() const { return graph; } in getGraph()
99 PBQP::Graph graph; variable

12345678