aud.example.BinarySearchTreeExample Class Reference

example: insert, remove, and restructure entries More...

Inheritance diagram for aud.example.BinarySearchTreeExample:

Collaboration diagram for aud.example.BinarySearchTreeExample:

Public Member Functions
	BinarySearchTreeExample (BinarySearchTree< String, String > tree)
	create application instance More...
Public Member Functions inherited from aud.util.SingleStepper
	SingleStepper (JFrame parent)
	create new instance More...
	SingleStepper (String caption)
	create new instance More...
JFrame	parent ()
	get parent widget More...
void	halt (String text, int timeout)
	display text and wait for user or timeout More...
void	setTimeout (int timeout)
	Set global timeout. More...
SingleStepper	whereAmI ()
	print location of calling code More...
SingleStepper	showSource ()
	jmp to caller's location in editor (emacs only) More...
void	halt (String text)
	display text and wait for user (or global timeout) More...
void	halt ()
	wait for user More...

Static Public Member Functions
static void	main (String[] args)
	Start interactive example. More...
static void	main (String[] args)

Protected Member Functions
void	onHalt ()
Protected Member Functions inherited from aud.util.SingleStepper
JComponent	createComponents ()
void	onNext ()
	call on button pressed More...
void	println (String text)
	print to both, text area and stdout More...
void	onHalt ()

Protected Attributes
BinarySearchTree< String, String >	tree_ = null
DotViewer	viewer_
BinarySearchTree< String, String >.Decorator	decorator_
Protected Attributes inherited from aud.util.SingleStepper
JFrame	frame
JTextArea	history
JButton	next
Object	monitor = new Object()
int	timeout = 0

Detailed Description

example: insert, remove, and restructure entries

See also

BinarySearchTree

Definition at line 10 of file BinarySearchTreeExample.java.

Constructor & Destructor Documentation

BinarySearchTreeExample()

aud.example.BinarySearchTreeExample.BinarySearchTreeExample

(

BinarySearchTree< String, String >

tree

)

create application instance

Definition at line 19 of file BinarySearchTreeExample.java.

                                                                       {
    super("aud.example.BinarySearchTreeExample");
    tree_=tree;
    decorator_=(BinarySearchTree.Decorator)
      //(BinarySearchTree<String,String>.Decorator) // compile fails on some platforms!?
      tree_.getDecorator(); // same per tree
  }

References aud.example.BinarySearchTreeExample.decorator_, and aud.example.BinarySearchTreeExample.tree_.

Member Function Documentation

main()

static void aud.example.BinarySearchTreeExample.main ( String[]  args )

static

Start interactive example.

Type '?' for help.

Reimplemented from aud.util.SingleStepper.

Definition at line 35 of file BinarySearchTreeExample.java.

                                         {
 
    final String HELP=
      "usage: java aud.example.BinarySearchTreeExample\n"+
      "       Reads and insert words from standard input.\n"+
      "\tWords may be prefixed with a single character, e.g., '-x':\n"+
      "\t- '-' remove from the tree.\n"+
      "\t- '/' apply right rotation to left-left case with key as root\n"+
      "\t- '\\' apply left rotation to right-right case with key as root\n"+
      "\t- '<' apply double rotation to right-left case with key as root\n"+
      "\t- '>' apply double rotation to left-right case with key as root\n"+
      "\t- '=' apply tri-node restructuring with key as grandchild\n"+
      "\t- '!' highlights a node (or none if not found)\n"+
      "\t- '~' pauses execution\n"+
      "\t- '?' prints this message\n"+
      "\t- 'quit' quits.\n"+
      "\tDuring the whole process, the tree will be visualized.";
 
    if (args.length>0) {
      System.err.println(HELP);
      System.exit(-1);
    }
 
    BinarySearchTree<String,String> tree=
      new BinarySearchTree<String,String>();
    BinarySearchTreeExample app=new BinarySearchTreeExample(tree);
 
    app.halt("EMPTY TREE",1);
 
    Scanner s=new Scanner(System.in);
    s.useDelimiter("\\s+");
 
    while (s.hasNext()) {
      String key=s.next();
      if (key.compareTo("quit")==0)
        break;
      else if (key.startsWith("?")) {
        System.err.println(HELP);
      }
      else if (key.startsWith("!")) {
        key=key.substring(1);
        app.decorator_.highlight(key);
        app.halt("highlight '"+key+"'",10);
      }
      else if (key.startsWith("-")) {
        key=key.substring(1);
        tree.remove(key);
        app.halt("remove '"+key+"'",200);
      }
      else if (key.startsWith("~")) {
        app.halt("PAUSE '"+key.substring(1)+"'",0);
      }
      else if (key.startsWith("<") || key.startsWith(">") ||
               key.startsWith("/") || key.startsWith("\\") ||
               key.startsWith("=")) {
        try {
          tree.restructure(key.charAt(0),key.substring(1));
          app.halt("restructure '"+key.substring(0,1)+
              "' near '"+key.substring(1)+"'",200);
          //System.out.println(tree.toText());
        } catch (RuntimeException e) {
          System.err.println(e);
          app.halt(e.getMessage(),1);
        }
        tree.checkConsistency();
      }
      else {
        tree.insert(key,null);
        app.halt("insert '"+key+"'",200);
      }
    }
    app.halt("QUIT",200);
    System.exit(0);
  }

References aud.example.BinarySearchTreeExample.decorator_, aud.util.SingleStepper.halt(), and aud.BinarySearchTree.Decorator.highlight().

Here is the call graph for this function:

onHalt()

void aud.example.BinarySearchTreeExample.onHalt ( )

protected

Reimplemented from aud.util.SingleStepper.

Definition at line 27 of file BinarySearchTreeExample.java.

                                    {
    if (tree_!=null)
      viewer_.display(tree_);
  }

References aud.util.DotViewer.display(), aud.example.BinarySearchTreeExample.tree_, and aud.example.BinarySearchTreeExample.viewer_.

Here is the call graph for this function:

Member Data Documentation

decorator_

BinarySearchTree<String,String>.Decorator aud.example.BinarySearchTreeExample.decorator_

protected

Definition at line 15 of file BinarySearchTreeExample.java.

Referenced by aud.example.BinarySearchTreeExample.BinarySearchTreeExample(), and aud.example.BinarySearchTreeExample.main().

tree_

BinarySearchTree<String,String> aud.example.BinarySearchTreeExample.tree_ = null

protected

Definition at line 12 of file BinarySearchTreeExample.java.

Referenced by aud.example.BinarySearchTreeExample.BinarySearchTreeExample(), and aud.example.BinarySearchTreeExample.onHalt().

viewer_

DotViewer aud.example.BinarySearchTreeExample.viewer_

protected

Initial value:

= DotViewer.displayWindow
    ((String) null,"aud.example.BinarySearchTreeExample")

Definition at line 13 of file BinarySearchTreeExample.java.

Referenced by aud.example.BinarySearchTreeExample.onHalt().

---

The documentation for this class was generated from the following file:

• BinarySearchTreeExample.java