Home
last modified time | relevance | path

Searched defs:leaves (Results 1 – 5 of 5) sorted by relevance

/external/zopfli/src/zopfli/
Dkatajainen.c106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) { in BoundaryPM()
146 NodePool* pool, const Node* leaves, int maxbits, Node* (*lists)[2]) { in InitLists()
163 static void ExtractBitLengths(Node* chain, Node* leaves, unsigned* bitlengths) { in ExtractBitLengths()
192 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
/external/v8/test/mjsunit/compiler/
Dexpression-trees.js33 function makeTrees(op, leaves) { argument
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
DbtDbvt.cpp216 tNodeArray& leaves, in fetchleaves()
232 static void split( const tNodeArray& leaves, in split()
250 static btDbvtVolume bounds( const tNodeArray& leaves) in bounds()
269 tNodeArray& leaves) in bottomup()
302 tNodeArray& leaves, in topdown()
444 tNodeArray leaves; in optimizeBottomUp() local
457 tNodeArray leaves; in optimizeTopDown() local
638 void btDbvt::extractLeaves(const btDbvtNode* node,btAlignedObjectArray<const btDbvtNode*>& leaves) in extractLeaves()
1064 btAlignedObjectArray<const btDbvtNode*> leaves; in benchmark() local
1086 btAlignedObjectArray<const btDbvtNode*> leaves; in benchmark() local
/external/junit/src/org/junit/experimental/max/
DMaxCore.java102 private Request constructLeafRequest(List<Description> leaves) { in constructLeafRequest()
/external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/
DbtDbvt.java585 …ic static void extractLeaves(btDbvtNode node, SWIGTYPE_p_btAlignedObjectArrayT_btDbvtNode_const_p_… in extractLeaves()