org.bytedeco.bullet.BulletDynamics

Class IslandArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.BulletDynamics.IslandArray

All Implemented Interfaces:

AutoCloseable

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

IslandArray

public IslandArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

IslandArray

public IslandArray(long size)

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

IslandArray

public IslandArray()

IslandArray

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

Overrides:

position in class Pointer

getPointer

public IslandArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByPtrRef
public btSimulationIslandManagerMt.Island at(int n)

get

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

resize

public void resize(int newsize)

expandNonInitializing

@ByPtrRef
public btSimulationIslandManagerMt.Island expandNonInitializing()

expand

@ByPtrRef
public btSimulationIslandManagerMt.Island expand(@ByPtrRef
                                                           btSimulationIslandManagerMt.Island fillValue)

expand

@ByPtrRef
public btSimulationIslandManagerMt.Island expand()

push_back

public void push_back(@ByPtrRef
                      btSimulationIslandManagerMt.Island _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
                            btSimulationIslandManagerMt.Island key)

non-recursive binary search, assumes sorted array

findLinearSearch

public int findLinearSearch(@ByPtrRef
                            btSimulationIslandManagerMt.Island key)

findLinearSearch2

public int findLinearSearch2(@ByPtrRef
                             btSimulationIslandManagerMt.Island key)

removeAtIndex

public void removeAtIndex(int index)

remove

public void remove(@ByPtrRef
                   btSimulationIslandManagerMt.Island key)

initializeFromBuffer

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

copyFromArray

public void copyFromArray(@Const @ByRef
                          IslandArray otherArray)