HomeSort by relevance Sort by last modified time
    Searched full:leaves (Results 1 - 25 of 1331) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/zopfli/src/zopfli/
katajainen.c 33 Nodes forming chains. Also used to represent leaves.
38 int count; /* Leaf symbol index, or number of leaves before this chain. */
98 leaves: The leaves, one per symbol.
99 numsymbols: Number of leaves.
106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) {
123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain);
126 if (lastcount < numsymbols && sum > leaves[lastcount].weight) {
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail,
134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0)
192 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); local
    [all...]
  /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/
t051treeRewriteASTtWalker.g 11 | INT // leaves it alone, returning $a.start
  /development/samples/browseable/Geofencing/
_index.jd 10 wearable with an option to check in. This notification automatically disappears when he/she leaves
  /prebuilts/go/darwin-x86/misc/cgo/test/
issue5227.go 6 // leaves them undefined.
  /prebuilts/go/linux-x86/misc/cgo/test/
issue5227.go 6 // leaves them undefined.
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
btDbvt.cpp 216 tNodeArray& leaves,
221 fetchleaves(pdbvt,root->childs[0],leaves,depth-1);
222 fetchleaves(pdbvt,root->childs[1],leaves,depth-1);
227 leaves.push_back(root);
232 static void split( const tNodeArray& leaves,
240 for(int i=0,ni=leaves.size();i<ni;++i)
242 if(btDot(axis,leaves[i]->volume.Center()-org)<0)
243 left.push_back(leaves[i]);
245 right.push_back(leaves[i]);
250 static btDbvtVolume bounds( const tNodeArray& leaves)
444 tNodeArray leaves; local
457 tNodeArray leaves; local
1064 btAlignedObjectArray<const btDbvtNode*> leaves; local
1086 btAlignedObjectArray<const btDbvtNode*> leaves; local
    [all...]
  /developers/build/prebuilts/gradle/RecipeAssistant/Application/src/main/assets/
northern-irish-vegetable-soup.json 17 summary: "This recipe is apparently unique to Northern Ireland and uses soup/herb celery which is hard to find outside the area, but regular table celery can be substituted (including the leaves).",
37 text: "field celery or 1 stalk celery, plus any leaves on the bunch"
beef-brisket-chili.json 24 text: "Place the bell peppers, roughly sliced, the bay leaves and chopped tomatoes in a large covered pot. Bring to the boil and then add the beef, onions and chillies. ",
35 text: "Remove the bay leaves and add the pulled beef and coriander back to the pot, together with the kidney beans."
70 text: "2 fresh bay leaves"
recipelist.json 12 summary: "This recipe is apparently unique to Northern Ireland and uses soup/herb celery which is hard to find outside the area, but regular table celery can be substituted (including the leaves).",
  /developers/samples/android/wearable/wear/RecipeAssistant/Application/src/main/assets/
northern-irish-vegetable-soup.json 17 summary: "This recipe is apparently unique to Northern Ireland and uses soup/herb celery which is hard to find outside the area, but regular table celery can be substituted (including the leaves).",
37 text: "field celery or 1 stalk celery, plus any leaves on the bunch"
beef-brisket-chili.json 24 text: "Place the bell peppers, roughly sliced, the bay leaves and chopped tomatoes in a large covered pot. Bring to the boil and then add the beef, onions and chillies. ",
35 text: "Remove the bay leaves and add the pulled beef and coriander back to the pot, together with the kidney beans."
70 text: "2 fresh bay leaves"
recipelist.json 12 summary: "This recipe is apparently unique to Northern Ireland and uses soup/herb celery which is hard to find outside the area, but regular table celery can be substituted (including the leaves).",
  /external/mesa3d/src/glsl/
ir_expression_flattening.h 28 * Takes the leaves of expression trees and makes them dereferences of
29 * assignments of the leaves to temporaries, according to a predicate.
  /external/v8/test/mjsunit/compiler/
expression-trees.js 31 // strings, return an array of all binary tree strings with the leaves
33 function makeTrees(op, leaves) {
34 var len = leaves.length;
37 return leaves;
41 // Split the leaves into left and right subtrees in all possible
44 var leftTrees = makeTrees(op, leaves.slice(0, i));
45 var rightTrees = makeTrees(op, leaves.slice(i, len));
58 // All possible bitwise OR trees with six leaves, i.e. CatalanNumber[5] = 42,
  /external/google-breakpad/src/client/windows/common/
auto_critical_section.h 37 // Automatically enters the critical section in the constructor and leaves
48 // Destructor: leaves the critical section.
62 // Leaves the critical section. The caller should not call Release() unless
  /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/
p6.cpp 31 // DR217 + DR205 (reading tea leaves)
  /external/compiler-rt/test/asan/TestCases/Posix/
large_allocator_unpoisons_on_free.cc 3 // The memory is released only when the deallocated chunk leaves the quarantine,
  /external/drm_gralloc/
gralloc_drm_formats.h 18 * Android graphics.h defines the formats and leaves 0x100 - 0x1FF
  /external/icu/android_icu4j/src/main/java/android/icu/text/
NullTransliterator.java 11 * A transliterator that leaves text unchanged.
  /external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/
NullTransliterator.java 10 * A transliterator that leaves text unchanged.
  /external/llvm/test/CodeGen/ARM/
peephole-bitcast.ll 8 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
  /external/llvm/test/Transforms/Inline/
crash-lifetime-marker.ll 3 ; InlineFunction would assert inside the loop that leaves lifetime markers if
  /external/skia/src/image/
SkReadPixelsRec.h 35 * On false, leaves self unchanged, but indicates that it does not overlap src, or
  /external/srtp/crypto/include/
crypto.h 19 * NULL_CIPHER is avaliable; this cipher leaves the data unchanged,
  /system/keymaster/
gtest_main.cpp 28 // Clean up stuff OpenSSL leaves around, so Valgrind doesn't complain.

Completed in 1429 milliseconds

1 2 3 4 5 6 7 8 91011>>