# Class: dspacehash

Multi-resolution hash table space. This uses an internal data structure that records how each geom overlaps cells in one of several three dimensional grids. Each grid has cubical cells of side lengths 2^i, where i is an integer that ranges from a minimum to a maximum value. The time required to do intersection testing for n objects is O(n) (as long as those objects are not clustered together too closely), as each object can be quickly paired with the objects around it.

## Hierarchy

    o-+ ode
      o-+ dcollider
        o-+ dspace
          o-+ dspacehash

## Methods:

new ([dspace space])
  returns: (dspacehash)
  creates a hashspace, if space is given, the new space is inserted in the given space

## Inherited Methods:

### From dspace

add, collidetest, delete, geomcount, get, query, remove

### From dcollider

delete, test, testnear, testtriarray