| /external/srec/tools/grxmlcompile/ |
| grph.h | 32 subGraph= 0;
38 delete [] subGraph;
43 int addSubGraph (SubGraph *subGraph);
44 int getSubGraphIndex (SubGraph *subGraph);
46 void BeginRule (SubGraph *subg);
47 void EndRule (SubGraph *subg);
48 void BeginItem (SubGraph *subg);
49 void BeginItemRepeat (SubGraph *subg, int min_count, int max_count)
[all...] |
| gr_iface.cpp | 30 int Graph::addSubGraph (SubGraph *sbGraph)
36 SubGraph **newSubGraph= new SubGraph * [numSubGraph+BLKSIZE];
39 newSubGraph[ii]= subGraph[ii];
42 delete [] subGraph;
44 subGraph= newSubGraph;
48 subGraph= new SubGraph * [BLKSIZE];
54 subGraph[numSubGraph]= sbGraph;
76 int Graph::getSubGraphIndex (SubGraph *sGraph
[all...] |
| grxmldoc.h | 36 class SubGraph;
68 bool findSubGraph(std::string & s, SubGraph *&p_SubGraph);
72 bool findSubGraphIndex( SubGraph *p_SubGraph, std::string &s );
84 // Take DOM object and create word graph. Creates SubGraph, rule, tag and label lists.
97 bool parseNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level );
98 bool beginNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level );
99 bool endNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level );
104 bool beginParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph);
105 bool endParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph );
106 bool beginItem( XMLNode &node, SubGraph *&p_SubGraph )
[all...] |
| sub_base.cpp | 29 SubGraph::SubGraph (SubGraph *baseG)
52 int SubGraph::NewVertexId ()
57 void SubGraph::AllocateSpaceForArc ()
71 NUANArc *SubGraph::CreateArc (int iLabel, int oLabel, int from, int to)
81 NUANArc *SubGraph::InheritArc (NUANArc *arcBase, int id)
91 NUANArc *SubGraph::InheritReverseArc (NUANArc *arcBase, int id)
101 NUANArc *SubGraph::InheritReverseArcWithTag (NUANArc *arcBase, int id, int tagId)
112 NUANArc *SubGraph::CreateCopyWithOutput (NUANArc *arcBase, int id
[all...] |
| sub_supp.cpp | 34 void SubGraph::SortLanguage ()
51 void SubGraph::SortLanguageAtIndices (int begIx, int endIx)
131 void SubGraph::SortLanguageAtSortIndices (int begIx, int endIx)
204 int SubGraph::FindFromIndex (int element)
229 void SubGraph::SortLanguageReverse ()
309 int SubGraph::FindToIndex (int element)
334 void SubGraph::UpdateSortForLanguage ()
339 bool SubGraph::CheckSort ()
348 bool SubGraph::CheckSortReverse ()
359 void SubGraph::ClearDuplicateArcs (
[all...] |
| sub_grph.cpp | 52 void SubGraph::pushScope ()
64 void SubGraph::popScope ()
78 void SubGraph::BeginScope (int scopeType, int newArg1, int newArg2)
110 void SubGraph::EndScope ()
117 int SubGraph::ConnectLastScope (int beginScopeId, int endScopeId)
168 int SubGraph::CloseScope ()
244 int SubGraph::AddItem (int inputLabel, int tagLabel)
269 int SubGraph::AddTag (int tagLabel)
293 void SubGraph::ExpandRules (SubGraph **subList, int *lookupList, int numSubs
[all...] |
| grxmldoc.cpp | 128 SubGraph *p_SubGraph;
130 parseNode( node, p_SubGraph, 1 ); // NB Subgraph pointed to will change in recursive fn.
142 bool GRXMLDoc::parseNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level )
144 // We will create a new subgraph for each rule node.
145 // The "current" subgraph is substituted with the new subgraph for all ops on child nodes.
146 // After processing child nodes the original subgraph is reinstated
167 SubGraph *p_LocalSubGraph;
184 bool GRXMLDoc::beginNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level )
227 // NB This fn creates a new subgraph
[all...] |
| sub_min.cpp | 47 void SubGraph::ViewNode (int currId)
63 bool SubGraph::EquivalenceTestForward (int firstId, int secondId, int *equivMap)
120 void SubGraph::IdentifyEquivalence (int *depthMap, int *equivMap)
157 void SubGraph::CheckForChangeAndResort (int currId, int *mapList)
182 void SubGraph::DeterminizeAtVertex (int baseId, DetCache *cache)
257 int SubGraph::PairwiseDeterminize (int baseId, int firstId, int fixStart, int secondId,
357 void SubGraph::MergeVertices (int newId, int firstId, int secondId)
457 void SubGraph::SetupVisitationCache ()
468 void SubGraph::ClearVisitationCache ()
474 void SubGraph::UpdateVisitationCache (int startNo
[all...] |
| sub_phon.cpp | 31 void SubGraph::ExpandPhonemes ( GRXMLDoc &doc )
110 void SubGraph::AddLeftContexts ()
133 void SubGraph::AddRightContexts ()
156 void SubGraph::ExpandToHMMs ( GRXMLDoc &doc )
208 void SubGraph::ExpandIntraWordSilence ( GRXMLDoc &doc )
315 void SubGraph::ShiftOutputsToLeft ()
325 void SubGraph::ReverseMarkArcs ()
335 void SubGraph::ReverseMarkOutput (int currId, int initialId, int outId)
356 void SubGraph::MarkNodesByOutputAndClearArcs ()
409 void SubGraph::FinalProcessing (GRXMLDoc &doc
[all...] |
| sub_grph.h | 101 class SubGraph
105 SubGraph (char *name, int ruleNo)
127 SubGraph (SubGraph *baseG);
129 ~SubGraph ()
153 void CopyFastArcs (SubGraph *subG, int startLoc, int endLoc, int offset, int headId, int newHeadId, int tailId, int newTailId);
160 void ExpandRules (SubGraph **subList, int *lookupList, int numSubs);
162 /** Reverse subgraph */
|
| netw_dump.cpp | 32 void SubGraph::RemapForSortedOutput ( GRXMLDoc &p_Doc )
44 void SubGraph::WriteForwardGraphFile( std::string & fileName, GRXMLDoc &p_Doc )
97 void SubGraph::WriteForwardGraphWithSemantic ( std::string & fileName, GRXMLDoc &p_Doc )
183 void SubGraph::WriteHMMGraphFile( std::string & fileName, GRXMLDoc &p_Doc )
266 void SubGraph::WritePhonemeGraphFile( std::string & fileName, GRXMLDoc &p_Doc )
339 void SubGraph::PrintWithLabels( GRXMLDoc &p_Doc )
|
| hashmap.cpp | 185 template class HashMap<string, SubGraph* >;
|
| netw_arc.h | 32 friend class SubGraph;
|
| /external/chromium_org/tools/gyp/tools/ |
| graphviz.py | 69 # Group multiple nodes together in a subgraph.
70 print ' subgraph "cluster_%s" {' % filename
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| FilterGraph.java | 318 for (FilterGraph subGraph : mSubGraphs) {
319 subGraph.attachToRunner(runner);
352 for (FilterGraph subGraph : mSubGraphs) {
353 subGraph.mParentGraph = null;
354 subGraph.tearDown();
|
| /external/chromium_org/chrome/tools/ |
| history-viz.py | 182 print ' subgraph { rank=source; 0 [label="start"] }'
190 print 'subgraph clusterhost%d {' % i
197 print ' subgraph cluster%d%d {' % (i, j)
|
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| dot.php | 63 'node', 'graph', 'digraph', 'strict', 'edge', 'subgraph'
|
| scilab.php | 197 'subf', 'subgraph', 'subplot', 'successors', 'sum', 'supernode', 'surf', 'surface_properties', 'sva',
|
| /dalvik/hit/src/com/android/hit/ |
| Queries.java | 47 * it build the set of objects in its subgraph.
|
| /external/llvm/lib/Analysis/ |
| RegionPrinter.cpp | 104 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void*>(R)
|
| /external/opencv/cvaux/include/ |
| cvaux.h | 353 // Purpose: finds weight of subgraph in a graph
357 // subgraph - sequence of pairwise different ints. These are indices of vertices of subgraph.
378 // weight of subgraph.
381 /*CVAPI(float) cvSubgraphWeight( CvGraph *graph, CvSeq *subgraph,
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 248 /// setSubgraphColor - Convenience for setting subgraph color attribute.
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| shortest-path.h | 282 mutable SearchMultimap search_multimap_; // Maps from 'start' to subgraph
323 if (p.start != start && p.start != kNoLabel) { // entering sub-subgraph
|
| /external/chromium_org/tools/checkdeps/ |
| graphdeps.py | 31 regexps. Can generate only a subgraph of the whole dependency graph
|
| /external/v8/include/ |
| v8-profiler.h | 496 * a subgraph by holding one of its nodes.
|
