@NoOffset @Properties(inherit=BulletCollision.class) public class btQuantizedBvhTree extends Pointer
Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator, Pointer.ReferenceCounter| Constructor and Description |
|---|
btQuantizedBvhTree() |
btQuantizedBvhTree(long size)
Native array allocator.
|
btQuantizedBvhTree(Pointer p)
Pointer cast constructor.
|
| Modifier and Type | Method and Description |
|---|---|
void |
build_tree(GIM_BVH_DATA_ARRAY primitive_boxes)
prototype functions for box tree management
\{
|
void |
clearNodes() |
BT_QUANTIZED_BVH_NODE |
get_node_pointer() |
BT_QUANTIZED_BVH_NODE |
get_node_pointer(int index) |
int |
getEscapeNodeIndex(int nodeindex) |
int |
getLeftNode(int nodeindex) |
int |
getNodeCount()
node count
|
int |
getNodeData(int nodeindex) |
btQuantizedBvhTree |
getPointer(long i) |
int |
getRightNode(int nodeindex) |
boolean |
isLeafNode(int nodeindex)
tells if the node is a leaf
|
btQuantizedBvhTree |
position(long position) |
void |
quantizePoint(short[] quantizedpoint,
btVector3 point) |
void |
quantizePoint(ShortBuffer quantizedpoint,
btVector3 point) |
void |
quantizePoint(ShortPointer quantizedpoint,
btVector3 point) |
boolean |
testQuantizedBoxOverlapp(int node_index,
short[] quantizedMin,
short[] quantizedMax) |
boolean |
testQuantizedBoxOverlapp(int node_index,
ShortBuffer quantizedMin,
ShortBuffer quantizedMax) |
boolean |
testQuantizedBoxOverlapp(int node_index,
ShortPointer quantizedMin,
ShortPointer quantizedMax) |
address, asBuffer, asByteBuffer, availablePhysicalBytes, calloc, capacity, capacity, close, deallocate, deallocate, deallocateReferences, deallocator, deallocator, equals, fill, formatBytes, free, getDirectBufferAddress, getPointer, getPointer, getPointer, hashCode, interruptDeallocatorThread, isNull, isNull, limit, limit, malloc, maxBytes, maxPhysicalBytes, memchr, memcmp, memcpy, memmove, memset, offsetAddress, offsetof, offsetof, parseBytes, physicalBytes, physicalBytesInaccurate, position, put, realloc, referenceCount, releaseReference, retainReference, setNull, sizeof, sizeof, toString, totalBytes, totalCount, totalPhysicalBytes, withDeallocator, zeropublic btQuantizedBvhTree(Pointer p)
Pointer(Pointer).public btQuantizedBvhTree(long size)
Pointer.position(long).public btQuantizedBvhTree()
public btQuantizedBvhTree position(long position)
public btQuantizedBvhTree getPointer(long i)
getPointer in class Pointerpublic void build_tree(@ByRef GIM_BVH_DATA_ARRAY primitive_boxes)
public void quantizePoint(@Cast(value="unsigned short*") ShortPointer quantizedpoint, @Const @ByRef btVector3 point)
public void quantizePoint(@Cast(value="unsigned short*") ShortBuffer quantizedpoint, @Const @ByRef btVector3 point)
public void quantizePoint(@Cast(value="unsigned short*") short[] quantizedpoint, @Const @ByRef btVector3 point)
@Cast(value="bool") public boolean testQuantizedBoxOverlapp(int node_index, @Cast(value="unsigned short*") ShortPointer quantizedMin, @Cast(value="unsigned short*") ShortPointer quantizedMax)
@Cast(value="bool") public boolean testQuantizedBoxOverlapp(int node_index, @Cast(value="unsigned short*") ShortBuffer quantizedMin, @Cast(value="unsigned short*") ShortBuffer quantizedMax)
@Cast(value="bool") public boolean testQuantizedBoxOverlapp(int node_index, @Cast(value="unsigned short*") short[] quantizedMin, @Cast(value="unsigned short*") short[] quantizedMax)
public void clearNodes()
public int getNodeCount()
public int getNodeData(int nodeindex)
public int getLeftNode(int nodeindex)
public int getRightNode(int nodeindex)
public int getEscapeNodeIndex(int nodeindex)
@Const public BT_QUANTIZED_BVH_NODE get_node_pointer(int index)
@Const public BT_QUANTIZED_BVH_NODE get_node_pointer()
Copyright © 2024. All rights reserved.