org.bytedeco.bullet.Bullet3OpenCL

Class b3OptimizedBvhArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.Bullet3OpenCL.b3OptimizedBvhArray

All Implemented Interfaces:

AutoCloseable

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

b3OptimizedBvhArray

public b3OptimizedBvhArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

b3OptimizedBvhArray

public b3OptimizedBvhArray(long size)

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

b3OptimizedBvhArray

public b3OptimizedBvhArray()

b3OptimizedBvhArray

public b3OptimizedBvhArray(@Const @ByRef
                           b3OptimizedBvhArray otherArray)

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

Method Detail

position

public b3OptimizedBvhArray position(long position)

Overrides:

position in class Pointer

getPointer

public b3OptimizedBvhArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByPtrRef
public b3OptimizedBvh at(int n)

get

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

resize

public void resize(int newsize)

expandNonInitializing

@ByPtrRef
public b3OptimizedBvh expandNonInitializing()

expand

@ByPtrRef
public b3OptimizedBvh expand(@ByPtrRef
                                       b3OptimizedBvh fillValue)

expand

@ByPtrRef
public b3OptimizedBvh expand()

push_back

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

non-recursive binary search, assumes sorted array

findLinearSearch

public int findLinearSearch(@ByPtrRef
                            b3OptimizedBvh key)

findLinearSearch2

public int findLinearSearch2(@ByPtrRef
                             b3OptimizedBvh key)

remove

public void remove(@ByPtrRef
                   b3OptimizedBvh key)

initializeFromBuffer

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

copyFromArray

public void copyFromArray(@Const @ByRef
                          b3OptimizedBvhArray otherArray)

removeAtIndex

public void removeAtIndex(int index)