-
Notifications
You must be signed in to change notification settings - Fork 0
/
Node.java
51 lines (47 loc) · 1.36 KB
/
Node.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
import java.awt.Point;
import java.util.ArrayList;
/**
* // -------------------------------------------------------------------------
/**
* A basic Node in a Quadtree. Can return information about the items and keys
* in the tree.
* @param <T> the class tyoe of the elements stored in the tree this node is a
* part of
*
* @author Joshua Rush
* @author Benjamin Roble
* @version Oct 9, 2011
*/
public abstract class Node<T> {
/**
* Create a Node
*/
Handle handle;
// empty constructor, as the memory manager will assign a handle later
public Node()
{
//empty constructor
}
public Node(int pPos)
{
handle = new Handle(pPos);
}
/**
* Return the number of items contained within this node, or in all nodes
* that are children of this node.
* @return the number of items
*/
public abstract int getItemCount();
/**
* Return a list of all the items contained within this node, or in all nodes
* that are children of this node.
* @return an ArrayList containing all the items
*/
public abstract ArrayList<T> getItems();
/**
* Return a list of all the keys contained within this node, or in all nodes
* that are children of this node.
* @return an ArrayList containing all the keys
*/
public abstract ArrayList<Point> getKeys();
}