| /external/sonivox/jet_tools/JetCreator/ |
| JetCreatorhlp.dat | 11 graph =
53 graph =
59 graph type =
104 graph = The currently playing segment is displayed graphically here. You may trigger clips by clicking within their boundaries on the graph.
|
| JetSegGraph.py | 6 Draws the event graph and progress bar
49 """ Defines portions of the graph for events """
90 """ Draws the player graph bar """
119 """ Clears the graph values """
134 """ Loads up the segment drawing the graph """
145 #disable graph for debugging
335 #disable graph for debugging
|
| /external/srec/tools/grxmlcompile/ |
| grxmldoc.h | 35 class Graph;
84 // Take DOM object and create word graph. Creates SubGraph, rule, tag and label lists.
130 Graph *m_pGraph; // The top-level container object for the word graph;
141 // We store indices for all labels used in the word graph.
|
| netw_dump.cpp | 3 * DESCRIPTION: Part of the SREC graph compiler project source files.
46 // Creates file of forward graph - the {name}.G.txt file
185 // Creates file of forward graph - the {name}.G.txt file
268 // Creates file of forward graph - the {name}.G.txt file
345 printf ("Graph %s (%d %d)\n", title, startId, lastId);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SetFactory.java | 39 * BitIntSet/ListIntSet threshold for interference graph sets. These
72 * Make IntSet for the interference graph sets. Public because
|
| /dalvik/hit/src/com/android/hit/ |
| Instance.java | 58 * of the object graph. If non-null, the filter is applied to each
59 * node in the graph to determine if it should be added to the result
|
| /external/srec/srec/Semproc/include/ |
| SR_SemanticProcessor.h | 41 * Parse a graph with the processor provided as argument. Store semantic results in the objects pointed to by each
49 * Parse a graph with the processor provided as argument. Store semantic results in the objects pointed to by each
|
| SR_SemprocDefinitions.h | 72 * Max depth of a graph (tokens including scope markers, scripts, words etc)
92 * Offset used for denoting scripts (since integer used as label in graph)
97 * Offset used for denoting scope markers (since integer used as label in graph)
|
| /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,
|
| picowa.c | 194 const picoos_uint8 *graph,
202 /* check existence of special char (e.g. hyphen) in graph:
210 if (graph[i++] == '-') {
216 if (!picokdt_dtPosPconstructInVec(wa->dtposp, graph, graphlen, specchar)) {
269 do POS prediction: -> WORDGRAPH(POSes,NA)graph
275 no phone, one entry -> WORDGRAPH(POS,NA)graph
291 /* no lex entry found, WORDGRAPH(POS,NA)graph */
339 } else { /* no phone, :G2P, one entry: WORDGRAPH(POS,NA)graph */
|
| /external/webkit/JavaScriptCore/profiler/ |
| Profile.cpp | 105 printf("Call graph:\n");
121 printf("Call graph:\n");
|
| /external/bison/lib/ |
| timevar.def | 50 DEFTIMEVAR (TV_GRAPH , "outputing graph")
|
| /sdk/ddms/libs/ddmuilib/src/com/android/ddmuilib/log/event/ |
| DisplaySyncPerf.java | 60 // Information to graph for each authority
96 * Constructs a graph of network and database stats.
98 * @param name The name of this graph in the graph list.
|
| /external/sonivox/arm-wt-22k/lib_src/ |
| dls.h | 38 'art1' level 1 Articulation connection graph
39 'art2' level 2 Articulation connection graph
89 Articulation connection graph definitions
|
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 263 final DependencyGraph graph = mGraph; local
264 graph.clear();
268 graph.add(child);
273 graph.log(getResources(), ABOVE, BELOW, ALIGN_BASELINE, ALIGN_TOP, ALIGN_BOTTOM);
275 graph.log(getResources(), LEFT_OF, RIGHT_OF, ALIGN_LEFT, ALIGN_RIGHT);
278 graph.getSortedViews(mSortedVerticalChildren, ABOVE, BELOW, ALIGN_BASELINE,
280 graph.getSortedViews(mSortedHorizontalChildren, LEFT_OF, RIGHT_OF, ALIGN_LEFT, ALIGN_RIGHT);
[all...] |
| /external/bison/src/ |
| vcg.c | 42 /* Initialize a graph with the default values. */
44 new_graph (graph *g)
380 | Edge and nodes into a graph. |
384 add_node (graph *g, node *n)
391 add_edge (graph *g, edge *e)
398 add_classname (graph *g, int val, const char *name)
408 add_infoname (graph *g, int integer, const char *str)
419 add_colorentry (graph *g, int color_idx, int red_cp,
478 fputs ("graph: {\n", fout);
482 close_graph (graph *g, FILE *fout
[all...] |
| print_graph.c | 41 static graph static_graph;
215 /* Output graph options. */
225 /* Close graph. */
|
| files.h | 41 /* File name specified for the output VCG graph. */
|
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/bin/ |
| i686-unknown-linux-gnu-gcov | |
| /external/srec/srec/crec/ |
| srec_context.c | 164 context = (srec_context*)CALLOC_CLR(1, sizeof(srec_context), "srec.graph.base");
337 Interface = (wordmap*)CALLOC_CLR(1, sizeof(wordmap), "srec.graph.wordmap.base");
340 /* *pwmap->words = (ptr32*) CALLOC_CLR(wmap->max_words, sizeof(ptr32), "graph.wordmap.words"); */
341 Interface->words = (char**) CALLOC_CLR(Interface->max_words, sizeof(char*), "srec.graph.wordmap.words");
343 Interface->chars = (char*) CALLOC_CLR(Interface->max_chars, sizeof(char), "srec.graph.wordmap.chars");
356 CHKLOG(rc, PHashTableCreate(&hashArgs, L("srec.graph.wordmap.wordIDForWord.wordmap_create()"), &Interface->wordIDForWord));
625 char* tmp_chars = NEW_ARRAY(char, offset, L("srec.g2g.graph.wordmap.chars"));
637 tmp_words = (char**) CALLOC_CLR(wmap->num_base_words, sizeof(char*), "srec.graph.wordmap.words");
686 char* tmp_chars = NEW_ARRAY(char, tmp_max_chars, L("srec.g2g.graph.wordmap.chars"));
736 tmp_words = (char**) CALLOC_CLR(tmp_max_words, sizeof(char*), "srec.graph.wordmap.words")
[all...] |
| /external/webkit/WebCore/inspector/front-end/ |
| inspector.css | [all...] |
| /bionic/libc/regex/ |
| cclass.h | 52 { "graph", "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\
|
| /external/kernel-headers/original/linux/ |
| lockdep.h | 96 * These fields represent a directed graph of lock dependencies,
98 * "backward" graph nodes.
103 * Generation counter, when doing certain classes of graph walking,
170 * dependencies - the lock usage graph walking covers that area
|
| /external/opencore/ |
| README | 36 | processing units that can be connected in a flow graph]
|
| /external/oprofile/daemon/ |
| opd_sfile.h | 71 /** a call-graph entry */
|
