Searched refs:freeNode (Results 1 - 4 of 4) sorted by relevance

/external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/texturepacker/
H A DMaxRectsPacker.java646 private boolean splitFreeNode (Rect freeNode, Rect usedNode) { argument
648 if (usedNode.x >= freeNode.x + freeNode.width || usedNode.x + usedNode.width <= freeNode.x
649 || usedNode.y >= freeNode.y + freeNode.height || usedNode.y + usedNode.height <= freeNode.y) return false;
651 if (usedNode.x < freeNode.x + freeNode.width && usedNode.x + usedNode.width > freeNode
[all...]
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
H A DDynamicTree.java103 freeNode(node);
331 DynamicTreeNode freeNode = m_freeList != NULL_NODE ? m_nodes[m_freeList] : null;
332 while (freeNode != null) {
333 assert (0 <= freeNode.id && freeNode.id < m_nodeCapacity);
334 assert (freeNode == m_nodes[freeNode.id]);
335 freeNode = freeNode.parent;
415 freeNode(nod
496 private final void freeNode(DynamicTreeNode node) { method in class:DynamicTree
[all...]
H A DDynamicTreeFlatNodes.java109 freeNode(proxyId);
334 int freeNode = m_freeList;
335 while (freeNode != NULL_NODE) {
336 assert (0 <= freeNode && freeNode < m_nodeCapacity);
337 freeNode = m_parent[freeNode];
414 // freeNode(node);
481 private final void freeNode(int node) { method in class:DynamicTreeFlatNodes
630 freeNode(paren
[all...]
/external/skia/src/core/
H A DSkTLList.h281 Node* freeNode = iter.init(fFreeList, Iter::kHead_IterStart); local
282 while (freeNode) {
283 SkASSERT(fFreeList.isInList(freeNode));
284 Block* block = freeNode->fBlock;
298 freeNode = iter.next();

Completed in 1810 milliseconds