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

data/ext/chipmunk/cpSpaceHash.h

@@ -1,100 +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.
- */
-
-// The spatial hash is Chipmunk's default (and currently only) spatial index type.
-// Based on a chained hash table.
-
-// Used internally to track objects added to the hash
-typedef struct cpHandle{
-	// Pointer to the object
-	void *obj;
-	// Retain count
-	int retain;
-	// Query stamp. Used to make sure two objects
-	// aren't identified twice in the same query.
-	int stamp;
-} cpHandle;
-
-// Linked list element for in the chains.
-typedef struct cpSpaceHashBin{
-	cpHandle *handle;
-	struct cpSpaceHashBin *next;
-} cpSpaceHashBin;
-
-// BBox callback. Called whenever the hash needs a bounding box from an object.
-typedef cpBB (*cpSpaceHashBBFunc)(void *obj);
-
-typedef struct cpSpaceHash{
-	// Number of cells in the table.
-	int numcells;
-	// Dimentions of the cells.
-	cpFloat celldim;
-	
-	// BBox callback.
-	cpSpaceHashBBFunc bbfunc;
-
-	// Hashset of all the handles.
-	cpHashSet *handleSet;
-	
-	cpSpaceHashBin **table;
-	// List of recycled bins.
-	cpSpaceHashBin *bins;
-
-	// Incremented on each query. See cpHandle.stamp.
-	int stamp;
-} cpSpaceHash;
-
-//Basic allocation/destruction functions.
-cpSpaceHash *cpSpaceHashAlloc(void);
-cpSpaceHash *cpSpaceHashInit(cpSpaceHash *hash, cpFloat celldim, int cells, cpSpaceHashBBFunc bbfunc);
-cpSpaceHash *cpSpaceHashNew(cpFloat celldim, int cells, cpSpaceHashBBFunc bbfunc);
-
-void cpSpaceHashDestroy(cpSpaceHash *hash);
-void cpSpaceHashFree(cpSpaceHash *hash);
-
-// Resize the hashtable. (Does not rehash! You must call cpSpaceHashRehash() if needed.)
-void cpSpaceHashResize(cpSpaceHash *hash, cpFloat celldim, int numcells);
-
-// Add an object to the hash.
-void cpSpaceHashInsert(cpSpaceHash *hash, void *obj, unsigned int id, cpBB bb);
-// Remove an object from the hash.
-void cpSpaceHashRemove(cpSpaceHash *hash, void *obj, unsigned int id);
-
-// Iterator function
-typedef void (*cpSpaceHashIterator)(void *obj, void *data);
-// Iterate over the objects in the hash.
-void cpSpaceHashEach(cpSpaceHash *hash, cpSpaceHashIterator func, void *data);
-
-// Rehash the contents of the hash.
-void cpSpaceHashRehash(cpSpaceHash *hash);
-// Rehash only a specific object.
-void cpSpaceHashRehashObject(cpSpaceHash *hash, void *obj, unsigned int id);
-
-// Query callback.
-typedef int (*cpSpaceHashQueryFunc)(void *obj1, void *obj2, void *data);
-// Point query the hash. A reference to the query point is passed as obj1 to the query callback.
-void cpSpaceHashPointQuery(cpSpaceHash *hash, cpVect point, cpSpaceHashQueryFunc func, void *data);
-// Query the hash for a given BBox.
-void cpSpaceHashQuery(cpSpaceHash *hash, void *obj, cpBB bb, cpSpaceHashQueryFunc func, void *data);
-// Run a query for the object, then insert it. (Optimized case)
-void cpSpaceHashQueryInsert(cpSpaceHash *hash, void *obj, cpBB bb, cpSpaceHashQueryFunc func, void *data);
-// Rehashes while querying for each object. (Optimized case) 
-void cpSpaceHashQueryRehash(cpSpaceHash *hash, cpSpaceHashQueryFunc func, void *data);

data/ext/chipmunk/cpVect.c

@@ -1,63 +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 "stdio.h"
-#include "math.h"
-
-#include "chipmunk.h"
-
-cpFloat
-cpvlength(const cpVect v)
-{
-	return sqrtf( cpvdot(v, v) );
-}
-
-cpFloat
-cpvlengthsq(const cpVect v)
-{
-	return cpvdot(v, v);
-}
-
-cpVect
-cpvnormalize(const cpVect v)
-{
-	return cpvmult( v, 1.0f/cpvlength(v) );
-}
-
-cpVect
-cpvforangle(const cpFloat a)
-{
-	return cpv(cos(a), sin(a));
-}
-
-cpFloat
-cpvtoangle(const cpVect v)
-{
-	return atan2(v.y, v.x);
-}
-
-char*
-cpvstr(const cpVect v)
-{
-	static char str[256];
-	sprintf(str, "(% .3f, % .3f)", v.x, v.y);
-	return str;
-}

