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

<<11121314151617181920>>

  /prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.6/bin/
mipsel-linux-android-gcc 
mipsel-linux-android-gcc-4.6 
  /prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.6/mipsel-linux-android/bin/
gcc 
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
CommonTreeNodeStream.as 64 * Object as we don't what the trees look like.
78 /** What tree adaptor was used to build these trees */
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BufferedTreeNodeStream.cs 122 * Object as we don't what the trees look like.</summary>
136 /** <summary>What tree adaptor was used to build these trees</summary> */
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BufferedTreeNodeStream.cs 131 * Object as we don't what the trees look like.</summary>
145 /** <summary>What tree adaptor was used to build these trees</summary> */
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
BufferedTreeNodeStream.java 91 * Object as we don't what the trees look like.
105 /** What tree adaptor was used to build these trees */
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
SAX2RTFDTM.java 39 * 1) Multiple XML trees may be appended to the single DTM. This means
46 * most recently added trees off the end of the DTM as stylesheet elements
  /external/blktrace/doc/
btt.1 39 [ \-P <\fIoutput name\fR> | \-\-per\-io\-trees=<\fIoutput name\fR> ]
227 .B \-\-per\-io\-trees=<\fIoutput name\fR>
  /external/ceres-solver/internal/ceres/
graph_algorithms.h 260 // a any spanning trees of degree less than n-1.Even if such a tree
348 // smaller index. This should ensure shallower trees, for quicker
  /external/chromium_org/cc/layers/
layer_impl_unittest.cc 13 #include "cc/trees/layer_tree_impl.h"
14 #include "cc/trees/single_thread_proxy.h"
  /external/chromium_org/cc/test/
layer_tree_test.cc 23 #include "cc/trees/layer_tree_host_impl.h"
24 #include "cc/trees/single_thread_proxy.h"
  /external/chromium_org/cc/trees/
layer_sorter_unittest.cc 5 #include "cc/trees/layer_sorter.h"
11 #include "cc/trees/single_thread_proxy.h"
layer_tree_host_unittest_animation.cc 5 #include "cc/trees/layer_tree_host.h"
16 #include "cc/trees/layer_tree_impl.h"
  /external/chromium_org/third_party/WebKit/PerformanceTests/DOM/resources/
dom-perf.js 299 // generate width trees, of increasing depth, from 1 to width. Then we recurse
301 // allows us to duplicate a set of trees, without additional recursions.
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
JSHeapSnapshot.js 242 if (node.name() === "(Detached DOM trees)") {
452 return this.isSynthetic() && this.name() === "(Document DOM trees)";
  /external/chromium_org/third_party/sqlite/src/test/
fts3matchinfo.test 65 INSERT INTO t3(mtchinfo) VALUES('Beside the lake, beneath the trees');
67 } {{Beside the lake, beneath the trees}}
fuzz.test 17 # SQL parse-trees. The majority of the fuzzily generated SQL is
20 # The most complicated trees are for SELECT statements.
  /external/libpng/projects/visualc71/
zlib.vcproj 382 RelativePath="..\..\..\zlib\trees.c">
440 RelativePath="..\..\..\zlib\trees.h">
  /external/llvm/include/llvm/ADT/
ImmutableSet.h 134 /// isEqual - Compares two trees for structural equality and returns true
136 // linear in the sizes of the trees.
161 /// isNotEqual - Compares two trees for structural inequality. Performance
255 /// the tree is truly immutable. Trees returned from an ImutAVLFactory
420 // about the properties of trees and their children.
455 // to other trees. The functon may also simply move links
616 // if find a collision compare those trees by their contents.
629 // Trees did match! Return 'T'.
    [all...]
  /external/valgrind/main/coregrind/m_initimg/
simple_huffman.c 30 * possible to find locally optimal Huffman trees, which in turn could
32 * - Allow for a few different predefined Huffman trees, which could
  /libcore/luni/src/main/java/javax/xml/parsers/
DocumentBuilderFactory.java 27 * parser that produces DOM object trees from XML documents.
408 * modified DOM trees.
  /external/antlr/antlr-3.4/tool/
CHANGES.txt 122 * trees know where they came from now start..stop tokens; todo: use for better err handling.
418 * Added CommonTree.setUnknownTokenBoundaries(). Sometimes we build trees
490 is generated to support filtering of trees.
692 * rewrite=true, output=AST for tree grammar was not working. Altered trees were not
700 out how to work with trees and actions. Figure that out and so I turned it back on.
710 * ANTLR no longer tries to recover in tree parsers inline using single node deletion or insertion; throw exception. Trees should be well formed as they are not created by users.
840 * made fillBuffer public in CommonTreeNodeStream so we can add trees
846 no matter what to rewrite trees in tree grammars. added unit test
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DebugEventHub.cs 38 * use the event mechanism to build parse trees etc... Not thread-safe.
DebugTreeAdaptor.cs 45 * Trees created with actions in rewrite actions like "-&gt; ^(ADD {foo} {bar})"

Completed in 593 milliseconds

<<11121314151617181920>>