org.bytedeco.bullet.Bullet3Collision.sStkNPSArray Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of bullet Show documentation
There is a newer version: 3.25-1.5.11
// Targeted by JavaCPP version 1.5.8: DO NOT EDIT THIS FILE

package org.bytedeco.bullet.Bullet3Collision;

import java.nio.*;
import org.bytedeco.javacpp.*;
import org.bytedeco.javacpp.annotation.*;

import static org.bytedeco.javacpp.presets.javacpp.*;
import org.bytedeco.bullet.Bullet3Common.*;
import static org.bytedeco.bullet.global.Bullet3Common.*;

import static org.bytedeco.bullet.global.Bullet3Collision.*;

@Name("b3AlignedObjectArray") @NoOffset @Properties(inherit = org.bytedeco.bullet.presets.Bullet3Collision.class)
public class sStkNPSArray extends Pointer {
    static { Loader.load(); }
    /** Pointer cast constructor. Invokes {@link Pointer#Pointer(Pointer)}. */
    public sStkNPSArray(Pointer p) { super(p); }
    /** Native array allocator. Access with {@link Pointer#position(long)}. */
    public sStkNPSArray(long size) { super((Pointer)null); allocateArray(size); }
    private native void allocateArray(long size);
    @Override public sStkNPSArray position(long position) {
        return (sStkNPSArray)super.position(position);
    }
    @Override public sStkNPSArray getPointer(long i) {
        return new sStkNPSArray((Pointer)this).offsetAddress(i);
    }

	public native @ByRef @Name("operator =") sStkNPSArray put(@Const @ByRef sStkNPSArray other);
	public sStkNPSArray() { super((Pointer)null); allocate(); }
	private native void allocate();

	/**Generally it is best to avoid using the copy constructor of an b3AlignedObjectArray, and use a (const) reference to the array instead. */
	public sStkNPSArray(@Const @ByRef sStkNPSArray otherArray) { super((Pointer)null); allocate(otherArray); }
	private native void allocate(@Const @ByRef sStkNPSArray otherArray);

	/** return the number of elements in the array */
	public native int size();

	public native @ByRef b3DynamicBvh.sStkNPS at(int n);

	public native @ByRef @Name("operator []") b3DynamicBvh.sStkNPS 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 = "b3DynamicBvh::sStkNPS()") b3DynamicBvh.sStkNPS fillData);
	public native void resize(int newsize);
	public native @ByRef b3DynamicBvh.sStkNPS expandNonInitializing();

	public native @ByRef b3DynamicBvh.sStkNPS expand(@Const @ByRef(nullValue = "b3DynamicBvh::sStkNPS()") b3DynamicBvh.sStkNPS fillValue);
	public native @ByRef b3DynamicBvh.sStkNPS expand();

	public native void push_back(@Const @ByRef b3DynamicBvh.sStkNPS _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 */
	

	

	

	

	//PCK: whole function
	public native void initializeFromBuffer(Pointer buffer, int size, int _capacity);

	public native void copyFromArray(@Const @ByRef sStkNPSArray otherArray);

	public native void removeAtIndex(int index);
}