chipmunk 4.1.0-x86-mswin32 → 5.3.4.0-x86-mswin32

data/ext/chipmunk/cpJoint.h

@@ -1,122 +0,0 @@
-/* Copyright (c) 2007 Scott Lembcke
-* 
-* Permission is hereby granted, free of charge, to any person obtaining a copy
-* of this software and associated documentation files (the "Software"), to deal
-* in the Software without restriction, including without limitation the rights
-* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-* copies of the Software, and to permit persons to whom the Software is
-* furnished to do so, subject to the following conditions:
-* 
-* The above copyright notice and this permission notice shall be included in
-* all copies or substantial portions of the Software.
-* 
-* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-* SOFTWARE.
-*/
-
-// TODO: Comment me!
-	
-extern cpFloat cp_joint_bias_coef;
-
-typedef enum cpJointType {
-	CP_PIN_JOINT,
-	CP_PIVOT_JOINT,
-	CP_SLIDE_JOINT,
-	CP_GROOVE_JOINT,
-	CP_CUSTOM_JOINT, // For user definable joint types.
-} cpJointType;
-
-struct cpJoint;
-struct cpJointClass;
-
-typedef struct cpJointClass {
-	cpJointType type;
-	
-	void (*preStep)(struct cpJoint *joint, cpFloat dt_inv);
-	void (*applyImpulse)(struct cpJoint *joint);
-} cpJointClass;
-
-typedef struct cpJoint {
-	const cpJointClass *klass;
-	
-	cpBody *a, *b;
-} cpJoint;
-
-void cpJointDestroy(cpJoint *joint);
-void cpJointFree(cpJoint *joint);
-
-
-typedef struct cpPinJoint {
-	cpJoint joint;
-	cpVect anchr1, anchr2;
-	cpFloat dist;
-	
-	cpVect r1, r2;
-	cpVect n;
-	cpFloat nMass;
-	
-	cpFloat jnAcc, jBias;
-	cpFloat bias;
-} cpPinJoint;
-
-cpPinJoint *cpPinJointAlloc(void);
-cpPinJoint *cpPinJointInit(cpPinJoint *joint, cpBody *a, cpBody *b, cpVect anchr1, cpVect anchr2);
-cpJoint *cpPinJointNew(cpBody *a, cpBody *b, cpVect anchr1, cpVect anchr2);
-
-
-typedef struct cpSlideJoint {
-	cpJoint joint;
-	cpVect anchr1, anchr2;
-	cpFloat min, max;
-	
-	cpVect r1, r2;
-	cpVect n;
-	cpFloat nMass;
-	
-	cpFloat jnAcc, jBias;
-	cpFloat bias;
-} cpSlideJoint;
-
-cpSlideJoint *cpSlideJointAlloc(void);
-cpSlideJoint *cpSlideJointInit(cpSlideJoint *joint, cpBody *a, cpBody *b, cpVect anchr1, cpVect anchr2, cpFloat min, cpFloat max);
-cpJoint *cpSlideJointNew(cpBody *a, cpBody *b, cpVect anchr1, cpVect anchr2, cpFloat min, cpFloat max);
-
-
-typedef struct cpPivotJoint {
-	cpJoint joint;
-	cpVect anchr1, anchr2;
-	
-	cpVect r1, r2;
-	cpVect k1, k2;
-	
-	cpVect jAcc, jBias;
-	cpVect bias;
-} cpPivotJoint;
-
-cpPivotJoint *cpPivotJointAlloc(void);
-cpPivotJoint *cpPivotJointInit(cpPivotJoint *joint, cpBody *a, cpBody *b, cpVect pivot);
-cpJoint *cpPivotJointNew(cpBody *a, cpBody *b, cpVect pivot);
-
-
-typedef struct cpGrooveJoint {
-	cpJoint joint;
-	cpVect grv_n, grv_a, grv_b;
-	cpVect  anchr2;
-	
-	cpVect grv_tn;
-	cpFloat clamp;
-	cpVect r1, r2;
-	cpVect k1, k2;
-	
-	cpVect jAcc, jBias;
-	cpVect bias;
-} cpGrooveJoint;
-
-cpGrooveJoint *cpGrooveJointAlloc(void);
-cpGrooveJoint *cpGrooveJointInit(cpGrooveJoint *joint, cpBody *a, cpBody *b, cpVect groove_a, cpVect groove_b, cpVect anchr2);
-cpJoint *cpGrooveJointNew(cpBody *a, cpBody *b, cpVect groove_a, cpVect groove_b, cpVect anchr2);

data/ext/chipmunk/cpPolyShape.c