data/ext/chipmunk/cpVect.h

@@ -1,106 +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.
- */
- 
-typedef struct cpVect{
-	cpFloat x,y;
-} cpVect;
-
-static const cpVect cpvzero={0.0f,0.0f};
-
-static inline cpVect
-cpv(const cpFloat x, const cpFloat y)
-{
-	cpVect v = {x, y};
-	return v;
-}
-
-static inline cpVect
-cpvadd(const cpVect v1, const cpVect v2)
-{
-	return cpv(v1.x + v2.x, v1.y + v2.y);
-}
-
-static inline cpVect
-cpvneg(const cpVect v)
-{
-	return cpv(-v.x, -v.y);
-}
-
-static inline cpVect
-cpvsub(const cpVect v1, const cpVect v2)
-{
-	return cpv(v1.x - v2.x, v1.y - v2.y);
-}
-
-static inline cpVect
-cpvmult(const cpVect v, const cpFloat s)
-{
-	return cpv(v.x*s, v.y*s);
-}
-
-static inline cpFloat
-cpvdot(const cpVect v1, const cpVect v2)
-{
-	return v1.x*v2.x + v1.y*v2.y;
-}
-
-static inline cpFloat
-cpvcross(const cpVect v1, const cpVect v2)
-{
-	return v1.x*v2.y - v1.y*v2.x;
-}
-
-static inline cpVect
-cpvperp(const cpVect v)
-{
-	return cpv(-v.y, v.x);
-}
-
-static inline cpVect
-cpvrperp(const cpVect v)
-{
-	return cpv(v.y, -v.x);
-}
-
-static inline cpVect
-cpvproject(const cpVect v1, const cpVect v2)
-{
-	return cpvmult(v2, cpvdot(v1, v2)/cpvdot(v2, v2));
-}
-
-static inline cpVect
-cpvrotate(const cpVect v1, const cpVect v2)
-{
-	return cpv(v1.x*v2.x - v1.y*v2.y, v1.x*v2.y + v1.y*v2.x);
-}
-
-static inline cpVect
-cpvunrotate(const cpVect v1, const cpVect v2)
-{
-	return cpv(v1.x*v2.x + v1.y*v2.y, v1.y*v2.x - v1.x*v2.y);
-}
-
-cpFloat cpvlength(const cpVect v);
-cpFloat cpvlengthsq(const cpVect v); // no sqrt() call
-cpVect cpvnormalize(const cpVect v);
-cpVect cpvforangle(const cpFloat a); // convert radians to a normalized vector
-cpFloat cpvtoangle(const cpVect v); // convert a vector to radians
-char *cpvstr(const cpVect v); // get a string representation of a vector

data/ext/chipmunk/prime.h

@@ -1,68 +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.
- */
- 
-// Used for resizing hash tables.
-// Values approximately double.
-
-static int primes[] = {
-	5,          //2^2  + 1
-	11,         //2^3  + 3
-	17,         //2^4  + 1
-	37,         //2^5  + 5
-	67,         //2^6  + 3
-	131,        //2^7  + 3
-	257,        //2^8  + 1
-	521,        //2^9  + 9
-	1031,       //2^10 + 7
-	2053,       //2^11 + 5
-	4099,       //2^12 + 3
-	8209,       //2^13 + 17
-	16411,      //2^14 + 27
-	32771,      //2^15 + 3
-	65537,      //2^16 + 1
-	131101,     //2^17 + 29
-	262147,     //2^18 + 3
-	524309,     //2^19 + 21
-	1048583,    //2^20 + 7
-	2097169,    //2^21 + 17
-	4194319,    //2^22 + 15
-	8388617,    //2^23 + 9
-	16777259,   //2^24 + 43
-	33554467,   //2^25 + 35
-	67108879,   //2^26 + 15
-	134217757,  //2^27 + 29
-	268435459,  //2^28 + 3
-	536870923,  //2^29 + 11
-	1073741827, //2^30 + 3
-	0,
-};
-
-static int
-next_prime(int n)
-{
-	int i = 0;
-	while(n > primes[i]){
-		i++;
-		assert(primes[i]); // realistically this should never happen
-	}
-	
-	return primes[i];
-}

data/ext/chipmunk/rb_cpJoint.c

