| /prebuilts/ndk/6/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/7/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/7/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/7/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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/libs/armeabi/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/libs/mips/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/libs/x86/include/bits/ |
| ctype_base.h | 51 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/libs/armeabi/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/libs/mips/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/libs/x86/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/libs/armeabi/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/libs/mips/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/libs/x86/include/bits/ |
| ctype_base.h | 53 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /external/opencv/cvaux/src/ |
| 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...] |
| /build/core/tasks/ |
| product-graph.mk | 37 this_makefile := build/core/tasks/product-graph.mk
58 @echo Product graph DOT: $@ for $(PRIVATE_PRODUCTS_FILTER)
61 echo 'graph [ ratio=.5 ];'; \
72 | ./build/tools/filter-product-graph.py $(PRIVATE_PRODUCTS_FILTER) \
132 @echo Product graph PDF: $@
136 @echo Product graph SVG: $@
139 product-graph: $(products_pdf) $(products_svg)
|
| /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;
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| OneShotScheduler.java | 40 public OneShotScheduler(FilterGraph graph) {
41 super(graph);
75 if (mLogVerbose) Log.v(TAG, "One pass through graph completed.");
|
| /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| is_1.pass.cpp | 56 assert(f.is(F::graph, '.'));
57 assert(!f.is(F::graph, '\x07'));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| is_many.pass.cpp | 49 assert( (m[0] & F::graph));
63 assert(!(m[1] & F::graph));
77 assert( (m[2] & F::graph));
91 assert(!(m[3] & F::graph));
105 assert( (m[4] & F::graph));
119 assert( (m[5] & F::graph));
133 assert( (m[6] & F::graph));
158 assert(!(m[0] & F::graph));
172 assert(!(m[1] & F::graph));
186 assert( (m[2] & F::graph));
[all...] |
| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 35 #include "ceres/graph.h"
51 // graph. centers will contain the vertices that are the identified
58 void ComputeClustering(const Graph<int>& graph,
72 const Graph<int>* graph_;
82 const Graph<int>& graph,
88 cv.ComputeClustering(graph, options, centers, membership);
95 const Graph<int>& graph,
[all...] |
| /external/svox/pico/lib/ |
| picoklex.c | 52 - one lex entry has POS GRAPH PHON, all mandatory, but
55 - (POS,GRAPH) is a uniq key (only one entry allowed)
56 - (GRAPH) is almost a uniq key (2-4 entries with the same GRAPH, and
58 - for one graph we can have two or three solutions from the lex
60 - in this case GRAPH, POS, and PHON all must be available in 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
[all...] |
