package com.github.davidmoten.rtree;

import java.util.List;

import com.google.common.base.Optional;

public class NodeAndEntries<T> {

    private final Optional<? extends Node<T>> node;
    private final List<Entry<T>> entries;
    private final int count;

    public NodeAndEntries(Optional<? extends Node<T>> node, List<Entry<T>> entries, int countDeleted) {
        this.node = node;
        this.entries = entries;
        this.count = countDeleted;
    }

    public Optional<? extends Node<T>> node() {
        return node;
    }

    public List<Entry<T>> entriesToAdd() {
        return entries;
    }

    public int countDeleted() {
        return count;
    }

}

@@ -96,16 +96,123 @@
 ional;%0A%0A
+/**%0A * Used for tracking deletions through recursive calls.%0A * %0A * @param %3CT%3E%0A *            entry type%0A */%0A
 public c
@@ -361,16 +361,535 @@
 count;%0A%0A
+    /**%0A     * Constructor.%0A     * %0A     * @param node%0A     *            absent = whole node was deleted present = either an unchanged%0A     *            node because of no removal or the newly created node without%0A     *            the deleted entry%0A     * @param entries%0A     *            from nodes that dropped below minChildren in size and thus%0A     *            their entries are to be redistributed (readded to the tree)%0A     * @param countDeleted%0A     *            count of the number of entries removed%0A     */%0A
     publ

add javadoc