@@ -1,136 +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 "chipmunk.h"
-
-#include "ruby.h"
-#include "rb_chipmunk.h"
-
-VALUE m_cpJoint;
-
-static VALUE
-rb_cpPinJointAlloc(VALUE klass)
-{
-	cpPinJoint *joint = cpPinJointAlloc();
-	VALUE self = Data_Wrap_Struct(klass, NULL, cpJointFree, joint);
-	
-	return self;
-}
-
-static VALUE
-rb_cpPinJointInit(VALUE self, VALUE a, VALUE b, VALUE anchr1, VALUE anchr2)
-{
-	cpPinJoint *joint = (cpPinJoint *)JOINT(self);
-	cpPinJointInit(joint, BODY(a), BODY(b), *VGET(anchr1), *VGET(anchr2));
-	rb_iv_set(self, "body_a", a);
-	rb_iv_set(self, "body_b", b);
-	
-	return self;
-}
-
-
-static VALUE
-rb_cpSlideJointAlloc(VALUE klass)
-{
-	cpSlideJoint *joint = cpSlideJointAlloc();
-	VALUE self = Data_Wrap_Struct(klass, NULL, cpJointFree, joint);
-	
-	return self;
-}
-
-static VALUE
-rb_cpSlideJointInit(VALUE self, VALUE a, VALUE b, VALUE anchr1, VALUE anchr2, VALUE min, VALUE max)
-{
-	cpSlideJoint *joint = (cpSlideJoint *)JOINT(self);
-	cpSlideJointInit(joint, BODY(a), BODY(b), *VGET(anchr1), *VGET(anchr2), NUM2DBL(min), NUM2DBL(max));
-	rb_iv_set(self, "body_a", a);
-	rb_iv_set(self, "body_b", b);
-	
-	return self;
-}
-
-
-static VALUE
-rb_cpPivotJointAlloc(VALUE klass)
-{
-	cpPivotJoint *joint = cpPivotJointAlloc();
-	VALUE self = Data_Wrap_Struct(klass, NULL, cpJointFree, joint);
-	
-	return self;
-}
-
-static VALUE
-rb_cpPivotJointInit(VALUE self, VALUE a, VALUE b, VALUE pivot)
-{
-	cpPivotJoint *joint = (cpPivotJoint *)JOINT(self);
-	cpPivotJointInit(joint, BODY(a), BODY(b), *VGET(pivot));
-	rb_iv_set(self, "body_a", a);
-	rb_iv_set(self, "body_b", b);
-	
-	return self;
-}
-
-
-static VALUE
-rb_cpGrooveJointAlloc(VALUE klass)
-{
-	cpGrooveJoint *joint = cpGrooveJointAlloc();
-	VALUE self = Data_Wrap_Struct(klass, NULL, cpJointFree, joint);
-	
-	return self;
-}
-
-static VALUE
-rb_cpGrooveJointInit(VALUE self, VALUE a, VALUE b, VALUE grv_a, VALUE grv_b, VALUE anchr2)
-{
-	cpGrooveJoint *joint = (cpGrooveJoint *)JOINT(self);
-	cpGrooveJointInit(joint, BODY(a), BODY(b), *VGET(grv_a), *VGET(grv_b), *VGET(anchr2));
-	rb_iv_set(self, "body_a", a);
-	rb_iv_set(self, "body_b", b);
-	
-	return self;
-}
-
-void
-Init_cpJoint(void)
-{
-	m_cpJoint = rb_define_module_under(m_Chipmunk, "Joint");	
-	
-	VALUE c_cpPinJoint = rb_define_class_under(m_cpJoint, "Pin", rb_cObject);
-	rb_include_module(c_cpPinJoint, m_cpJoint);
-	rb_define_alloc_func(c_cpPinJoint, rb_cpPinJointAlloc);
-	rb_define_method(c_cpPinJoint, "initialize", rb_cpPinJointInit, 4);
-	
-	VALUE c_cpSlideJoint = rb_define_class_under(m_cpJoint, "Slide", rb_cObject);
-	rb_include_module(c_cpSlideJoint, m_cpJoint);
-	rb_define_alloc_func(c_cpSlideJoint, rb_cpSlideJointAlloc);
-	rb_define_method(c_cpSlideJoint, "initialize", rb_cpSlideJointInit, 6);
-	
-	VALUE c_cpPivotJoint = rb_define_class_under(m_cpJoint, "Pivot", rb_cObject);
-	rb_include_module(c_cpPivotJoint, m_cpJoint);
-	rb_define_alloc_func(c_cpPivotJoint, rb_cpPivotJointAlloc);
-	rb_define_method(c_cpPivotJoint, "initialize", rb_cpPivotJointInit, 3);
-	
-	VALUE c_cpGrooveJoint = rb_define_class_under(m_cpJoint, "Groove", rb_cObject);
-	rb_include_module(c_cpGrooveJoint, m_cpJoint);
-	rb_define_alloc_func(c_cpGrooveJoint, rb_cpGrooveJointAlloc);
-	rb_define_method(c_cpGrooveJoint, "initialize", rb_cpGrooveJointInit, 5);
-}