private final int allocateNode() { if (m_freeList == NULL_NODE) { assert (m_nodeCount == m_nodeCapacity); m_nodeCapacity *= 2; expandBuffers(m_nodeCount, m_nodeCapacity); } assert (m_freeList != NULL_NODE); int node = m_freeList; m_freeList = m_parent[node]; m_parent[node] = NULL_NODE; m_child1[node] = NULL_NODE; m_height[node] = 0; ++m_nodeCount; return node; }
public DynamicTreeFlatNodes() { m_root = NULL_NODE; m_nodeCount = 0; m_nodeCapacity = 16; expandBuffers(0, m_nodeCapacity); for (int i = 0; i < drawVecs.length; i++) { drawVecs[i] = new Vec2(); } }
private final int allocateNode() { if (m_freeList == NULL_NODE) { assert (m_nodeCount == m_nodeCapacity); m_nodeCapacity *= 2; expandBuffers(m_nodeCount, m_nodeCapacity); } assert (m_freeList != NULL_NODE); int node = m_freeList; m_freeList = m_parent[node]; m_parent[node] = NULL_NODE; m_child1[node] = NULL_NODE; m_height[node] = 0; ++m_nodeCount; return node; }
public DynamicTreeFlatNodes() { m_root = NULL_NODE; m_nodeCount = 0; m_nodeCapacity = 16; expandBuffers(0, m_nodeCapacity); for (int i = 0; i < drawVecs.length; i++) { drawVecs[i] = new Vec2(); } }
private final int allocateNode() { if (m_freeList == NULL_NODE) { assert (m_nodeCount == m_nodeCapacity); m_nodeCapacity *= 2; expandBuffers(m_nodeCount, m_nodeCapacity); } assert (m_freeList != NULL_NODE); int node = m_freeList; m_freeList = m_parent[node]; m_parent[node] = NULL_NODE; m_child1[node] = NULL_NODE; m_height[node] = 0; ++m_nodeCount; return node; }
private final int allocateNode() { if (m_freeList == NULL_NODE) { assert (m_nodeCount == m_nodeCapacity); m_nodeCapacity *= 2; expandBuffers(m_nodeCount, m_nodeCapacity); } assert (m_freeList != NULL_NODE); int node = m_freeList; m_freeList = m_parent[node]; m_parent[node] = NULL_NODE; m_child1[node] = NULL_NODE; m_height[node] = 0; ++m_nodeCount; return node; }
public DynamicTreeFlatNodes() { m_root = NULL_NODE; m_nodeCount = 0; m_nodeCapacity = 16; expandBuffers(0, m_nodeCapacity); for (int i = 0; i < drawVecs.length; i++) { drawVecs[i] = new Vec2(); } }
public DynamicTreeFlatNodes() { m_root = NULL_NODE; m_nodeCount = 0; m_nodeCapacity = 16; expandBuffers(0, m_nodeCapacity); for (int i = 0; i < drawVecs.length; i++) { drawVecs[i] = new Vec2(); } }