| /external/v8/test/mjsunit/ |
| deep-recursion.js | 29 * @fileoverview Check that flattening deep trees of cons strings does not
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| text_format.cc | 103 // Remove any nested information trees, as they are owned by this tree.
119 vector<TextFormat::ParseInfoTree*>* trees = &nested_[field]; local
120 GOOGLE_CHECK(trees);
121 trees->push_back(instance);
156 const vector<TextFormat::ParseInfoTree*>* trees = FindOrNull(nested_, field); local
157 if (trees == NULL || index >= trees->size()) {
161 return (*trees)[index];
[all...] |
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| simple-bailouts.js | 40 // trees with <= 4 leaves.
|
| expression-trees.js | 58 // All 429 possible bitwise OR trees with eight leaves.
|
| /external/v8/test/mjsunit/compiler/ |
| simple-bailouts.js | 40 // trees with <= 4 leaves.
|
| expression-trees.js | 58 // All 429 possible bitwise OR trees with eight leaves.
|
| /prebuilts/sdk/tools/lib/ |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/lombok-ast/ |
| lombok-ast-0.2.1.jar | |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/m2/repository/com/android/tools/external/lombok/lombok-ast/0.2.1/ |
| lombok-ast-0.2.1.jar | |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| rbtree.py | 12 # Red black trees are interesting beasts. They're believed to be simpler than
13 # AVL trees (their direct competitor), and at first glance this seems to be the
15 # deletion algorithm, red black trees become very tricky. However, the
18 # case with AVL trees, where only the insertion algorithm can be written top-down.
22 # found that red black trees are best suited to largely random data that has
24 # takes full advantage of the minimal work that red black trees perform to
25 # maintain balance compared to AVL trees and still allows for speedy searches.
27 # Red black trees are popular, as most data structures with a whimsical name.
29 # implemented with a red black tree. Red black trees are also comparable in
30 # speed to AVL trees. While the balance is not quite as good, the work it take
[all...] |
| /external/zlib/src/ |
| make_vms.com | 203 $ CALL MAKE trees.OBJ "CC ''CCOPT' trees" -
204 trees.c deflate.h zutil.h zlib.h zconf.h
431 deflate.obj, trees.obj, zutil.obj, inflate.obj, \
469 trees.obj : trees.c deflate.h zutil.h zlib.h zconf.h
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| socketpoolwrapper.js | 29 * parent, and groups of nodes from trees with root nodes with the same id are
|
| /external/chromium_org/third_party/zlib/ |
| zlib.target.darwin-arm.mk | 37 third_party/zlib/trees.c \
|
| zlib.target.darwin-mips.mk | 37 third_party/zlib/trees.c \
|
| zlib.target.darwin-x86.mk | 37 third_party/zlib/trees.c \
|
| zlib.target.linux-arm.mk | 37 third_party/zlib/trees.c \
|
| zlib.target.linux-mips.mk | 37 third_party/zlib/trees.c \
|
| zlib.target.linux-x86.mk | 37 third_party/zlib/trees.c \
|
| /external/chromium_org/tools/checkdeps/ |
| checkdeps.py | 66 subtractions for their own sub-trees.
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 51 /// How to create and navigate trees. Rather than have a separate factory
67 /// Create a tree node from Token object; for CommonTree type trees,
169 /// for non-flat trees.
171 /// Flat trees such as for lists like "idlist : ID+ ;" are left alone
181 /// For identifying trees. How to identify nodes so we can say "add node
268 /// method right before returning. Flat trees (i.e., lists) will
372 // REWRITING TREES (used by tree parser)
412 /// What adaptor can tell me how to interpret/navigate nodes and trees.
429 /// such as CommonTreeNodeStream that work on these kinds of trees. You
430 /// don't have to make your trees implement this interface, but if you do
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 72 Trees (ASTs), tree structures that reflect the high-level syntactic and semantic
90 (instead of basic tokens), and adds some helper methods for working with trees.
192 = ANTLR Abstract Syntax Trees
195 wraps a token, a list of child trees, and some information about the collective
200 tree nodes as well as the methods trees need to implement.
463 application, building trees with all of this extra information may be
468 the customized lighter-weight trees.
669 trees. Using an adaptor object permits a single recognizer to work with any
671 on customized tree structures. For example, if you want to represent trees using
[all...] |
| /external/zlib/src/contrib/pascal/ |
| zlibpas.pas | 184 {$L trees.obj}
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.preferences_3.3.0.v20100503.jar | |
| /cts/suite/pts/deviceTests/browserbench/assets/octane/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
288 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
