Method AdjustTree

JSAT/src/jsat/linear/vectorcollection/RTree.java:776–826

(RNode<V> L, RNode<V> LL)

    }
    
    private void AdjustTree(RNode<V> L, RNode<V> LL)
    {
        /*
         * AT1 [Imtlahze.] Set N=L If L was split
         * previously, set NN to be the resultmg
         * second node
         */
        RNode<V> N = L, NN = LL;
        
        while(N != root)//AT2 [Check If done ] If N 1s the root, stop
        {
            /*
             * AT3 [Adjust covermg rectangle m parent
             * entry ] Let P be the parent node of
             * N, and let EN be N’s entry in P
             * Adjust EN I so that it tightly encloses
             * all entry rectangles in N.
             */
            RNode<V> P = N.parent;
            P.bound.adjustToContain(N.bound);//P alread contains us, so we dont add ourselves again!
            if(NN != null)
            {
                /*
                 * AT4 [Propagate node split upward] If N has a partner NN resultmg from an
                 * earher spht, create a new entry Em with ENNp pointmg to NN and Em I
                 * enclosing all rectangles in NN. Add Em to P If there is room. Otherwise,
                 * invoke SplitNode to produce P and PP containing Em and all P’s old
                 * entries
                 */
                if(P.add(NN))
                    NN = splitNode(P); //Asignment is part of step AT5 below
                else
                    NN = null;
            }
            /*
             * AT5 [Move up to next level.] Set N=P and
             * set NN=PP If a spht occurred,
             * Repeat from AT2.
             */
            N = P;
        }
        
        //Step I4 [Grow tree taller]
        if(NN != null)//That means we caues the root to split! Need a new root!
        {
            root = new RNode<V>();
            root.add(N);
            root.add(NN);
        }
        
    }
    
    public void add(V v)
    {