chipmunk 5.2.2 → 5.3.4.0

data/ext/chipmunk/include/chipmunk/cpSpaceHash.h

@@ -1,109 +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 the handles and the recycled ones.
-	cpHashSet *handleSet;
-	cpArray *pooledHandles;
-	
-	// The table and the recycled bins.
-	cpSpaceHashBin **table, *pooledBins;
-	
-	// list of buffers to free on destruction.
-	cpArray *allocatedBuffers;
-	
-	// 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, cpHashValue id, cpBB bb);
-// Remove an object from the hash.
-void cpSpaceHashRemove(cpSpaceHash *hash, void *obj, cpHashValue 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, cpHashValue id);
-
-// Query callback.
-typedef void (*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);
-
-// Segment Query callback.
-// Return value is uesd for early exits of the query.
-// If while traversing the grid, the raytrace function detects that an entire grid cell is beyond the hit point, it will stop the trace.
-typedef cpFloat (*cpSpaceHashSegmentQueryFunc)(void *obj1, void *obj2, void *data);
-void cpSpaceHashSegmentQuery(cpSpaceHash *hash, void *obj, cpVect a, cpVect b, cpFloat t_exit, cpSpaceHashSegmentQueryFunc func, void *data);

data/ext/chipmunk/include/chipmunk/cpVect.h

@@ -1,157 +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.
- */
-
-static const cpVect cpvzero={0.0f,0.0f};
-
-static inline cpVect
-cpv(const cpFloat x, const cpFloat y)
-{
-	cpVect v = {x, y};
-	return v;
-}
-
-// non-inlined functions
-cpFloat cpvlength(const cpVect v);
-cpVect cpvslerp(const cpVect v1, const cpVect v2, const cpFloat t);
-cpVect cpvslerpconst(const cpVect v1, const cpVect v2, const cpFloat a);
-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
-
-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);
-}
-
-static inline cpFloat
-cpvlengthsq(const cpVect v)
-{
-	return cpvdot(v, v);
-}
-
-static inline cpVect
-cpvlerp(const cpVect v1, const cpVect v2, const cpFloat t)
-{
-	return cpvadd(cpvmult(v1, 1.0f - t), cpvmult(v2, t));
-}
-
-static inline cpVect
-cpvnormalize(const cpVect v)
-{
-	return cpvmult(v, 1.0f/cpvlength(v));
-}
-
-static inline cpVect
-cpvnormalize_safe(const cpVect v)
-{
-	return (v.x == 0.0f && v.y == 0.0f ? cpvzero : cpvnormalize(v));
-}
-
-static inline cpVect
-cpvclamp(const cpVect v, const cpFloat len)
-{
-	return (cpvdot(v,v) > len*len) ? cpvmult(cpvnormalize(v), len) : v;
-}
-
-static inline cpVect
-cpvlerpconst(cpVect v1, cpVect v2, cpFloat d)
-{
-	return cpvadd(v1, cpvclamp(cpvsub(v2, v1), d));
-}
-
-static inline cpFloat
-cpvdist(const cpVect v1, const cpVect v2)
-{
-	return cpvlength(cpvsub(v1, v2));
-}
-
-static inline cpFloat
-cpvdistsq(const cpVect v1, const cpVect v2)
-{
-	return cpvlengthsq(cpvsub(v1, v2));
-}
-
-static inline int
-cpvnear(const cpVect v1, const cpVect v2, const cpFloat dist)
-{
-	return cpvdistsq(v1, v2) < dist*dist;
-}

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.
-// http://planetmath.org/encyclopedia/GoodHashTablePrimes.html
-static int primes[] = {
-	5,
-	13,
-	23,
-	47,
-	97,
-	193,
-	389,
-	769,
-	1543,
-	3079,
-	6151,
-	12289,
-	24593,
-	49157,
-	98317,
-	196613,
-	393241,
-	786433,
-	1572869,
-	3145739,
-	6291469,
-	12582917,
-	25165843,
-	50331653,
-	100663319,
-	201326611,
-	402653189,
-	805306457,
-	1610612741,
-	0,
-};
-
-static inline int
-next_prime(int n)
-{
-	int i = 0;
-	while(n > primes[i]){
-		i++;
-		cpAssert(primes[i], "Tried to resize a hash table to a size greater than 1610612741 O_o"); // realistically this should never happen
-	}
-	
-	return primes[i];
-}

data/lib/chipmunk/version.rb

@@ -1,3 +0,0 @@
-module Chipmunk
-  VERSION = "5.2.2"
-end