org.bytedeco.bullet.LinearMath

Class btPlaneArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.LinearMath.btPlaneArray

All Implemented Interfaces:

AutoCloseable

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

btPlaneArray

public btPlaneArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

btPlaneArray

public btPlaneArray(long size)

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

btPlaneArray

public btPlaneArray()

btPlaneArray

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

Overrides:

position in class Pointer

getPointer

public btPlaneArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByRef
public btPlane at(int n)

get

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

resize

public void resize(int newsize)

expandNonInitializing

@ByRef
public btPlane expandNonInitializing()

expand

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

expand

@ByRef
public btPlane expand()

push_back

public void push_back(@Const @ByRef
                      btPlane _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
                          btPlaneArray otherArray)