msg.java

The applet illustrates the behaviour of binary search trees, Searching and Sorting Algorithms, Self-

// Source File Name:   MSG.java


class MSG
{

    MSG()
    {
    }

    static final String DEFAULT = "Use controls to manage the Tree. ";
    static final String ONPAUSE = "Animation paused.  Resume? ";
    static final String LOCATING = "Locating {0}. ";
    static final String INSERTING = "Inserting {0}. ";
    static final String SWAPPING = "Swap with {0}. ";
    static final String DELETING = "Deleting the tree. ";
    static final String TRAVERSALTO = "Traversal order changed to {0}. ";
    static final String TRAVERSING = "Traversing the tree. Next node {0}... ";
    static final String TRAVERSED = "Traversal completed. ";
    static final String CREATED = "New root {0} created. ";
    static final String LOCATED = "{0} found. ";
    static final String NOTFOUND = "{0} not found. ";
    static final String EXISTS = "{0} already exists. ";
    static final String INSERTED = "{0} inserted. ";
    static final String DELETED = "{0} deleted. ";
    static final String ALLDELETED = "All nodes deleted. ";
    static final String NOTFINISHED = "Another operation is in progress. ";
    static final String TREEISEMPTY = "The tree is empty. Operation not permitted. ";
    static final String PICKANODE = "Pick a node first. ";
    static final String ROTATE = "R {0} ";
    static final String ROTATED = "{0} rotated ";
    static final String NOTROTATED = "Cannot rotate {0} ";
    static final String BALANCED = "{0} balance: ";
    static final String PAINT = "P ";
    static final String SPLIT = "Split at {0}. ";
    static final String JOIN = "Join {0}. ";
    static final String SPLAYING = "Splaying {0}. ";
    static final String SPLAYED = "{0} splayed. ";
    static final String ZIG[] = {
        "Zig. ", "", "Zag. "
    };
    static final String ZIGZIG[] = {
        "Zig-Zig. ", "", "Zag-Zag. "
    };
    static final String ZIGZAG[] = {
        "Zig-Zag. ", "", "Zag-Zig. "
    };
    static final String DISCODANCING = "GET DOWN TONIGHT... ";
    static final String DEFAULTSIZE = "Default tree size. ";
    static final String MINSIZE = "Minimum size. ";
    static final String MAXSIZE = "Maximum size. ";
    static final String SPEED = "Animation speed: {0}. ";
    static final String MAXSPEED = "Maximum speed: {0}. ";
    static final String MINSPEED = "Minimum speed: {0}. ";
    static final String PAUSED[] = {
        "Animation resumed. ", "Animation paused. "
    };
    static final String THINKING[] = {
        "\"Thinking\" mode is on. ", "\"Thinking\" mode is off. "
    };
    static final String ASCEND[] = {
        "The tree nodes are now in ascending order. ", "The tree nodes are now in descending order. "
    };
    static final String SHAPE[] = {
        "Classic shape. ", "Ordered shape. "
    };
    static final String SOUND[] = {
        "Sound is off. ", "Sound is on. "
    };
    static final String SPL[] = {
        "Nodes will splay after insert, delete and find operations. ", "Splaying mode is off. "
    };
    static final String RBL[] = {
        "Red-Black tree algorithms are in effect. ", "Red-black mode is off. "
    };
    static final String AVL[] = {
        "The tree is now AVL-balanced. ", "AVL mode is off. "
    };
    static final String AVLCMPL[] = {
        "The tree is AVL-compliant. ", "The tree is not AVL-compliant. "
    };
    static final String RBLCMPL[] = {
        "The tree is RB-compliant. ", "The tree is not RB-compliant. "
    };
    static final String FACTORS[] = {
        "Balance factors.   -1: Left-High.   0: Equal.   +1: Right-High. ", "Balance factors are now hidden. ", "Balance factors are not applicable for non-AVL trees. "
    };
    static final String MINMAX[] = {
        "Delete method will use findmax(). ", "Delete method will use findmin(). "
    };
    static final String SIDENAME[] = {
        "left. ", "equal. ", "right. "
    };
    static final String BALANCENAME[] = {
        "-1. ", "0. ", "+1. "
    };
    static final String RBNAME[] = {
        "", "R ", "B "
    };

}