@@ -1,139 +0,0 @@
-/* Copyright (c) 2007 Scott Lembcke
- * 
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- * 
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- * 
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
- 
-#include <stdlib.h>
-#include <stdio.h>
-#include <math.h>
-
-#include "chipmunk.h"
-
-cpPolyShape *
-cpPolyShapeAlloc(void)
-{
-	return (cpPolyShape *)calloc(1, sizeof(cpPolyShape));
-}
-
-static void
-cpPolyShapeTransformVerts(cpPolyShape *poly, cpVect p, cpVect rot)
-{
-	cpVect *src = poly->verts;
-	cpVect *dst = poly->tVerts;
-	
-	for(int i=0; i<poly->numVerts; i++)
-		dst[i] = cpvadd(p, cpvrotate(src[i], rot));
-}
-
-static void
-cpPolyShapeTransformAxes(cpPolyShape *poly, cpVect p, cpVect rot)
-{
-	cpPolyShapeAxis *src = poly->axes;
-	cpPolyShapeAxis *dst = poly->tAxes;
-	
-	for(int i=0; i<poly->numVerts; i++){
-		cpVect n = cpvrotate(src[i].n, rot);
-		dst[i].n = n;
-		dst[i].d = cpvdot(p, n) + src[i].d;
-	}
-}
-
-static cpBB
-cpPolyShapeCacheData(cpShape *shape, cpVect p, cpVect rot)
-{
-	cpPolyShape *poly = (cpPolyShape *)shape;
-	
-	cpFloat l, b, r, t;
-	
-	cpPolyShapeTransformAxes(poly, p, rot);
-	cpPolyShapeTransformVerts(poly, p, rot);
-	
-	cpVect *verts = poly->tVerts;
-	l = r = verts[0].x;
-	b = t = verts[0].y;
-	
-	// TODO do as part of cpPolyShapeTransformVerts?
-	for(int i=1; i<poly->numVerts; i++){
-		cpVect v = verts[i];
-		
-		l = cpfmin(l, v.x);
-		r = cpfmax(r, v.x);
-		
-		b = cpfmin(b, v.y);
-		t = cpfmax(t, v.y);
-	}
-	
-	return cpBBNew(l, b, r, t);
-}
-
-static void
-cpPolyShapeDestroy(cpShape *shape)
-{
-	cpPolyShape *poly = (cpPolyShape *)shape;
-	
-	free(poly->verts);
-	free(poly->tVerts);
-	
-	free(poly->axes);
-	free(poly->tAxes);
-}
-
-static int
-cpPolyShapePointQuery(cpShape *shape, cpVect p){
-	// TODO Check against BB first?
-	return cpPolyShapeContainsVert((cpPolyShape *)shape, p);
-}
-
-static const cpShapeClass polyClass = {
-	CP_POLY_SHAPE,
-	cpPolyShapeCacheData,
-	cpPolyShapeDestroy,
-	cpPolyShapePointQuery,
-};
-
-cpPolyShape *
-cpPolyShapeInit(cpPolyShape *poly, cpBody *body, int numVerts, cpVect *verts, cpVect offset)
-{	
-	poly->numVerts = numVerts;
-
-	poly->verts = (cpVect *)calloc(numVerts, sizeof(cpVect));
-	poly->tVerts = (cpVect *)calloc(numVerts, sizeof(cpVect));
-	poly->axes = (cpPolyShapeAxis *)calloc(numVerts, sizeof(cpPolyShapeAxis));
-	poly->tAxes = (cpPolyShapeAxis *)calloc(numVerts, sizeof(cpPolyShapeAxis));
-	
-	for(int i=0; i<numVerts; i++){
-		cpVect a = cpvadd(offset, verts[i]);
-		cpVect b = cpvadd(offset, verts[(i+1)%numVerts]);
-		cpVect n = cpvnormalize(cpvperp(cpvsub(b, a)));
-
-		poly->verts[i] = a;
-		poly->axes[i].n = n;
-		poly->axes[i].d = cpvdot(n, a);
-	}
-	
-	cpShapeInit((cpShape *)poly, &polyClass, body);
-
-	return poly;
-}
-
-cpShape *
-cpPolyShapeNew(cpBody *body, int numVerts, cpVect *verts, cpVect offset)
-{
-	return (cpShape *)cpPolyShapeInit(cpPolyShapeAlloc(), body, numVerts, verts, offset);
-}

data/ext/chipmunk/cpPolyShape.h

@@ -1,92 +0,0 @@
-/* Copyright (c) 2007 Scott Lembcke
- * 
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- * 
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- * 
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-// Axis structure used by cpPolyShape.
-typedef struct cpPolyShapeAxis{
-	// normal
-	cpVect n;
-	// distance from origin
-	cpFloat d;
-} cpPolyShapeAxis;
-
-// Convex polygon shape structure.
-typedef struct cpPolyShape{
-	cpShape shape;
-	
-	// Vertex and axis lists.
-	int numVerts;
-	cpVect *verts;
-	cpPolyShapeAxis *axes;
-
-	// Transformed vertex and axis lists.
-	cpVect *tVerts;
-	cpPolyShapeAxis *tAxes;
-} cpPolyShape;
-
-// Basic allocation functions.
-cpPolyShape *cpPolyShapeAlloc(void);
-cpPolyShape *cpPolyShapeInit(cpPolyShape *poly, cpBody *body, int numVerts, cpVect *verts, cpVect offset);
-cpShape *cpPolyShapeNew(cpBody *body, int numVerts, cpVect *verts, cpVect offset);
-
-// Returns the minimum distance of the polygon to the axis.
-static inline cpFloat
-cpPolyShapeValueOnAxis(const cpPolyShape *poly, const cpVect n, const cpFloat d)
-{
-	cpVect *verts = poly->tVerts;
-	cpFloat min = cpvdot(n, verts[0]);
-	
-	int i;
-	for(i=1; i<poly->numVerts; i++)
-		min = cpfmin(min, cpvdot(n, verts[i]));
-	
-	return min - d;
-}
-
-// Returns true if the polygon contains the vertex.
-static inline int
-cpPolyShapeContainsVert(cpPolyShape *poly, cpVect v)
-{
-	cpPolyShapeAxis *axes = poly->tAxes;
-	
-	int i;
-	for(i=0; i<poly->numVerts; i++){
-		cpFloat dist = cpvdot(axes[i].n, v) - axes[i].d;
-		if(dist > 0.0) return 0;
-	}
-	
-	return 1;
-}
-
-// Same as cpPolyShapeContainsVert() but ignores faces pointing away from the normal.
-static inline int
-cpPolyShapeContainsVertPartial(cpPolyShape *poly, cpVect v, cpVect n)
-{
-	cpPolyShapeAxis *axes = poly->tAxes;
-	
-	int i;
-	for(i=0; i<poly->numVerts; i++){
-		if(cpvdot(axes[i].n, n) < 0.0f) continue;
-		cpFloat dist = cpvdot(axes[i].n, v) - axes[i].d;
-		if(dist > 0.0) return 0;
-	}
-	
-	return 1;
-}

data/ext/chipmunk/cpShape.c

@@ -1,244 +0,0 @@
-/* Copyright (c) 2007 Scott Lembcke
- * 
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- * 
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- * 
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
- 
-#include <stdlib.h>
-#include <assert.h>
-#include <stdio.h>
-
-#include "chipmunk.h"
-#include "math.h"
-
-unsigned int SHAPE_ID_COUNTER = 0;
-
-void
-cpResetShapeIdCounter(void)
-{
-	SHAPE_ID_COUNTER = 0;
-}
-
-
-cpShape*
-cpShapeInit(cpShape *shape, const cpShapeClass *klass, cpBody *body)
-{
-	shape->klass = klass;
-	
-	shape->id = SHAPE_ID_COUNTER;
-	SHAPE_ID_COUNTER++;
-	
-	assert(body != NULL);
-	shape->body = body;
-	
-	shape->e = 0.0f;
-	shape->u = 0.0f;
-	shape->surface_v = cpvzero;
-	
-	shape->collision_type = 0;
-	shape->group = 0;
-	shape->layers = 0xFFFF;
-	
-	shape->data = NULL;
-	
-	cpShapeCacheBB(shape);
-	
-	return shape;
-}
-
-void
-cpShapeDestroy(cpShape *shape)
-{
-	if(shape->klass->destroy) shape->klass->destroy(shape);
-}
-
-void
-cpShapeFree(cpShape *shape)
-{
-	if(shape) cpShapeDestroy(shape);
-	free(shape);
-}
-
-cpBB
-cpShapeCacheBB(cpShape *shape)
-{
-	cpBody *body = shape->body;
-	
-	shape->bb = shape->klass->cacheData(shape, body->p, body->rot);
-	return shape->bb;
-}
-
-int
-cpShapePointQuery(cpShape *shape, cpVect p){
-	return shape->klass->pointQuery(shape, p);
-}
-
-
-
-cpCircleShape *
-cpCircleShapeAlloc(void)
-{
-	return (cpCircleShape *)calloc(1, sizeof(cpCircleShape));
-}
-
-static inline cpBB
-bbFromCircle(const cpVect c, const cpFloat r)
-{
-	return cpBBNew(c.x-r, c.y-r, c.x+r, c.y+r);
-}
-
-static cpBB
-cpCircleShapeCacheData(cpShape *shape, cpVect p, cpVect rot)
-{
-	cpCircleShape *circle = (cpCircleShape *)shape;
-	
-	circle->tc = cpvadd(p, cpvrotate(circle->c, rot));
-	return bbFromCircle(circle->tc, circle->r);
-}
-
-static int
-cpCircleShapePointQuery(cpShape *shape, cpVect p){
-	cpCircleShape *circle = (cpCircleShape *)shape;
-	
-	cpFloat distSQ = cpvlengthsq(cpvsub(circle->tc, p));
-	return distSQ <= (circle->r*circle->r);
-}
-
-static const cpShapeClass circleClass = {
-	CP_CIRCLE_SHAPE,
-	cpCircleShapeCacheData,
-	NULL,
-	cpCircleShapePointQuery,
-};
-
-cpCircleShape *
-cpCircleShapeInit(cpCircleShape *circle, cpBody *body, cpFloat radius, cpVect offset)
-{
-	circle->c = offset;
-	circle->r = radius;
-	
-	cpShapeInit((cpShape *)circle, &circleClass, body);
-	
-	return circle;
-}
-
-cpShape *
-cpCircleShapeNew(cpBody *body, cpFloat radius, cpVect offset)
-{
-	return (cpShape *)cpCircleShapeInit(cpCircleShapeAlloc(), body, radius, offset);
-}
-
-cpSegmentShape *
-cpSegmentShapeAlloc(void)
-{
-	return (cpSegmentShape *)calloc(1, sizeof(cpSegmentShape));
-}
-
-static cpBB
-cpSegmentShapeCacheData(cpShape *shape, cpVect p, cpVect rot)
-{
-	cpSegmentShape *seg = (cpSegmentShape *)shape;
-	
-	seg->ta = cpvadd(p, cpvrotate(seg->a, rot));
-	seg->tb = cpvadd(p, cpvrotate(seg->b, rot));
-	seg->tn = cpvrotate(seg->n, rot);
-	
-	cpFloat l,r,s,t;
-	
-	if(seg->ta.x < seg->tb.x){
-		l = seg->ta.x;
-		r = seg->tb.x;
-	} else {
-		l = seg->tb.x;
-		r = seg->ta.x;
-	}
-	
-	if(seg->ta.y < seg->tb.y){
-		s = seg->ta.y;
-		t = seg->tb.y;
-	} else {
-		s = seg->tb.y;
-		t = seg->ta.y;
-	}
-	
-	cpFloat rad = seg->r;
-	return cpBBNew(l - rad, s - rad, r + rad, t + rad);
-}
-
-static int
-cpSegmentShapePointQuery(cpShape *shape, cpVect p){
-	cpSegmentShape *seg = (cpSegmentShape *)shape;
-	
-	// Calculate normal distance from segment.
-	cpFloat dn = cpvdot(seg->tn, p) - cpvdot(seg->ta, seg->tn);
-	cpFloat dist = fabs(dn) - seg->r;
-	if(dist > 0.0f) return 0;
-	
-	// Calculate tangential distance along segment.
-	cpFloat dt = -cpvcross(seg->tn, p);
-	cpFloat dtMin = -cpvcross(seg->tn, seg->ta);
-	cpFloat dtMax = -cpvcross(seg->tn, seg->tb);
-	
-	// Decision tree to decide which feature of the segment to collide with.
-	if(dt <= dtMin){
-		if(dt < (dtMin - seg->r)){
-			return 0;
-		} else {
-			return cpvlengthsq(cpvsub(seg->ta, p)) < (seg->r*seg->r);
-		}
-	} else {
-		if(dt < dtMax){
-			return 1;
-		} else {
-			if(dt < (dtMax + seg->r)) {
-				return cpvlengthsq(cpvsub(seg->tb, p)) < (seg->r*seg->r);
-			} else {
-				return 0;
-			}
-		}
-	}
-	
-	return 1;	
-}
-
-static const cpShapeClass segmentClass = {
-	CP_SEGMENT_SHAPE,
-	cpSegmentShapeCacheData,
-	NULL,
-	cpSegmentShapePointQuery,
-};
-
-cpSegmentShape *
-cpSegmentShapeInit(cpSegmentShape *seg, cpBody *body, cpVect a, cpVect b, cpFloat r)
-{
-	seg->a = a;
-	seg->b = b;
-	seg->n = cpvperp(cpvnormalize(cpvsub(b, a)));
-	
-	seg->r = r;
-	
-	cpShapeInit((cpShape *)seg, &segmentClass, body);
-	
-	return seg;
-}
-
-cpShape*
-cpSegmentShapeNew(cpBody *body, cpVect a, cpVect b, cpFloat r)
-{
-	return (cpShape *)cpSegmentShapeInit(cpSegmentShapeAlloc(), body, a, b, r);
-}