Class leda.ps_tree 
All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class leda.ps_tree 

java.lang.Object
   |
   +----leda.ps_tree
public class ps_tree
extends Object
LEDA's priority search tree, laboriously ported to java.

Variable Index

o BSTACKSIZE
according to tree.size and alpha here: tree.size <= 10^9 alpha = 0.25 ( worst case )
o alpha
o anzahl
o d
o left
o right
o root
o st

Constructor Index

o ps_tree()

Method Index

o cmp(int, int)
o cmp(int, int, int, int)
o del(int, int)
o delleaf(ps_item)
o deltree(ps_item)
o enumerate(int, int, int, ps_item)
o enumerate(int, int, int)
o fill(ps_item)
o insert(int, int)
o ldrot(ps_item, ps_item)
o locate(int, int)
o lrot(ps_item, ps_item)
o max_x_in_rect(int, int, int, ps_item)
o max_x_in_rect(int, int, int)
o min_x_in_rect(int, int, int, ps_item)
o min_x_in_rect(int, int, int)
o min_y_in_xrange(int, int, ps_item)
o min_y_in_xrange(int, int)
o rdrot(ps_item, ps_item)
o rrot(ps_item, ps_item)
o search(int, int)
o sink(ps_item, int, int)
o split_value_x(ps_item)
o split_value_y(ps_item)
o x_value(ps_item)
o y_value(ps_item)

Variables

o root 
  protected ps_item root
o anzahl 
  protected int anzahl
o alpha 
  protected double alpha
o d 
  protected double d
o st 
  protected b_stack st
o BSTACKSIZE 
  protected final static int BSTACKSIZE
according to tree.size and alpha here: tree.size <= 10^9 alpha = 0.25 ( worst case )
o left 
  protected final static int left
o right 
  protected final static int right

Constructors

o ps_tree 
  public ps_tree()

Methods

o lrot 
  protected void lrot(ps_item p,
                      ps_item q)
o rrot 
  protected void rrot(ps_item p,
                      ps_item q)
o ldrot 
  protected void ldrot(ps_item p,
                       ps_item q)
o rdrot 
  protected void rdrot(ps_item p,
                       ps_item q)
o fill 
  protected void fill(ps_item p)
o sink 
  protected ps_item sink(ps_item q,
                         int x,
                         int y)
o search 
  protected ps_item search(int x,
                           int y)
o locate 
  protected ps_item locate(int x,
                           int y)
o delleaf 
  protected void delleaf(ps_item q)
o insert 
  public ps_item insert(int x,
                        int y)
o del 
  public ps_item del(int x,
                     int y)
o enumerate 
  protected void enumerate(int x1,
                           int x2,
                           int y0,
                           ps_item p)
o min_x_in_rect 
  protected pair_item min_x_in_rect(int x1,
                                    int x2,
                                    int y0,
                                    ps_item p)
o max_x_in_rect 
  protected pair_item max_x_in_rect(int x1,
                                    int x2,
                                    int y0,
                                    ps_item p)
o min_y_in_xrange 
  protected pair_item min_y_in_xrange(int x1,
                                      int x2,
                                      ps_item p)
o deltree 
  protected void deltree(ps_item p)
o cmp 
  public int cmp(int x,
                 int y)
o cmp 
  public int cmp(int x1,
                 int y1,
                 int x2,
                 int y2)
o x_value 
  public int x_value(ps_item it)
o y_value 
  public int y_value(ps_item it)
o split_value_x 
  public int split_value_x(ps_item it)
o split_value_y 
  public int split_value_y(ps_item it)
o min_x_in_rect 
  public pair_item min_x_in_rect(int x1,
                                 int x2,
                                 int y0)
o max_x_in_rect 
  public pair_item max_x_in_rect(int x1,
                                 int x2,
                                 int y0)
o min_y_in_xrange 
  public pair_item min_y_in_xrange(int x1,
                                   int x2)
o enumerate 
  public void enumerate(int x1,
                        int x2,
                        int y0)

All Packages  Class Hierarchy  This Package  Previous  Next  Index