| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| Scheduler.java | 31 Scheduler(FilterGraph graph) {
32 mGraph = graph;
|
| SimpleScheduler.java | 28 public SimpleScheduler(FilterGraph graph) {
29 super(graph);
|
| RandomScheduler.java | 33 public RandomScheduler(FilterGraph graph) {
34 super(graph);
|
| RoundRobinScheduler.java | 32 public RoundRobinScheduler(FilterGraph graph) {
33 super(graph);
|
| FilterContext.java | 105 for (FilterGraph graph : mGraphs) {
106 graph.tearDown(this);
123 final void addGraph(FilterGraph graph) {
124 mGraphs.add(graph);
|
| /build/core/tasks/ |
| product-graph.mk | 21 @echo Product graph DOT: $@
24 echo 'graph [ ratio=.5 ];'; \
39 # graph more readable. To add that, add this line to the rule
44 @echo Product graph PDF: $@
47 product-graph: $(products_pdf)
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/ |
| GraphEnvironment.java | 35 * A GraphEnvironment provides a simple front-end to filter graph setup and execution using the
38 * 2. Perform any configuration, such as adding graph references and setting a GL environment.
39 * 3. Load a graph file using loadGraph() or add a graph using addGraph().
59 public GraphHandle(FilterGraph graph) {
60 mGraph = graph;
95 * @param reader The GraphReader to use for graph loading, or null to auto-create one.
97 * null if you will not load any graph files.
105 * Returns the used graph reader. This will create one, if a reader has not been set already.
115 * Add graph references to resolve during graph reading. The references added here are share
133 FilterGraph graph = null; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 56 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, i )
[all...] |
| enmin.cpp | 73 // 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 -> total > 2
[all...] |
| /external/bison/src/ |
| vcg.h | 112 /* 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.
445 struct graph struct
937 typedef struct graph graph; typedef in typeref:struct:graph
[all...] |
| /external/svox/pico/lib/ |
| picoklex.h | 102 /** lookup lex by graph; result(s) are in lexres, ie. the phones are
110 const picoos_uint8 *graph,
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/i686-linux/bits/ |
| ctype_base.h | 55 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/i686-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/x86_64-linux/bits/ |
| ctype_base.h | 57 static const mask graph = _ISalpha | _ISdigit | _ISpunct; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/x86/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/libs/x86/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGAliasTracker.h | 45 AliasTracker(Graph& graph)
46 : m_graph(graph)
112 // The graph, to look up potentially aliasing nodes.
113 Graph& m_graph;
|
| DFGScoreBoard.h | 38 // This class is used in performing a virtual register allocation over the graph.
45 ScoreBoard(Graph& graph, uint32_t firstTemporary)
46 : m_graph(graph)
113 // The graph, so we can get refCounts for nodes, to determine when values are dead.
114 Graph& m_graph;
|
