Examples of nodes.IntervalNode

nodes.IntervalNode
Class IntervalNode represents a node for an Interval Tree ADT.
This class extends the class Node and uses its value as a key while adding another field that represents the interval.
Just as the Node and the Interval, values (key and interval) are immutable. @see Node @author Eugene Krapivin @version 1.0 27/04/12

   * 
   * @deprecated
   */
  public IntervalTree()
  {
    root = new IntervalNode();
    treeSetMax(root);
  }

View Full Code Here

   * @param high
   *            The high end of the interval
   */
  public IntervalTree(Comparable low, Comparable high)
  {
    this(new IntervalNode(low, high));
  }

View Full Code Here

   */
  public void insert(Comparable low, Comparable high)
  {
    try
    {
      insert(new IntervalNode(low, high));
    }
    catch (InvalidIntervalException ex)
    {
      System.out.println(ex.getMessage());
    }

View Full Code Here

   */
  public void search(Comparable p, List<IntervalNode> result)
  {
    try
    {
      search((IntervalNode) root, new IntervalNode(p, p), result);
    }
    catch (InvalidIntervalException ex)
    {
      System.out.println(ex.getMessage());
    }

View Full Code Here

   */
  public Vector<MileStone> search(Comparable low, Comparable high)
  {
    Vector<IntervalNode> result = new Vector<IntervalNode>();


    super.search(new IntervalNode(low, high), result);


    Vector<MileStone> finalResult = new Vector<MileStone>();


    for (IntervalNode i : result)
    {

View Full Code Here

TOP

Related Classes of nodes.IntervalNode

trees.IntervalTree

trees.MileStoneTree

exceptions.InvalidIntervalException

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.