                 @_autoIncrement++
             id = @_autoIncrement
 
-        itvl = new Interval(start, end, id)
+        interval = new Interval(start, end, id)
 
-        @pointTree.insert new Point(itvl.start, id)
-        @pointTree.insert new Point(itvl.end,   id)
+        @pointTree.insert new Point(interval.start, id)
+        @pointTree.insert new Point(interval.end,   id)
 
-        @intervalsById[id] = itvl
+        @intervalsById[id] = interval
 
-        @insert @root, itvl
-
+        @insert @root, interval
 
 
     search: (val1, val2) ->

        @root = new Node(center)


    insert: (node, itvl) ->

        if itvl.end < node.center

            newCenter = itvl.end

            node.left ?= new Node(newCenter)

            return @insert(node.left, itvl)

        if node.center < itvl.start

            middle = (itvl.start + itvl.end) / 2

            node.right ?= new Node(middle)

            return @insert(node.right, itvl)

        node.insert itvl

        return


    ###*
    search intervals

    @method pointSearch
    @private

                return

            Object.keys(resultHash).forEach (id) =>
                interval = @intervalsById[id]
                arr.push interval.result(start, end)
                return


