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

1 23 4 5 6 7 8 91011>>

  /external/zlib/src/msdos/
Makefile.tc 30 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
32 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
68 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
  /external/zlib/src/win32/
Makefile.bor 28 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
31 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
71 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
predict.def 89 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (85), 0)
95 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)", HITRATE (73), 0)
96 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)", HITRATE (72), 0)
97 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
103 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (61), 0)
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
predict.def 89 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (85), 0)
95 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)", HITRATE (73), 0)
96 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)", HITRATE (72), 0)
97 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
103 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (61), 0)
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
predict.def 89 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (85), 0)
95 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)", HITRATE (73), 0)
96 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)", HITRATE (72), 0)
97 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
103 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (61), 0)
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
predict.def 89 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (85), 0)
95 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)", HITRATE (73), 0)
96 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)", HITRATE (72), 0)
97 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
103 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (61), 0)
  /external/chromium_org/cc/layers/
nine_patch_layer_unittest.cc 15 #include "cc/trees/layer_tree_host.h"
16 #include "cc/trees/occlusion_tracker.h"
17 #include "cc/trees/single_thread_proxy.h"
heads_up_display_layer.cc 11 #include "cc/trees/layer_tree_host.h"
  /external/svox/pico/lib/
picopam.h 39 * - Feeding Decision Trees with the symbolic seqence vector set
40 * - Colecting the parametric output of the Decision trees into suitable items to be sent to following PU's
46 * - While feeding the decision trees the data structure is used to represent data for phonemes of the syllable
  /external/zlib/src/amiga/
Makefile.pup 18 uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
67 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
Makefile.sas 17 uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
66 trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
  /external/chromium_org/cc/trees/
layer_tree_host_unittest_picture.cc 5 #include "cc/trees/layer_tree_host.h"
11 #include "cc/trees/layer_tree_impl.h"
quad_culler.cc 5 #include "cc/trees/quad_culler.h"
13 #include "cc/trees/occlusion_tracker.h"
  /external/chromium_org/third_party/WebKit/Source/bindings/v8/
RetainedDOMInfo.cpp 71 return m_root->inDocument() ? "(Document DOM trees)" : "(Detached DOM trees)";
  /external/chromium_org/third_party/bintrees/bintrees/
avltree.py 12 # AVL trees are about as close to optimal as balanced binary search trees can
14 # performance of binary search trees is guaranteed with AVL trees, but the extra
21 # AVL trees are best used when degenerate sequences are common, and there is
25 # black trees or Andersson trees are a better solution. If there is a significant
27 # items, a splay tree is theoretically better than all of the balanced trees
  /external/chromium_org/third_party/sqlite/src/test/
in2.test 55 # This bug only applied to b-trees generated to evaluate IN (..)
56 # clauses, as it is impossible for persistent b-trees (SQL tables +
  /external/chromium_org/third_party/zlib/
zlib.gyp 31 'trees.c',
32 'trees.h',
  /external/clang/include/clang/Rewrite/Core/
DeltaTree.h 22 /// features. B-Trees are generally more memory and cache efficient than
23 /// binary trees, because they store multiple keys/values in each node. This
  /external/guava/guava/src/com/google/common/collect/
BstMutationRule.java 28 * @param <K> The key type of the nodes in binary search trees that this rule can modify.
29 * @param <N> The type of the nodes in binary search trees that this rule can modify.
  /external/llvm/utils/
sort_includes.py 17 # Skip files which are under INPUTS trees or test trees.
  /external/zlib/src/
INDEX 58 trees.c
59 trees.h
  /external/zlib/src/old/
descrip.mms 12 deflate.obj, trees.obj, zutil.obj, inflate.obj, infblock.obj,\
46 trees.obj : deflate.h zutil.h zlib.h zconf.h
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
ITree.cs 38 * such as CommonTreeNodeStream that work on these kinds of trees. You
39 * don't have to make your trees implement this interface, but if you do,
44 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
45 * even use Token objects as trees if you add a child list to your tokens.
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
ITree.cs 39 * such as CommonTreeNodeStream that work on these kinds of trees. You
40 * don't have to make your trees implement this interface, but if you do,
45 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
46 * even use Token objects as trees if you add a child list to your tokens.
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
Tree.java 35 * such as CommonTreeNodeStream that work on these kinds of trees. You
36 * don't have to make your trees implement this interface, but if you do,
39 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
40 * even use Token objects as trees if you add a child list to your tokens.

Completed in 1163 milliseconds

1 23 4 5 6 7 8 91011>>