@NoOffset @Properties(inherit=BulletCollision.class) public class btDbvt extends Pointer
| Modifier and Type | Class and Description |
|---|---|
static class |
btDbvt.IClone |
static class |
btDbvt.ICollide |
static class |
btDbvt.IWriter |
static class |
btDbvt.sStkCLN |
static class |
btDbvt.sStkNN |
static class |
btDbvt.sStknNN |
static class |
btDbvt.sStkNP |
static class |
btDbvt.sStkNPS |
Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator, Pointer.ReferenceCounter| Modifier and Type | Field and Description |
|---|---|
static int |
DOUBLE_STACKSIZE
enum btDbvt::
|
static int |
SIMPLE_STACKSIZE
enum btDbvt::
|
| Constructor and Description |
|---|
btDbvt() |
btDbvt(long size)
Native array allocator.
|
btDbvt(Pointer p)
Pointer cast constructor.
|
| Modifier and Type | Method and Description |
|---|---|
static int |
_allocate(btIntArray ifree,
btDbvtStkNPSArray stock,
btDbvt.sStkNPS value) |
static void |
benchmark() |
void |
clear() |
void |
clone(btDbvt dest) |
void |
clone(btDbvt dest,
btDbvt.IClone iclone) |
static int |
countLeaves(btDbvtNode node) |
boolean |
empty() |
btDbvt |
getPointer(long i) |
btDbvtNode |
insert(btDbvtAabbMm box,
Pointer data) |
btDbvtNode |
m_free() |
btDbvt |
m_free(btDbvtNode setter) |
int |
m_leaves() |
btDbvt |
m_leaves(int setter) |
int |
m_lkhd() |
btDbvt |
m_lkhd(int setter) |
int |
m_opath() |
btDbvt |
m_opath(int setter) |
btDbvtNode |
m_root() |
btDbvt |
m_root(btDbvtNode setter) |
btDbvtStkNNArray |
m_stkStack() |
btDbvt |
m_stkStack(btDbvtStkNNArray setter) |
static int |
maxdepth(btDbvtNode node) |
static int |
nearest(int[] i,
btDbvt.sStkNPS a,
double v,
int l,
int h) |
static int |
nearest(IntBuffer i,
btDbvt.sStkNPS a,
double v,
int l,
int h) |
static int |
nearest(IntPointer i,
btDbvt.sStkNPS a,
double v,
int l,
int h)
rayTestInternal is faster than rayTest, because it uses a persistent stack (to reduce dynamic memory allocations to a minimum) and it uses precomputed signs/rayInverseDirections
rayTestInternal is used by btDbvtBroadphase to accelerate world ray casts
|
void |
optimizeBottomUp() |
void |
optimizeIncremental(int passes) |
void |
optimizeTopDown() |
void |
optimizeTopDown(int bu_treshold) |
btDbvt |
position(long position) |
void |
remove(btDbvtNode leaf) |
void |
update(btDbvtNode leaf) |
void |
update(btDbvtNode leaf,
btDbvtAabbMm volume) |
boolean |
update(btDbvtNode leaf,
btDbvtAabbMm volume,
btVector3 velocity) |
boolean |
update(btDbvtNode leaf,
btDbvtAabbMm volume,
btVector3 velocity,
double margin) |
boolean |
update(btDbvtNode leaf,
btDbvtAabbMm volume,
double margin) |
void |
update(btDbvtNode leaf,
int lookahead) |
void |
write(btDbvt.IWriter iwriter) |
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 static final int SIMPLE_STACKSIZE
public static final int DOUBLE_STACKSIZE
public btDbvt(Pointer p)
Pointer(Pointer).public btDbvt(long size)
Pointer.position(long).public btDbvt()
public btDbvt getPointer(long i)
getPointer in class Pointerpublic btDbvtNode m_root()
public btDbvt m_root(btDbvtNode setter)
public btDbvtNode m_free()
public btDbvt m_free(btDbvtNode setter)
public int m_lkhd()
public btDbvt m_lkhd(int setter)
public int m_leaves()
public btDbvt m_leaves(int setter)
public btDbvt m_opath(int setter)
@ByRef public btDbvtStkNNArray m_stkStack()
public btDbvt m_stkStack(btDbvtStkNNArray setter)
public void clear()
public void optimizeBottomUp()
public void optimizeTopDown(int bu_treshold)
public void optimizeTopDown()
public void optimizeIncremental(int passes)
public btDbvtNode insert(@Cast(value="const btDbvtVolume*") @ByRef btDbvtAabbMm box, Pointer data)
public void update(btDbvtNode leaf, int lookahead)
public void update(btDbvtNode leaf)
public void update(btDbvtNode leaf, @Cast(value="btDbvtVolume*") @ByRef btDbvtAabbMm volume)
@Cast(value="bool") public boolean update(btDbvtNode leaf, @Cast(value="btDbvtVolume*") @ByRef btDbvtAabbMm volume, @Const @ByRef btVector3 velocity, @Cast(value="btScalar") double margin)
@Cast(value="bool") public boolean update(btDbvtNode leaf, @Cast(value="btDbvtVolume*") @ByRef btDbvtAabbMm volume, @Const @ByRef btVector3 velocity)
@Cast(value="bool") public boolean update(btDbvtNode leaf, @Cast(value="btDbvtVolume*") @ByRef btDbvtAabbMm volume, @Cast(value="btScalar") double margin)
public void remove(btDbvtNode leaf)
public void write(btDbvt.IWriter iwriter)
public void clone(@ByRef btDbvt dest, btDbvt.IClone iclone)
public static int maxdepth(@Const btDbvtNode node)
public static int countLeaves(@Const btDbvtNode node)
public static void benchmark()
public static int nearest(@Const IntPointer i, @Const btDbvt.sStkNPS a, @Cast(value="btScalar") double v, int l, int h)
public static int nearest(@Const IntBuffer i, @Const btDbvt.sStkNPS a, @Cast(value="btScalar") double v, int l, int h)
public static int nearest(@Const int[] i, @Const btDbvt.sStkNPS a, @Cast(value="btScalar") double v, int l, int h)
@Name(value="allocate") public static int _allocate(@ByRef btIntArray ifree, @ByRef btDbvtStkNPSArray stock, @Const @ByRef btDbvt.sStkNPS value)
Copyright © 2024. All rights reserved.