• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* ----------------------------------------------------------------------------
2  * This file was automatically generated by SWIG (http://www.swig.org).
3  * Version 3.0.8
4  *
5  * Do not make changes to this file unless you know what you are doing--modify
6  * the SWIG interface file instead.
7  * ----------------------------------------------------------------------------- */
8 
9 package com.badlogic.gdx.physics.bullet.collision;
10 
11 import com.badlogic.gdx.physics.bullet.BulletBase;
12 import com.badlogic.gdx.physics.bullet.linearmath.*;
13 import com.badlogic.gdx.math.Vector3;
14 import com.badlogic.gdx.math.Quaternion;
15 import com.badlogic.gdx.math.Matrix3;
16 import com.badlogic.gdx.math.Matrix4;
17 
18 public class btVoronoiSimplexSolver extends BulletBase {
19 	private long swigCPtr;
20 
btVoronoiSimplexSolver(final String className, long cPtr, boolean cMemoryOwn)21 	protected btVoronoiSimplexSolver(final String className, long cPtr, boolean cMemoryOwn) {
22 		super(className, cPtr, cMemoryOwn);
23 		swigCPtr = cPtr;
24 	}
25 
26 	/** Construct a new btVoronoiSimplexSolver, normally you should not need this constructor it's intended for low-level usage. */
btVoronoiSimplexSolver(long cPtr, boolean cMemoryOwn)27 	public btVoronoiSimplexSolver(long cPtr, boolean cMemoryOwn) {
28 		this("btVoronoiSimplexSolver", cPtr, cMemoryOwn);
29 		construct();
30 	}
31 
32 	@Override
reset(long cPtr, boolean cMemoryOwn)33 	protected void reset(long cPtr, boolean cMemoryOwn) {
34 		if (!destroyed)
35 			destroy();
36 		super.reset(swigCPtr = cPtr, cMemoryOwn);
37 	}
38 
getCPtr(btVoronoiSimplexSolver obj)39 	public static long getCPtr(btVoronoiSimplexSolver obj) {
40 		return (obj == null) ? 0 : obj.swigCPtr;
41 	}
42 
43 	@Override
finalize()44 	protected void finalize() throws Throwable {
45 		if (!destroyed)
46 			destroy();
47 		super.finalize();
48 	}
49 
delete()50   @Override protected synchronized void delete() {
51 		if (swigCPtr != 0) {
52 			if (swigCMemOwn) {
53 				swigCMemOwn = false;
54 				CollisionJNI.delete_btVoronoiSimplexSolver(swigCPtr);
55 			}
56 			swigCPtr = 0;
57 		}
58 		super.delete();
59 	}
60 
setNumVertices(int value)61   public void setNumVertices(int value) {
62     CollisionJNI.btVoronoiSimplexSolver_numVertices_set(swigCPtr, this, value);
63   }
64 
getNumVertices()65   public int getNumVertices() {
66     return CollisionJNI.btVoronoiSimplexSolver_numVertices_get(swigCPtr, this);
67   }
68 
setSimplexVectorW(btVector3 value)69   public void setSimplexVectorW(btVector3 value) {
70     CollisionJNI.btVoronoiSimplexSolver_simplexVectorW_set(swigCPtr, this, btVector3.getCPtr(value), value);
71   }
72 
getSimplexVectorW()73   public btVector3 getSimplexVectorW() {
74     long cPtr = CollisionJNI.btVoronoiSimplexSolver_simplexVectorW_get(swigCPtr, this);
75     return (cPtr == 0) ? null : new btVector3(cPtr, false);
76   }
77 
setSimplexPointsP(btVector3 value)78   public void setSimplexPointsP(btVector3 value) {
79     CollisionJNI.btVoronoiSimplexSolver_simplexPointsP_set(swigCPtr, this, btVector3.getCPtr(value), value);
80   }
81 
getSimplexPointsP()82   public btVector3 getSimplexPointsP() {
83     long cPtr = CollisionJNI.btVoronoiSimplexSolver_simplexPointsP_get(swigCPtr, this);
84     return (cPtr == 0) ? null : new btVector3(cPtr, false);
85   }
86 
setSimplexPointsQ(btVector3 value)87   public void setSimplexPointsQ(btVector3 value) {
88     CollisionJNI.btVoronoiSimplexSolver_simplexPointsQ_set(swigCPtr, this, btVector3.getCPtr(value), value);
89   }
90 
getSimplexPointsQ()91   public btVector3 getSimplexPointsQ() {
92     long cPtr = CollisionJNI.btVoronoiSimplexSolver_simplexPointsQ_get(swigCPtr, this);
93     return (cPtr == 0) ? null : new btVector3(cPtr, false);
94   }
95 
setCachedP1(btVector3 value)96   public void setCachedP1(btVector3 value) {
97     CollisionJNI.btVoronoiSimplexSolver_cachedP1_set(swigCPtr, this, btVector3.getCPtr(value), value);
98   }
99 
getCachedP1()100   public btVector3 getCachedP1() {
101     long cPtr = CollisionJNI.btVoronoiSimplexSolver_cachedP1_get(swigCPtr, this);
102     return (cPtr == 0) ? null : new btVector3(cPtr, false);
103   }
104 
setCachedP2(btVector3 value)105   public void setCachedP2(btVector3 value) {
106     CollisionJNI.btVoronoiSimplexSolver_cachedP2_set(swigCPtr, this, btVector3.getCPtr(value), value);
107   }
108 
getCachedP2()109   public btVector3 getCachedP2() {
110     long cPtr = CollisionJNI.btVoronoiSimplexSolver_cachedP2_get(swigCPtr, this);
111     return (cPtr == 0) ? null : new btVector3(cPtr, false);
112   }
113 
setCachedV(btVector3 value)114   public void setCachedV(btVector3 value) {
115     CollisionJNI.btVoronoiSimplexSolver_cachedV_set(swigCPtr, this, btVector3.getCPtr(value), value);
116   }
117 
getCachedV()118   public btVector3 getCachedV() {
119     long cPtr = CollisionJNI.btVoronoiSimplexSolver_cachedV_get(swigCPtr, this);
120     return (cPtr == 0) ? null : new btVector3(cPtr, false);
121   }
122 
setLastW(btVector3 value)123   public void setLastW(btVector3 value) {
124     CollisionJNI.btVoronoiSimplexSolver_lastW_set(swigCPtr, this, btVector3.getCPtr(value), value);
125   }
126 
getLastW()127   public btVector3 getLastW() {
128     long cPtr = CollisionJNI.btVoronoiSimplexSolver_lastW_get(swigCPtr, this);
129     return (cPtr == 0) ? null : new btVector3(cPtr, false);
130   }
131 
setEqualVertexThreshold(float value)132   public void setEqualVertexThreshold(float value) {
133     CollisionJNI.btVoronoiSimplexSolver_equalVertexThreshold_set(swigCPtr, this, value);
134   }
135 
getEqualVertexThreshold()136   public float getEqualVertexThreshold() {
137     return CollisionJNI.btVoronoiSimplexSolver_equalVertexThreshold_get(swigCPtr, this);
138   }
139 
setCachedValidClosest(boolean value)140   public void setCachedValidClosest(boolean value) {
141     CollisionJNI.btVoronoiSimplexSolver_cachedValidClosest_set(swigCPtr, this, value);
142   }
143 
getCachedValidClosest()144   public boolean getCachedValidClosest() {
145     return CollisionJNI.btVoronoiSimplexSolver_cachedValidClosest_get(swigCPtr, this);
146   }
147 
setCachedBC(btSubSimplexClosestResult value)148   public void setCachedBC(btSubSimplexClosestResult value) {
149     CollisionJNI.btVoronoiSimplexSolver_cachedBC_set(swigCPtr, this, btSubSimplexClosestResult.getCPtr(value), value);
150   }
151 
getCachedBC()152   public btSubSimplexClosestResult getCachedBC() {
153     long cPtr = CollisionJNI.btVoronoiSimplexSolver_cachedBC_get(swigCPtr, this);
154     return (cPtr == 0) ? null : new btSubSimplexClosestResult(cPtr, false);
155   }
156 
setNeedsUpdate(boolean value)157   public void setNeedsUpdate(boolean value) {
158     CollisionJNI.btVoronoiSimplexSolver_needsUpdate_set(swigCPtr, this, value);
159   }
160 
getNeedsUpdate()161   public boolean getNeedsUpdate() {
162     return CollisionJNI.btVoronoiSimplexSolver_needsUpdate_get(swigCPtr, this);
163   }
164 
removeVertex(int index)165   public void removeVertex(int index) {
166     CollisionJNI.btVoronoiSimplexSolver_removeVertex(swigCPtr, this, index);
167   }
168 
reduceVertices(btUsageBitfield usedVerts)169   public void reduceVertices(btUsageBitfield usedVerts) {
170     CollisionJNI.btVoronoiSimplexSolver_reduceVertices(swigCPtr, this, btUsageBitfield.getCPtr(usedVerts), usedVerts);
171   }
172 
updateClosestVectorAndPoints()173   public boolean updateClosestVectorAndPoints() {
174     return CollisionJNI.btVoronoiSimplexSolver_updateClosestVectorAndPoints(swigCPtr, this);
175   }
176 
closestPtPointTetrahedron(Vector3 p, Vector3 a, Vector3 b, Vector3 c, Vector3 d, btSubSimplexClosestResult finalResult)177   public boolean closestPtPointTetrahedron(Vector3 p, Vector3 a, Vector3 b, Vector3 c, Vector3 d, btSubSimplexClosestResult finalResult) {
178     return CollisionJNI.btVoronoiSimplexSolver_closestPtPointTetrahedron(swigCPtr, this, p, a, b, c, d, btSubSimplexClosestResult.getCPtr(finalResult), finalResult);
179   }
180 
pointOutsideOfPlane(Vector3 p, Vector3 a, Vector3 b, Vector3 c, Vector3 d)181   public int pointOutsideOfPlane(Vector3 p, Vector3 a, Vector3 b, Vector3 c, Vector3 d) {
182     return CollisionJNI.btVoronoiSimplexSolver_pointOutsideOfPlane(swigCPtr, this, p, a, b, c, d);
183   }
184 
closestPtPointTriangle(Vector3 p, Vector3 a, Vector3 b, Vector3 c, btSubSimplexClosestResult result)185   public boolean closestPtPointTriangle(Vector3 p, Vector3 a, Vector3 b, Vector3 c, btSubSimplexClosestResult result) {
186     return CollisionJNI.btVoronoiSimplexSolver_closestPtPointTriangle(swigCPtr, this, p, a, b, c, btSubSimplexClosestResult.getCPtr(result), result);
187   }
188 
btVoronoiSimplexSolver()189   public btVoronoiSimplexSolver() {
190     this(CollisionJNI.new_btVoronoiSimplexSolver(), true);
191   }
192 
reset()193   public void reset() {
194     CollisionJNI.btVoronoiSimplexSolver_reset(swigCPtr, this);
195   }
196 
addVertex(Vector3 w, Vector3 p, Vector3 q)197   public void addVertex(Vector3 w, Vector3 p, Vector3 q) {
198     CollisionJNI.btVoronoiSimplexSolver_addVertex(swigCPtr, this, w, p, q);
199   }
200 
closest(Vector3 v)201   public boolean closest(Vector3 v) {
202     return CollisionJNI.btVoronoiSimplexSolver_closest(swigCPtr, this, v);
203   }
204 
maxVertex()205   public float maxVertex() {
206     return CollisionJNI.btVoronoiSimplexSolver_maxVertex(swigCPtr, this);
207   }
208 
fullSimplex()209   public boolean fullSimplex() {
210     return CollisionJNI.btVoronoiSimplexSolver_fullSimplex(swigCPtr, this);
211   }
212 
getSimplex(btVector3 pBuf, btVector3 qBuf, btVector3 yBuf)213   public int getSimplex(btVector3 pBuf, btVector3 qBuf, btVector3 yBuf) {
214     return CollisionJNI.btVoronoiSimplexSolver_getSimplex(swigCPtr, this, btVector3.getCPtr(pBuf), pBuf, btVector3.getCPtr(qBuf), qBuf, btVector3.getCPtr(yBuf), yBuf);
215   }
216 
inSimplex(Vector3 w)217   public boolean inSimplex(Vector3 w) {
218     return CollisionJNI.btVoronoiSimplexSolver_inSimplex(swigCPtr, this, w);
219   }
220 
backup_closest(Vector3 v)221   public void backup_closest(Vector3 v) {
222     CollisionJNI.btVoronoiSimplexSolver_backup_closest(swigCPtr, this, v);
223   }
224 
emptySimplex()225   public boolean emptySimplex() {
226     return CollisionJNI.btVoronoiSimplexSolver_emptySimplex(swigCPtr, this);
227   }
228 
compute_points(Vector3 p1, Vector3 p2)229   public void compute_points(Vector3 p1, Vector3 p2) {
230     CollisionJNI.btVoronoiSimplexSolver_compute_points(swigCPtr, this, p1, p2);
231   }
232 
233 }
234