org.bytedeco.bullet.BulletSoftBody

Class btSparseSdf3CellArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.BulletSoftBody.btSparseSdf3CellArray

All Implemented Interfaces:

AutoCloseable

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

btSparseSdf3CellArray

public btSparseSdf3CellArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

btSparseSdf3CellArray

public btSparseSdf3CellArray(long size)

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

btSparseSdf3CellArray

public btSparseSdf3CellArray()

btSparseSdf3CellArray

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

Overrides:

position in class Pointer

getPointer

public btSparseSdf3CellArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByPtrRef
public btSparseSdf3.Cell at(int n)

get

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

resize

public void resize(int newsize)

expandNonInitializing

@ByPtrRef
public btSparseSdf3.Cell expandNonInitializing()

expand

@ByPtrRef
public btSparseSdf3.Cell expand(@ByPtrRef
                                          btSparseSdf3.Cell fillValue)

expand

@ByPtrRef
public btSparseSdf3.Cell expand()

push_back

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

non-recursive binary search, assumes sorted array

findLinearSearch

public int findLinearSearch(@ByPtrRef
                            btSparseSdf3.Cell key)

findLinearSearch2

public int findLinearSearch2(@ByPtrRef
                             btSparseSdf3.Cell key)

removeAtIndex

public void removeAtIndex(int index)

remove

public void remove(@ByPtrRef
                   btSparseSdf3.Cell key)

initializeFromBuffer

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

copyFromArray

public void copyFromArray(@Const @ByRef
                          btSparseSdf3CellArray otherArray)