com.revolsys.gis.algorithm.index.quadtree

Class AbstractNode<T>

java.lang.Object

com.revolsys.gis.algorithm.index.quadtree.AbstractNode<T>

All Implemented Interfaces:

Serializable

Direct Known Subclasses:

IdObjectNode, Node

public abstract class AbstractNode<T>
extends Object
implements Serializable

See Also:

Serialized Form

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	AbstractNode()
	AbstractNode(int level, double... bounds)

Method Summary

Methods

Modifier and Type	Method and Description
void	add(QuadTree<T> tree, double[] bounds, T item)
void	clear()
AbstractNode<T>	createExpanded(AbstractNode<T> node, double[] bounds)
protected AbstractNode<T>	createNode(double[] bounds)
protected abstract AbstractNode<T>	createNode(int level, double... newBounds)
int	depth()
protected abstract void	doAdd(QuadTree<T> tree, double[] bounds, T item)
protected abstract void	doRemove(int index)
AbstractNode<T>	find(double[] bounds)
protected abstract double[]	getBounds(QuadTree<T> tree, int i)
protected abstract T	getItem(QuadTree<T> tree, int i)
abstract int	getItemCount()
AbstractNode<T>	getNode(double[] bounds)
protected AbstractNode<T>	getNode(int i)
protected int	getNodeCount()
boolean	hasChildren()
boolean	hasItems()
protected void	insertRoot(QuadTree<T> tree, double[] bounds, T item)
boolean	isEmpty()
boolean	isPrunable()
boolean	isRoot()
protected boolean	isSearchMatch(double[] bounds)
boolean	remove(QuadTree<T> tree, double[] bounds, T item)
protected void	setNode(int i, AbstractNode<T> node)
protected int	size()
String	toString()
boolean	visit(QuadTree<T> tree, double[] bounds, Visitor<T> visitor)
boolean	visit(QuadTree<T> tree, Visitor<T> visitor)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

AbstractNode

protected AbstractNode()

AbstractNode

public AbstractNode(int level,
            double... bounds)

Method Detail

add

public void add(QuadTree<T> tree,
       double[] bounds,
       T item)

clear

public void clear()

createExpanded

public AbstractNode<T> createExpanded(AbstractNode<T> node,
                             double[] bounds)

createNode

protected AbstractNode<T> createNode(double[] bounds)

createNode

protected abstract AbstractNode<T> createNode(int level,
                         double... newBounds)

depth

public int depth()

doAdd

protected abstract void doAdd(QuadTree<T> tree,
         double[] bounds,
         T item)

doRemove

protected abstract void doRemove(int index)

find

public AbstractNode<T> find(double[] bounds)

getBounds

protected abstract double[] getBounds(QuadTree<T> tree,
                 int i)

getItem

protected abstract T getItem(QuadTree<T> tree,
        int i)

getItemCount

public abstract int getItemCount()

getNode

public AbstractNode<T> getNode(double[] bounds)

getNode

protected AbstractNode<T> getNode(int i)

getNodeCount

protected int getNodeCount()

hasChildren

public boolean hasChildren()

hasItems

public boolean hasItems()

insertRoot

protected void insertRoot(QuadTree<T> tree,
              double[] bounds,
              T item)

isEmpty

public boolean isEmpty()

isPrunable

public boolean isPrunable()

isRoot

public boolean isRoot()

isSearchMatch

protected boolean isSearchMatch(double[] bounds)

remove

public boolean remove(QuadTree<T> tree,
             double[] bounds,
             T item)

setNode

protected void setNode(int i,
           AbstractNode<T> node)

size

protected int size()

toString

public String toString()

Overrides:

toString in class Object

visit

public boolean visit(QuadTree<T> tree,
            double[] bounds,
            Visitor<T> visitor)

visit

public boolean visit(QuadTree<T> tree,
            Visitor<T> visitor)