chipmunk 5.3.4.5 → 6.1.3.0.rc1

data/ext/chipmunk/cpCollision.h

@@ -1,28 +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 delete this header?
-
-// Collides two cpShape structures.
-// Returns the number of contact points added to arr
-// which should be at least CP_MAX_CONTACTS_PER_ARBITER in length.
-// This function is very lonely in this header :(
-int cpCollideShapes(const cpShape *a, const cpShape *b, cpContact *arr);

data/ext/chipmunk/cpHashSet.h

@@ -1,82 +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.
- */
- 
-// cpHashSet uses a chained hashtable implementation.
-// Other than the transformation functions, there is nothing fancy going on.
-
-// cpHashSetBin's form the linked lists in the chained hash table.
-typedef struct cpHashSetBin {
-	// Pointer to the element.
-	CP_PRIVATE(void *elt);
-	// Hash value of the element.
-	CP_PRIVATE(cpHashValue hash);
-	// Next element in the chain.
-	CP_PRIVATE(struct cpHashSetBin *next);
-} cpHashSetBin;
-
-// Equality function. Returns true if ptr is equal to elt.
-typedef cpBool (*cpHashSetEqlFunc)(void *ptr, void *elt);
-// Used by cpHashSetInsert(). Called to transform the ptr into an element.
-typedef void *(*cpHashSetTransFunc)(void *ptr, void *data);
-
-typedef struct cpHashSet {
-	// Number of elements stored in the table.
-	CP_PRIVATE(int entries);
-	// Number of cells in the table.
-	CP_PRIVATE(int size);
-	
-	CP_PRIVATE(cpHashSetEqlFunc eql);
-	CP_PRIVATE(cpHashSetTransFunc trans);
-	
-	// Default value returned by cpHashSetFind() when no element is found.
-	// Defaults to NULL.
-	CP_PRIVATE(void *default_value);
-	
-	// The table and recycled bins
-	CP_PRIVATE(cpHashSetBin **table);
-	CP_PRIVATE(cpHashSetBin *pooledBins);
-	
-	CP_PRIVATE(cpArray *allocatedBuffers);
-} cpHashSet;
-
-// Basic allocation/destruction functions.
-void cpHashSetDestroy(cpHashSet *set);
-void cpHashSetFree(cpHashSet *set);
-
-cpHashSet *cpHashSetAlloc(void);
-cpHashSet *cpHashSetInit(cpHashSet *set, int size, cpHashSetEqlFunc eqlFunc, cpHashSetTransFunc trans);
-cpHashSet *cpHashSetNew(int size, cpHashSetEqlFunc eqlFunc, cpHashSetTransFunc trans);
-
-// Insert an element into the set, returns the element.
-// If it doesn't already exist, the transformation function is applied.
-void *cpHashSetInsert(cpHashSet *set, cpHashValue hash, void *ptr, void *data);
-// Remove and return an element from the set.
-void *cpHashSetRemove(cpHashSet *set, cpHashValue hash, void *ptr);
-// Find an element in the set. Returns the default value if the element isn't found.
-void *cpHashSetFind(cpHashSet *set, cpHashValue hash, void *ptr);
-
-// Iterate over a hashset.
-typedef void (*cpHashSetIterFunc)(void *elt, void *data);
-void cpHashSetEach(cpHashSet *set, cpHashSetIterFunc func, void *data);
-
-// Iterate over a hashset, drop the element if the func returns false.
-typedef cpBool (*cpHashSetFilterFunc)(void *elt, void *data);
-void cpHashSetFilter(cpHashSet *set, cpHashSetFilterFunc func, void *data);

data/ext/chipmunk/cpSpaceHash.h

@@ -1,110 +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.
-	cpTimestamp 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.
-	CP_PRIVATE(int numcells);
-	// Dimentions of the cells.
-	CP_PRIVATE(cpFloat celldim);
-	
-	// BBox callback.
-	CP_PRIVATE(cpSpaceHashBBFunc bbfunc);
-
-	// Hashset of the handles and the recycled ones.
-	CP_PRIVATE(cpHashSet *handleSet);
-	CP_PRIVATE(cpArray *pooledHandles);
-	
-	// The table and the recycled bins.
-	CP_PRIVATE(cpSpaceHashBin **table);
-	CP_PRIVATE(cpSpaceHashBin *pooledBins);
-	
-	// list of buffers to free on destruction.
-	CP_PRIVATE(cpArray *allocatedBuffers);
-	
-	// Incremented on each query. See cpHandle.stamp.
-	CP_PRIVATE(cpTimestamp 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 _deprecated_ignored);
-// 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/lib/chipmunk.rb

