org.bytedeco.bullet.LinearMath

Class btIntArray

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.bullet.LinearMath.btIntArray

All Implemented Interfaces:

AutoCloseable

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

btIntArray

public btIntArray(Pointer p)

Pointer cast constructor. Invokes Pointer(Pointer).

btIntArray

public btIntArray(long size)

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

btIntArray

public btIntArray()

btIntArray

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

Overrides:

position in class Pointer

getPointer

public btIntArray getPointer(long i)

Overrides:

getPointer in class Pointer

put

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

size

public int size()

return the number of elements in the array

at

@ByRef
public IntPointer at(int n)

get

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

resize

public void resize(int newsize)

expandNonInitializing

@ByRef
public IntPointer expandNonInitializing()

expand

@ByRef
public IntPointer expand(int fillValue)

expand

@ByRef
public IntPointer expand()

push_back

public void push_back(int _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(int key)

non-recursive binary search, assumes sorted array

findLinearSearch

public int findLinearSearch(int key)

findLinearSearch2

public int findLinearSearch2(int key)

removeAtIndex

public void removeAtIndex(int index)

remove

public void remove(int key)

initializeFromBuffer

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

copyFromArray

public void copyFromArray(@Const @ByRef
                          btIntArray otherArray)