org.bytedeco.bullet.BulletCollision

Class btPersistentManifoldArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.BulletCollision.btPersistentManifoldArray

All Implemented Interfaces:

AutoCloseable

@Name(value="btAlignedObjectArray<btPersistentManifold*>")
 @NoOffset
 @Properties(inherit=BulletCollision.class)
public class btPersistentManifoldArray
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
btPersistentManifoldArray()
btPersistentManifoldArray(btPersistentManifoldArray otherArray) Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead.
btPersistentManifoldArray(long size) Native array allocator.
btPersistentManifoldArray(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()
btPersistentManifold	at(int n)
void	clear() clear the array, deallocated memory.
void	copyFromArray(btPersistentManifoldArray otherArray)
btPersistentManifold	expand()
btPersistentManifold	expand(btPersistentManifold fillValue)
btPersistentManifold	expandNonInitializing()
int	findBinarySearch(btPersistentManifold key) non-recursive binary search, assumes sorted array
int	findLinearSearch(btPersistentManifold key)
int	findLinearSearch2(btPersistentManifold key)
btPersistentManifold	get(int n)
btPersistentManifoldArray	getPointer(long i)
void	initializeFromBuffer(Pointer buffer, int size, int _capacity)
void	pop_back()
btPersistentManifoldArray	position(long position)
void	push_back(btPersistentManifold _Val)
btPersistentManifoldArray	put(btPersistentManifoldArray other)
void	remove(btPersistentManifold key)
void	removeAtIndex(int index)
void	reserve(int _Count)
void	resize(int newsize)
void	resize(int newsize, btPersistentManifold 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

btPersistentManifoldArray

public btPersistentManifoldArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

btPersistentManifoldArray

public btPersistentManifoldArray(long size)

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

btPersistentManifoldArray

public btPersistentManifoldArray()

btPersistentManifoldArray

public btPersistentManifoldArray(@Const @ByRef
                                 btPersistentManifoldArray 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 btPersistentManifoldArray position(long position)

Overrides:

position in class Pointer

getPointer

public btPersistentManifoldArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByPtrRef
public btPersistentManifold at(int n)

get

@ByPtrRef
 @Name(value="operator []")
public btPersistentManifold 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,
                   @ByPtrRef
                   btPersistentManifold fillData)

resize

public void resize(int newsize)

expandNonInitializing

@ByPtrRef
public btPersistentManifold expandNonInitializing()

expand

@ByPtrRef
public btPersistentManifold expand(@ByPtrRef
                                             btPersistentManifold fillValue)

expand

@ByPtrRef
public btPersistentManifold expand()

push_back

public void push_back(@ByPtrRef
                      btPersistentManifold _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/

findBinarySearch

public int findBinarySearch(@ByPtrRef
                            btPersistentManifold key)

non-recursive binary search, assumes sorted array

findLinearSearch

public int findLinearSearch(@ByPtrRef
                            btPersistentManifold key)

findLinearSearch2

public int findLinearSearch2(@ByPtrRef
                             btPersistentManifold key)

removeAtIndex

public void removeAtIndex(int index)

remove

public void remove(@ByPtrRef
                   btPersistentManifold key)

initializeFromBuffer

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

copyFromArray

public void copyFromArray(@Const @ByRef
                          btPersistentManifoldArray otherArray)