@@ -1,194 +0,0 @@
-# this redirection script by John Mair (banisterfiend)
-
-require 'rbconfig'
-
-direc = File.dirname(__FILE__)
-dlext = Config::CONFIG['DLEXT']
-begin
-    if RUBY_VERSION && RUBY_VERSION =~ /1.9/
-        require "#{direc}/1.9/chipmunk.#{dlext}"
-    else
-        require "#{direc}/1.8/chipmunk.#{dlext}"
-    end
-rescue LoadError => e
-    require "#{direc}/chipmunk.#{dlext}"
-end
-
-
-# Add some constants to CP here, so we don't need 
-# to do it in the C code.
-# Let's cheat a bit here.. :p
-
-module CP
-  VERSION    = '5.4.3' 
-  ZERO_VEC_2 = Vec2.new(0,0).freeze
-  ALL_ONES   = Vec2.new(1,1).freeze
-end  
- 
-# Extra functionality added by Slembkce and Beoran.
-
-module CP
-  # Chipmunk Object
-  # Makes it easier to manage complex objects that reference many primitive
-  # Chipmunk objects such as bodies shapes and constraints.
-  # New composite objects simply need to include CP::Object and call
-  # init_chipmunk_object(*objects) with the composite and primitive Chipmunk
-  # objects that make up itself.
-  module Object
-    # Returns the list of primitive Chipmunk objects (bodies, shapes and
-    # constraints that this composite object references directly and indirectly.
-    def chipmunk_objects
-      if @chipmunk_objects
-        return @chipmunk_objects
-      else
-        raise "This CP::Object (#{self.class}) did not call #init_chipmunk_object."
-      end
-    end
-    
-    private
-    # Should be called during initialization of a CP::Object to set what primitive
-    # and composite Chipmunk objects this object references.
-    def init_chipmunk_object(*objs)
-      bad_objs = objs.reject{|obj| obj.is_a?(CP::Object)}
-      unless bad_objs.empty?
-        raise(ArgumentError, "The following objects: #{bad_objs.inspect} are not CP::Objects")
-      end
-      @chipmunk_objects = objs.inject([]){|sum, obj| sum + obj.chipmunk_objects}.uniq
-    end
-  end
-  
-  class Body
-    include CP::Object
-
-    def chipmunk_objects
-      [self]
-    end
-    
-    def add_to_space(space)
-      space.add_body(self)
-    end
-    
-    def remove_from_space(space)
-      space.remove_body(self)
-    end
-    
-  end
-  
-  module Shape
-    include CP::Object
-    
-    def chipmunk_objects
-      [self]
-    end
-    
-    def add_to_space(space)
-      space.add_shape(self)
-    end
-    
-    def remove_from_space(space)
-      space.remove_shape(self)
-    end
-  end
-    
-  module Constraint
-    include CP::Object
-    
-    def chipmunk_objects
-      [self]
-    end
-    
-    def add_to_space(space)
-      space.add_constraint(self)
-    end
-    
-    def remove_from_space(space)
-      space.remove_constraint(self)
-    end
-  end
-  
-  class Space
-    def add_object(obj)
-      obj.chipmunk_objects.each{|elt| elt.add_to_space(self)}
-    end
-    
-    def add_objects(*objs)
-      objs.each{|obj| add_object(obj)}
-    end
-    
-    def remove_object(obj)
-      obj.chipmunk_objects.each{|elt| elt.remove_from_space(self)}
-    end
-    
-    def remove_objects(*objs)
-      objs.each{|obj| remove_object(obj)}
-    end
-    
-  end
-  
-  class Vec2
-    ZERO = Vec2.new(0,0).freeze
-  end
-  
-  # define the helpers here( easier than in the extension.
-  class SegmentQueryInfo
-    def hit_point(start, stop)
-      return start.lerp(stop, self.t)
-    end
-    
-    def hit_dist(start, stop)
-      return start.dist(stop) * self.t
-    end
-  end  
-  
-  
-end
-
-
-# Create derived static objects that know to add themselves as static.
-module CP
-  class BodyStatic < Body
-    def initialize
-      super(Float::INFINITY, Float::INFINITY)
-    end
-    
-    def chipmunk_objects
-      # return [] instead of [self] so the static body will not be added.
-      []
-    end
-  end
-  
-  class StaticBody
-    def chipmunk_objects
-      # return [] instead of [self] so the static body will not be added.
-      []
-    end
-  end
-  
-  module StaticShape
-    include Shape
-    
-    class Circle < Shape::Circle
-      include StaticShape
-    end
-    
-    class Segment < Shape::Segment
-      include StaticShape
-    end
-    
-    class Poly < Shape::Poly
-      include StaticShape
-    end
-
-    def add_to_space(space)
-      space.add_static_shape(self)
-    end
-    
-    def remove_from_space(space)
-      space.remove_static_shape(self)
-    end
-  end
-end
- 
-
-
-