SYMBOL INDEX (248 symbols across 36 files)

FILE: Trees/src/main/java/org/intelligentjava/algos/simplestructures/LinkedList.java
  class LinkedList (line 11) | public class LinkedList {
    method get (line 16) | public int get(int index) {
    method insert (line 24) | public void insert(int element) {
    method delete (line 32) | public void delete(int element) {
    method search (line 46) | private Entry search(int key) {
    class Entry (line 57) | private static class Entry {
      method Entry (line 58) | public Entry(Entry previous, Entry next, int element) {

FILE: Trees/src/main/java/org/intelligentjava/algos/simplestructures/PriorityQueue.java
  class PriorityQueue (line 13) | public class PriorityQueue {
    method PriorityQueue (line 19) | public PriorityQueue() {
    method insertElement (line 23) | public void insertElement(int element) {
    method changeElementValue (line 29) | public void changeElementValue(int index, int newValue) {
    method getElement (line 40) | public int getElement() {
    method removeElement (line 44) | public int removeElement() {

FILE: Trees/src/main/java/org/intelligentjava/algos/simplestructures/Queue.java
  class Queue (line 12) | public class Queue {
    method Queue (line 20) | public Queue() {
    method Queue (line 25) | public Queue(int queueSize) {
    method enqueue (line 30) | public void enqueue(Object element) throws QueueOverflowException {
    method dequeue (line 42) | public Object dequeue() {
    method isEmpty (line 52) | public boolean isEmpty() {
    method isFull (line 56) | public boolean isFull() {

FILE: Trees/src/main/java/org/intelligentjava/algos/simplestructures/Stack.java
  class Stack (line 12) | public class Stack {
    method Stack (line 18) | public Stack() {
    method Stack (line 23) | public Stack(int initialSize) {
    method isEmpty (line 28) | public boolean isEmpty() {
    method push (line 32) | public void push(Object element) {
    method pop (line 40) | public Object pop() {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/AVLTree.java
  class AVLTree (line 20) | public class AVLTree extends AbstractSelfBalancingBinarySearchTree {
    method insert (line 30) | @Override
    method delete (line 40) | @Override
    method createNode (line 62) | @Override
    method rebalance (line 73) | private void rebalance(AVLNode node) {
    method avlRotateLeft (line 109) | private Node avlRotateLeft(Node node) {
    method avlRotateRight (line 120) | private Node avlRotateRight(Node node) {
    method doubleRotateRightLeft (line 132) | protected Node doubleRotateRightLeft(Node node) {
    method doubleRotateLeftRight (line 141) | protected Node doubleRotateLeftRight(Node node) {
    method recomputeHeight (line 149) | private void recomputeHeight(AVLNode node) {
    method maxHeight (line 159) | private int maxHeight(AVLNode node1, AVLNode node2) {
    method updateHeight (line 175) | private static final void updateHeight(AVLNode node) {
    class AVLNode (line 191) | protected static class AVLNode extends Node {
      method AVLNode (line 194) | public AVLNode(int value, Node parent, Node left, Node right) {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/AbstractBinarySearchTree.java
  class AbstractBinarySearchTree (line 14) | public abstract class AbstractBinarySearchTree {
    method createNode (line 33) | protected abstract Node createNode(int value, Node parent, Node left, ...
    method search (line 43) | public Node search(int element) {
    method insert (line 61) | public Node insert(int element) {
    method delete (line 99) | public Node delete(int element) {
    method delete (line 117) | protected Node delete(Node deleteNode) {
    method transplant (line 155) | private Node transplant(Node nodeToReplace, Node newNode) {
    method contains (line 173) | public boolean contains(int element) {
    method getMinimum (line 180) | public int getMinimum() {
    method getMaximum (line 187) | public int getMaximum() {
    method getSuccessor (line 199) | public int getSuccessor(int element) {
    method getSize (line 206) | public int getSize() {
    method printTreeInOrder (line 213) | public void printTreeInOrder() {
    method printTreePreOrder (line 220) | public void printTreePreOrder() {
    method printTreePostOrder (line 227) | public void printTreePostOrder() {
    method printTreeInOrder (line 233) | private void printTreeInOrder(Node entry) {
    method printTreePreOrder (line 243) | private void printTreePreOrder(Node entry) {
    method printTreePostOrder (line 253) | private void printTreePostOrder(Node entry) {
    method getMinimum (line 263) | protected Node getMinimum(Node node) {
    method getMaximum (line 270) | protected Node getMaximum(Node node) {
    method getSuccessor (line 277) | protected Node getSuccessor(Node node) {
    method printTree (line 298) | public void printTree() {
    method printSubtree (line 302) | public void printSubtree(Node node) {
    method printNodeValue (line 312) | private void printNodeValue(Node node) {
    method printTree (line 321) | private void printTree(Node node, boolean isRight, String indent) {
    class Node (line 339) | public static class Node {
      method Node (line 340) | public Node(Integer value, Node parent, Node left, Node right) {
      method isLeaf (line 353) | public boolean isLeaf() {
      method hashCode (line 357) | @Override
      method equals (line 365) | @Override

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/AbstractSelfBalancingBinarySearchTree.java
  class AbstractSelfBalancingBinarySearchTree (line 11) | public abstract class AbstractSelfBalancingBinarySearchTree extends Abst...
    method rotateLeft (line 19) | protected Node rotateLeft(Node node) {
    method rotateRight (line 51) | protected Node rotateRight(Node node) {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/BinarySearchTree.java
  class BinarySearchTree (line 18) | public class BinarySearchTree extends AbstractBinarySearchTree {
    method createNode (line 20) | @Override

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/RedBlackTree.java
  class RedBlackTree (line 10) | public class RedBlackTree extends AbstractSelfBalancingBinarySearchTree {
    type ColorEnum (line 12) | protected enum ColorEnum {
    method insert (line 22) | @Override
    method delete (line 37) | @Override
    method createNode (line 79) | @Override
    method getMinimum (line 87) | @Override
    method getMaximum (line 98) | @Override
    method rotateLeft (line 109) | @Override
    method rotateRight (line 139) | @Override
    method rbTreeTransplant (line 170) | private Node rbTreeTransplant(Node nodeToReplace, Node newNode) {
    method deleteRBFixup (line 185) | private void deleteRBFixup(RedBlackNode x) {
    method isBlack (line 249) | private boolean isBlack(Node node) {
    method isRed (line 253) | private boolean isRed(Node node) {
    method insertRBFixup (line 262) | private void insertRBFixup(RedBlackNode currentNode) {
    class RedBlackNode (line 323) | protected static class RedBlackNode extends Node {
      method RedBlackNode (line 326) | public RedBlackNode(Integer value, Node parent, Node left, Node righ...

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/ScapegoatTree.java
  class ScapegoatTree (line 17) | public class ScapegoatTree extends AbstractSelfBalancingBinarySearchTree {
    method ScapegoatTree (line 27) | public ScapegoatTree() {
    method ScapegoatTree (line 36) | public ScapegoatTree(double alpha) {
    method insert (line 44) | @Override
    method delete (line 72) | @Override
    method createNode (line 85) | @Override
    method findScapegoatNode (line 95) | protected Node findScapegoatNode(Node node) {
    method rebuildTree (line 121) | protected Node rebuildTree(int size, Node scapegoat) {
    method buildTree (line 150) | private Node buildTree(List<Node> nodes, int start, int end) {
    method getSibling (line 177) | private Node getSibling(Node node) {
    method getSubtreeSize (line 196) | protected int getSubtreeSize(Node node) {
    method getNodeHeight (line 211) | protected int getNodeHeight(Node node) {
    method getHAlpha (line 221) | private int getHAlpha() {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/SplayTree.java
  class SplayTree (line 10) | public class SplayTree extends AbstractSelfBalancingBinarySearchTree {
    method search (line 15) | @Override
    method insert (line 27) | @Override
    method delete (line 37) | @Override
    method createNode (line 55) | @Override
    method splay (line 66) | protected void splay(Node node) {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/Treap.java
  class Treap (line 14) | public class Treap extends AbstractSelfBalancingBinarySearchTree {
    method insert (line 24) | @Override
    method delete (line 47) | @Override
    method createNode (line 62) | @Override
    method rotateDown (line 74) | private Node rotateDown(TreapNode node) {
    class TreapNode (line 108) | protected static class TreapNode extends Node {
      method TreapNode (line 111) | public TreapNode(int value, Node parent, Node left, Node right, int ...

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/benchmark/TreesDeleteBenchmark.java
  class TreesDeleteBenchmark (line 27) | @OutputTimeUnit(TimeUnit.MILLISECONDS)
    method setup (line 38) | @Setup(Level.Trial)
    method timeJDKTreeSet (line 46) | @Benchmark
    method timeDeleteRedBlackTree (line 60) | @Benchmark
    method timeDeleteAVLTree (line 74) | @Benchmark
    method timeDeleteSplayTree (line 88) | @Benchmark
    method timeDeleteTreap (line 102) | @Benchmark
    method timeDeleteScapegoat0_6Tree (line 116) | @Benchmark
    method timeDeleteScapegoat0_75Tree (line 130) | @Benchmark
    method timeDeleteScapegoat0_9Tree (line 144) | @Benchmark
    method main (line 158) | public static void main(String[] args) throws RunnerException {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/benchmark/TreesInsertRandomBenchmark.java
  class TreesInsertRandomBenchmark (line 27) | @OutputTimeUnit(TimeUnit.MILLISECONDS)
    method setup (line 38) | @Setup(Level.Trial)
    method timeJDKTreeSet (line 46) | @SuppressWarnings({ "unchecked", "rawtypes" })
    method timeRedBlackTree (line 56) | @Benchmark
    method timeAVLTree (line 65) | @Benchmark
    method timeSplayTree (line 74) | @Benchmark
    method timeTreap (line 83) | @Benchmark
    method timeScapegoat0_6Tree (line 92) | @Benchmark
    method timeScapegoat0_75Tree (line 101) | @Benchmark
    method timeScapegoat0_9Tree (line 110) | @Benchmark
    method main (line 119) | public static void main(String[] args) throws RunnerException {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/benchmark/TreesInsertSortedBenchmark.java
  class TreesInsertSortedBenchmark (line 24) | @OutputTimeUnit(TimeUnit.MILLISECONDS)
    method timeJDKTreeSet (line 31) | @SuppressWarnings({ "unchecked", "rawtypes" })
    method timeRedBlackTree (line 41) | @Benchmark
    method timeAVLTree (line 50) | @Benchmark
    method timeSplayTree (line 59) | @Benchmark
    method timeTreap (line 68) | @Benchmark
    method timeScapegoat0_6Tree (line 77) | @Benchmark
    method timeScapegoat0_75Tree (line 86) | @Benchmark
    method timeScapegoat0_9Tree (line 95) | @Benchmark
    method main (line 104) | public static void main(String[] args) throws RunnerException {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/benchmark/TreesSearchBenchmark.java
  class TreesSearchBenchmark (line 28) | @SuppressWarnings("unchecked")
    method setup (line 48) | @Setup(Level.Trial)
    method timeJDKTreeSet (line 81) | @Benchmark
    method timeSearchRedBlackTree (line 90) | @Benchmark
    method timeSearchAVLTree (line 99) | @Benchmark
    method timeSearchSplayTree (line 108) | @Benchmark
    method timeSearchTreap (line 117) | @Benchmark
    method timeSearchScapegoat0_6Tree (line 126) | @Benchmark
    method timeSearchScapegoat0_75Tree (line 135) | @Benchmark
    method timeSearchScapegoat0_9Tree (line 144) | @Benchmark
    method main (line 153) | public static void main(String[] args) throws RunnerException {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/benchmark/TreesSearchSameElementsBenchmark.java
  class TreesSearchSameElementsBenchmark (line 28) | @SuppressWarnings("unchecked")
    method setup (line 48) | @Setup(Level.Trial)
    method timeJDKTreeSet (line 80) | @Benchmark
    method timeSearchRedBlackTree (line 89) | @Benchmark
    method timeSearchAVLTree (line 98) | @Benchmark
    method timeSearchSplayTree (line 107) | @Benchmark
    method timeSearchTreap (line 116) | @Benchmark
    method timeSearchScapegoat0_6Tree (line 125) | @Benchmark
    method timeSearchScapegoat0_75Tree (line 134) | @Benchmark
    method timeSearchScapegoat0_9Tree (line 143) | @Benchmark
    method main (line 152) | public static void main(String[] args) throws RunnerException {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/exceptions/QueueOverflowException.java
  class QueueOverflowException (line 10) | public class QueueOverflowException extends Exception {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/main/Main.java
  class Main (line 7) | public class Main {
    method main (line 11) | public static void main(String[] args) {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/utils/ArrayUtils.java
  class ArrayUtils (line 10) | public class ArrayUtils {
    method swap (line 22) | public static void swap(int[] data, int elementIndex1, int elementInde...
    method selectNthSmallestElement (line 38) | public static int selectNthSmallestElement(int[] data, int n) {
    method selectNthSmallestElement (line 51) | public static int selectNthSmallestElement(int[] data, int sublistStar...
    method partition (line 75) | private static int partition(int[] data, int sublistStartIndex, int su...

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/utils/HeapUtils.java
  class HeapUtils (line 14) | public class HeapUtils {
    method buildMaxHeap (line 20) | public static void buildMaxHeap(int[] data) {
    method maxHeapify (line 33) | public static void maxHeapify(int[] data, int index) {
    method maxHeapify (line 42) | public static void maxHeapify(int[] data, int index, int heapSize) {
    method getParent (line 58) | public static int getParent(int leafIndex) {
    method getLeftLeaf (line 69) | private static int getLeftLeaf(int parentIndex) {
    method getRightLeaf (line 80) | private static int getRightLeaf(int parentIndex) {

FILE: Trees/src/main/java/org/intelligentjava/algos/trees/utils/MathUtils.java
  class MathUtils (line 10) | public class MathUtils {
    method getDigitFromNumber (line 20) | public static int getDigitFromNumber(int number, int digitIndex) {
    method getMax (line 32) | public static int getMax(int first, int second) {
    method logarithm (line 39) | public static double logarithm(double base, double a) {

FILE: Trees/src/test/java/org/intelligentjava/algos/simplestructures/LinkedListTest.java
  class LinkedListTest (line 11) | public class LinkedListTest {
    method testInsertDelete (line 13) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/simplestructures/PriorityQueueTest.java
  class PriorityQueueTest (line 8) | public class PriorityQueueTest {

FILE: Trees/src/test/java/org/intelligentjava/algos/simplestructures/QueueTest.java
  class QueueTest (line 12) | public class QueueTest {
    method testEnqueueDequeue (line 14) | @Test
    method testIsEmpty (line 25) | @Test
    method testIsFull (line 33) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/simplestructures/StackTest.java
  class StackTest (line 11) | public class StackTest {
    method testPushPop (line 13) | @Test
    method testIsEmpty (line 24) | @Test
    method testMoreThan10 (line 36) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/AVLTreeTest.java
  class AVLTreeTest (line 15) | public class AVLTreeTest extends BaseBSTTest {
    method testDelete (line 17) | @Test
    method testInsert (line 35) | @Test
    method testRotateLeft (line 58) | @Test
    method testRotateRight (line 82) | @Test
    method testDoubleRotateRightLeft (line 106) | @Test
    method testDoubleRotateLeftRight (line 130) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/BaseBSTTest.java
  class BaseBSTTest (line 12) | public class BaseBSTTest {
    method testTreeBSTProperties (line 14) | protected void testTreeBSTProperties(Node entry) {

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/BinarySearchTreeTest.java
  class BinarySearchTreeTest (line 13) | public class BinarySearchTreeTest extends BaseBSTTest {
    method testInsertDelete (line 15) | @Test
    method testSize (line 34) | @Test
    method testMinimumMaximum (line 47) | @Test
    method testGetSuccessor (line 58) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/RedBlackTreeTest.java
  class RedBlackTreeTest (line 19) | public class RedBlackTreeTest {
    method testInsertionFixupColoring (line 20) | @Test
    method testInsert (line 31) | @Test
    method testSimpleDelete (line 56) | @Test
    method testDelete (line 72) | @Test
    method testTreeBSTProperties (line 101) | private void testTreeBSTProperties(Node entry) {

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/ScapegoatTreeTest.java
  class ScapegoatTreeTest (line 14) | public class ScapegoatTreeTest extends BaseBSTTest {
    method testInsertSorted (line 17) | @Test
    method testInsertSortedDesc (line 44) | @Test
    method testDeleteSortedDesc (line 73) | @Test
    method testBuildBigTree (line 110) | @Test
    method testGetSubtreeSize (line 129) | @Test
    method testFindScapegoat (line 142) | @Test
    method testRebuildTree (line 147) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/SplayTreeTest.java
  class SplayTreeTest (line 14) | public class SplayTreeTest extends BaseBSTTest {
    method testSearch (line 16) | @Test
    method testInsert (line 34) | @Test
    method testDelete (line 54) | @Test
    method testSplayZig (line 91) | @Test
    method testSplayZigZig (line 106) | @Test
    method testSplayZigZag (line 125) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/TreapTest.java
  class TreapTest (line 15) | public class TreapTest extends BaseBSTTest {
    method testInsert (line 18) | @Test
    method testDelete (line 47) | @Test
    method testHeapPropertyAfterInsertAndDelete (line 64) | @Test
    method testHeapProperties (line 107) | private void testHeapProperties(Node entry) {

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/utils/ArrayUtilsTest.java
  class ArrayUtilsTest (line 11) | public class ArrayUtilsTest {
    method testSwap (line 13) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/utils/HeapUtilsTest.java
  class HeapUtilsTest (line 11) | public class HeapUtilsTest {
    method testBuildHeap (line 13) | @Test
    method testMaxHeapify (line 23) | @Test

FILE: Trees/src/test/java/org/intelligentjava/algos/trees/utils/MathUtilsTest.java
  class MathUtilsTest (line 11) | public class MathUtilsTest {
    method testGetDigitFromNumber (line 13) | @Test