org.bytedeco.bullet.BulletCollision

Class GIM_BVH_TREE_NODE_Array_

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.BulletCollision.GIM_BVH_TREE_NODE_Array_

All Implemented Interfaces:

AutoCloseable

Direct Known Subclasses:

GIM_BVH_TREE_NODE_ARRAY

@Name(value="btAlignedObjectArray<GIM_BVH_TREE_NODE>")
 @NoOffset
 @Properties(inherit=BulletCollision.class)
public class GIM_BVH_TREE_NODE_Array_
extends Pointer

Nested Class Summary

Nested classes/interfaces inherited from class org.bytedeco.javacpp.Pointer

Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator, Pointer.ReferenceCounter

Field Summary

Fields inherited from class org.bytedeco.javacpp.Pointer

address, capacity, limit, position

Constructor Summary

Constructors

Constructor and Description
GIM_BVH_TREE_NODE_Array_()
GIM_BVH_TREE_NODE_Array_(GIM_BVH_TREE_NODE_Array_ otherArray) Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead.
GIM_BVH_TREE_NODE_Array_(long size) Native array allocator.
GIM_BVH_TREE_NODE_Array_(Pointer p) Pointer cast constructor.

Method Summary

Modifier and Type	Method and Description
int	_capacity() return the pre-allocated (reserved) elements, this is at least as large as the total number of elements,see size() and reserve()
GIM_BVH_TREE_NODE	at(int n)
void	clear() clear the array, deallocated memory.
void	copyFromArray(GIM_BVH_TREE_NODE_Array_ otherArray)
GIM_BVH_TREE_NODE	expand()
GIM_BVH_TREE_NODE	expand(GIM_BVH_TREE_NODE fillValue)
GIM_BVH_TREE_NODE	expandNonInitializing()
GIM_BVH_TREE_NODE	get(int n)
GIM_BVH_TREE_NODE_Array_	getPointer(long i)
void	initializeFromBuffer(Pointer buffer, int size, int _capacity)
void	pop_back()
GIM_BVH_TREE_NODE_Array_	position(long position)
void	push_back(GIM_BVH_TREE_NODE _Val)
GIM_BVH_TREE_NODE_Array_	put(GIM_BVH_TREE_NODE_Array_ other)
void	removeAtIndex(int index) non-recursive binary search, assumes sorted array
void	reserve(int _Count)
void	resize(int newsize)
void	resize(int newsize, GIM_BVH_TREE_NODE fillData)
void	resizeNoInitialize(int newsize) resize changes the number of elements in the array.
int	size() return the number of elements in the array
void	swap(int index0, int index1) heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/

Methods inherited from class org.bytedeco.javacpp.Pointer

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, zero

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

GIM_BVH_TREE_NODE_Array_

public GIM_BVH_TREE_NODE_Array_(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

GIM_BVH_TREE_NODE_Array_

public GIM_BVH_TREE_NODE_Array_(long size)

Native array allocator. Access with Pointer.position(long).

GIM_BVH_TREE_NODE_Array_

public GIM_BVH_TREE_NODE_Array_()

GIM_BVH_TREE_NODE_Array_

public GIM_BVH_TREE_NODE_Array_(@Const @ByRef
                                GIM_BVH_TREE_NODE_Array_ otherArray)

Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead.

Method Detail

position

public GIM_BVH_TREE_NODE_Array_ position(long position)

Overrides:

position in class Pointer

getPointer

public GIM_BVH_TREE_NODE_Array_ getPointer(long i)

Overrides:

getPointer in class Pointer

put

@ByRef
 @Name(value="operator =")
public GIM_BVH_TREE_NODE_Array_ put(@Const @ByRef
                                                                      GIM_BVH_TREE_NODE_Array_ other)

size

public int size()

return the number of elements in the array

at

@ByRef
public GIM_BVH_TREE_NODE at(int n)

get

@ByRef
 @Name(value="operator []")
public GIM_BVH_TREE_NODE get(int n)

clear

public void clear()

clear the array, deallocated memory. Generally it is better to use array.resize(0), to reduce performance overhead of run-time memory (de)allocations.

pop_back

public void pop_back()

resizeNoInitialize

public void resizeNoInitialize(int newsize)

resize changes the number of elements in the array. If the new size is larger, the new elements will be constructed using the optional second argument. when the new number of elements is smaller, the destructor will be called, but memory will not be freed, to reduce performance overhead of run-time memory (de)allocations.

resize

public void resize(int newsize,
                   @Const @ByRef(nullValue="GIM_BVH_TREE_NODE()")
                   GIM_BVH_TREE_NODE fillData)

resize

public void resize(int newsize)

expandNonInitializing

@ByRef
public GIM_BVH_TREE_NODE expandNonInitializing()

expand

@ByRef
public GIM_BVH_TREE_NODE expand(@Const @ByRef(nullValue="GIM_BVH_TREE_NODE()")
                                       GIM_BVH_TREE_NODE fillValue)

expand

@ByRef
public GIM_BVH_TREE_NODE expand()

push_back

public void push_back(@Const @ByRef
                      GIM_BVH_TREE_NODE _Val)

_capacity

@Name(value="capacity")
public int _capacity()

return the pre-allocated (reserved) elements, this is at least as large as the total number of elements,see size() and reserve()

reserve

public void reserve(int _Count)

swap

public void swap(int index0,
                 int index1)

heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/

removeAtIndex

public void removeAtIndex(int index)

non-recursive binary search, assumes sorted array

initializeFromBuffer

public void initializeFromBuffer(Pointer buffer,
                                 int size,
                                 int _capacity)

copyFromArray

public void copyFromArray(@Const @ByRef
                          GIM_BVH_TREE_NODE_Array_ otherArray)