HomeSort by relevance Sort by last modified time
    Searched full:trees (Results 126 - 150 of 1000) sorted by null

1 2 3 4 56 7 8 91011>>

  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
splay-tree.h 23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
125 /* Free function for nodes and trees. Takes allocate_data as a parameter. */
tree-inline.h 45 source function providing the original trees. */
49 the destination function receiving the new trees. */
106 /* True if trees should not be unshared. */
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
splay-tree.h 23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
125 /* Free function for nodes and trees. Takes allocate_data as a parameter. */
tree-inline.h 45 source function providing the original trees. */
49 the destination function receiving the new trees. */
106 /* True if trees should not be unshared. */
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
splay-tree.h 23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
125 /* Free function for nodes and trees. Takes allocate_data as a parameter. */
tree-inline.h 45 source function providing the original trees. */
49 the destination function receiving the new trees. */
106 /* True if trees should not be unshared. */
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/
ITreeAdaptor`1.cs 40 * Create a tree node from Token object; for CommonTree type trees,
138 * for non-flat trees.
142 * Flat trees such as for lists like "idlist : ID+ ;" are left alone
152 /** <summary>For identifying trees.</summary>
252 * method right before returning. Flat trees (i.e., lists) will
  /external/chromium_org/third_party/bintrees/
README.txt 7 This package provides Binary- RedBlack- and AVL-Trees written in Python and Cython.
17 Trees written in Python (only standard library)
24 Trees written with C-Functions and Cython as wrapper
31 All trees provides the same API, the pickle protocol is supported.
133 * intersection(t1, t2, ...) -> Tree with keys *common* to all trees
134 * union(t1, t2, ...) -> Tree with keys from *either* trees
152 unbalanced Trees CPython 2.7.2 FastBinaryTree ipy 2.7.0 pypy 1.7.0
  /external/srec/seti/sltsEngine/src/
run_seq_lts.c 76 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters, LQUESTION **questions, int num_questions, LM *lm);
504 RT_LTREE ** trees = NULL; local
538 *ptrees = trees = (RT_LTREE**) lts_alloc(*num_letters, sizeof(RT_LTREE*));
539 if (trees == NULL) {
547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE));
603 free_trees(trees, *num_letters, *pquestions, *num_questions, *plm);
613 /* deallocate trees */
614 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters,
628 if (trees) {
630 if (trees[i])
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
TreeAdaptor.as 32 /** How to create and navigate trees. Rather than have a separate factory
44 /** Create a tree node from Token object; for CommonTree type trees,
126 * for non-flat trees.
128 * Flat trees such as for lists like "idlist : ID+ ;" are left alone
137 /** For identifying trees.
191 * method right before returning. Flat trees (i.e., lists) will
RewriteRuleElementStream.as 164 /** When constructing trees, sometimes we need to dup a token or AST
166 * around it. For trees, you must call the adaptor.dupTree() unless
173 /** Ensure stream emits trees; tokens must be converted to AST nodes.
TreeRuleReturnScope.as 34 * when you are parsing trees. To be generic the tree node types
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
ITreeAdaptor.cs 36 * How to create and navigate trees. Rather than have a separate factory
52 * Create a tree node from Token object; for CommonTree type trees,
150 * for non-flat trees.
154 * Flat trees such as for lists like "idlist : ID+ ;" are left alone
164 /** <summary>For identifying trees.</summary>
264 * method right before returning. Flat trees (i.e., lists) will
RewriteRuleElementStream.cs 187 * When constructing trees, sometimes we need to dup a token or AST
189 * around it. For trees, you must call the adaptor.dupTree() unless
196 * Ensure stream emits trees; tokens must be converted to AST nodes.
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
ITreeAdaptor.cs 37 * How to create and navigate trees. Rather than have a separate factory
54 * Create a tree node from Token object; for CommonTree type trees,
206 * for non-flat trees.
210 * Flat trees such as for lists like "idlist : ID+ ;" are left alone
220 /** <summary>For identifying trees.</summary>
284 * method right before returning. Flat trees (i.e., lists) will
RewriteRuleElementStream.cs 204 * When constructing trees, sometimes we need to dup a token or AST
206 * around it. For trees, you must call the adaptor.dupTree() unless
213 * Ensure stream emits trees; tokens must be converted to AST nodes.
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeAdaptor.java 34 /** How to create and navigate trees. Rather than have a separate factory
46 /** Create a tree node from Token object; for CommonTree type trees,
128 * for non-flat trees.
130 * Flat trees such as for lists like "idlist : ID+ ;" are left alone
139 /** For identifying trees.
214 * method right before returning. Flat trees (i.e., lists) will
RewriteRuleElementStream.java 177 /** When constructing trees, sometimes we need to dup a token or AST
179 * around it. For trees, you must call the adaptor.dupTree() unless
184 /** Ensure stream emits trees; tokens must be converted to AST nodes.
  /external/zlib/src/
Makefile.in 57 OBJZ = adler32.o crc32.o deflate.o infback.o inffast.o inflate.o inftrees.o trees.o zutil.o
61 PIC_OBJZ = adler32.lo crc32.lo deflate.lo infback.lo inffast.lo inflate.lo inftrees.lo trees.lo zutil.lo
278 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
288 trees.lo: deflate.h zutil.h zlib.h zconf.h trees.h
  /external/chromium_org/third_party/WebKit/PerformanceTests/DOM/resources/dom-perf/
getelement.js 31 // Tests looking for ids in different DOM trees full of div elements.
104 // We use four of the trees for the dups style,
105 // so they get too big if you use the full size for the bigger trees
  /external/chromium_org/third_party/skia/src/core/
SkRTree.h 22 * splitting nodes when they become overfull. Unlike B-trees, however, we're using spatial data; so
41 * quicker than individual insertions and produces more consistent trees.
162 * seems to generally produce better, more consistent trees at significantly lower cost than
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.h 498 /// Trees - The list of pattern trees which corresponds to this pattern.
501 std::vector<TreePatternNode*> Trees;
503 /// NamedNodes - This is all of the nodes that have names in the trees in this
539 const std::vector<TreePatternNode*> &getTrees() const { return Trees; }
540 unsigned getNumTrees() const { return Trees.size(); }
541 TreePatternNode *getTree(unsigned i) const { return Trees[i]; }
543 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!");
544 return Trees[0];
571 for (unsigned i = 0, e = Trees.size(); i != e; ++i
    [all...]
  /external/skia/src/core/
SkRTree.h 22 * splitting nodes when they become overfull. Unlike B-trees, however, we're using spatial data; so
41 * quicker than individual insertions and produces more consistent trees.
162 * seems to generally produce better, more consistent trees at significantly lower cost than
  /external/zlib/src/old/os2/
Makefile.os2 45 OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
134 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
  /external/zlib/src/win32/
Makefile.gcc 71 gzwrite.o infback.o inffast.o inflate.o inftrees.o trees.o uncompr.o zutil.o
180 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h

Completed in 4583 milliseconds

1 2 3 4 56 7 8 91011>>