org.bytedeco.bullet.BulletDynamics.btSolverConstraintArray Maven / Gradle / Ivy
// Targeted by JavaCPP version 1.5.8: DO NOT EDIT THIS FILE
package org.bytedeco.bullet.BulletDynamics;
import java.nio.*;
import org.bytedeco.javacpp.*;
import org.bytedeco.javacpp.annotation.*;
import static org.bytedeco.javacpp.presets.javacpp.*;
import org.bytedeco.bullet.LinearMath.*;
import static org.bytedeco.bullet.global.LinearMath.*;
import org.bytedeco.bullet.BulletCollision.*;
import static org.bytedeco.bullet.global.BulletCollision.*;
import static org.bytedeco.bullet.global.BulletDynamics.*;
@Name("btAlignedObjectArray") @NoOffset @Properties(inherit = org.bytedeco.bullet.presets.BulletDynamics.class)
public class btSolverConstraintArray extends Pointer {
static { Loader.load(); }
/** Pointer cast constructor. Invokes {@link Pointer#Pointer(Pointer)}. */
public btSolverConstraintArray(Pointer p) { super(p); }
/** Native array allocator. Access with {@link Pointer#position(long)}. */
public btSolverConstraintArray(long size) { super((Pointer)null); allocateArray(size); }
private native void allocateArray(long size);
@Override public btSolverConstraintArray position(long position) {
return (btSolverConstraintArray)super.position(position);
}
@Override public btSolverConstraintArray getPointer(long i) {
return new btSolverConstraintArray((Pointer)this).offsetAddress(i);
}
public native @ByRef @Name("operator =") btSolverConstraintArray put(@Const @ByRef btSolverConstraintArray other);
public btSolverConstraintArray() { super((Pointer)null); allocate(); }
private native void allocate();
/**Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead. */
public btSolverConstraintArray(@Const @ByRef btSolverConstraintArray otherArray) { super((Pointer)null); allocate(otherArray); }
private native void allocate(@Const @ByRef btSolverConstraintArray otherArray);
/** return the number of elements in the array */
public native int size();
public native @ByRef btSolverConstraint at(int n);
public native @ByRef @Name("operator []") btSolverConstraint get(int n);
/**clear the array, deallocated memory. Generally it is better to use array.resize(0), to reduce performance overhead of run-time memory (de)allocations. */
public native void clear();
public native void pop_back();
/**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. */
public native void resizeNoInitialize(int newsize);
public native void resize(int newsize, @Const @ByRef(nullValue = "btSolverConstraint()") btSolverConstraint fillData);
public native void resize(int newsize);
public native @ByRef btSolverConstraint expandNonInitializing();
public native @ByRef btSolverConstraint expand(@Const @ByRef(nullValue = "btSolverConstraint()") btSolverConstraint fillValue);
public native @ByRef btSolverConstraint expand();
public native void push_back(@Const @ByRef btSolverConstraint _Val);
/** return the pre-allocated (reserved) elements, this is at least as large as the total number of elements,see size() and reserve() */
public native @Name("capacity") int _capacity();
public native void reserve(int _Count);
/**heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/ */ /*downHeap*/
public native void swap(int index0, int index1);
/**non-recursive binary search, assumes sorted array */
// If the key is not in the array, return -1 instead of 0,
// since 0 also means the first element in the array.
public native void removeAtIndex(int index);
//PCK: whole function
public native void initializeFromBuffer(Pointer buffer, int size, int _capacity);
public native void copyFromArray(@Const @ByRef btSolverConstraintArray otherArray);
}