           I.children.push(item)
           
           if (I.depth >= I.maxDepth) && (I.children.length > I.maxChildren)
+            log "got here"
             self.subdivide()
             
             I.children.each (child) ->

  
      self =
        I: I
      
        clear: -> root.clear()
      

        return index
        
      self =
        I: I
        
        clear: ->
          I.children.clear()
          
