A B C D E F G H I L M N O P Q R S T V

A

ArraySupport - class scranton.ArraySupport.

Support the process of inserting (in) or removing (out) an object for a collection in an array at the indicated position and moving the remaining objects to adjust for the insertion or removal

ArraySupport() - Constructor for class scranton.ArraySupport

AscendingInteger - class scranton.AscendingInteger.

A comparator for ordering Integer objects in their natural order, their comparable order.

AscendingInteger() - Constructor for class scranton.AscendingInteger

actual - Variable in class scranton.queue.QueueViaArrayCirc

The array that contains the objects in the queue.

actual - Variable in class scranton.queue.QueueViaLinear1Circ

Reference (possibly null) to the circularly recursively referenced structure that holds the queue's objects.

actual - Variable in class scranton.stack.StackViaArray

This field contains the array that holds the stack, actual[0] holds the bottom, actual[count-1] holds the top.

actual - Variable in class scranton.stack.StackViaLinear1

The stack is provided through aggregation, as a protected attribute within the class.

arrayInsert(Object[], int, int, Object) - Method in class scranton.ArraySupport

Insert an object into the array at the indicated position and move the objects at the position or following it to make room for the move.

arrayRemove(Object[], int, int) - Method in class scranton.ArraySupport

Remove the object at a[out] and move the following objects to shrink the number of objects by one.

atFront() - Method in interface scranton.list.PositionalList

Reports whether or not current viewing position is at front of list

atFront() - Method in class scranton.list.PositionalListVia2Stacks

atRear() - Method in interface scranton.list.PositionalList

Reports whether or not current viewing position is at rear of list

atRear() - Method in class scranton.list.PositionalListVia2Stacks

B

BinarySearchTree - class scranton.tree.BinarySearchTree.

Implements a binary search tree by extending RecursiveBinaryTreeViaLinear1.

BinarySearchTree(Comparator) - Constructor for class scranton.tree.BinarySearchTree

Constructs an empty binary search tree

BinarySearchTree(Object, BinarySearchTree, BinarySearchTree, Comparator) - Constructor for class scranton.tree.BinarySearchTree

Constructs a non-empty binary search tree

C

c - Variable in class scranton.tree.BinarySearchTree

The comparator that orders the binary search tree

c - Variable in class scranton.tree.HeapViaArray

c.compare(a,b)<0 implies a precedes b

clockwiseRotate() - Method in class scranton.tree.BinarySearchTree

Perform a clockwise rotation around "this".

clone() - Method in class scranton.stack.StackViaArray

close() - Method in class scranton.tree.HeapViaArray

Method close terminates the heap and returns the current array.

compare(Object, Object) - Method in class scranton.AscendingInteger

The comparator's compare method

compare(Object, Object) - Method in class scranton.DescendingInteger

The comparator's compare method

consume() - Method in class scranton.IteratorThread

Classical thread synchronization referenced by the next method to obtain the object.

count - Variable in class scranton.stack.StackViaArray

This field contains the count of the number of objects in the stack.

counterClockwiseRotate() - Method in class scranton.tree.BinarySearchTree

Perform a counterClockwise rotation around "this".

current - Variable in class scranton.list.PositionalListVia2Stacks

For i>0, current contains a_i, ..., a_n-1 with a_i at the top of the stack

D

DescendingInteger - class scranton.DescendingInteger.

A comparator for ordering Integer objects in reverse natural order, their comparable order.

DescendingInteger() - Constructor for class scranton.DescendingInteger

data - Variable in class scranton.Linear1

Field (possibly null) referencing the object associated to this Linear1 object.

dequeue() - Method in interface scranton.queue.Queue

Decrease the size of the queue by one by removing and returning reference to the object that was at the front of the queue.

dequeue() - Method in class scranton.queue.QueueViaArrayCirc

dequeue() - Method in class scranton.queue.QueueViaLinear1Circ

doubler(Object[]) - Method in class scranton.queue.QueueViaArrayCirc

Method doubler doubles the sixe of the array containing the queue and copies the queue into the new array.

doubler(Object[]) - Method in class scranton.stack.StackViaArray

Creates an array that is twice the size of the array passed as a parameter, actual, returns an array that is twice the size and the contents of the parameter are placed in the first half of the new array.

doubler(Object[]) - Method in class scranton.tree.HeapViaArray

Method doubler doubles the size of the array instead of reporting an overflow error.

E

enqueue(Object) - Method in interface scranton.queue.Queue

Increase the size of the queue by one by placing item as the rear of the queue.

enqueue(Object) - Method in class scranton.queue.QueueViaArrayCirc

enqueue(Object) - Method in class scranton.queue.QueueViaLinear1Circ

F

factory() - Method in class scranton.Linear1

Returns a null Linear1() object

factory() - Method in class scranton.Linear2

Returns a null Linear2() object

factory() - Method in interface scranton.list.PositionalList

Returns an empty PositionalList implementation of the type used in the method's application.

factory() - Method in class scranton.list.PositionalListVia2Stacks

factory() - Method in class scranton.list.RecursiveListViaLinear1Ind

factory() - Method in class scranton.queue.QueueViaArrayCirc

factory() - Method in class scranton.queue.QueueViaLinear1Circ

factory() - Method in class scranton.stack.StackViaArray

factory() - Method in class scranton.stack.StackViaLinear1

factory() - Method in class scranton.stack.StackViaLinear1Ind

factory() - Method in class scranton.tree.BinarySearchTree

Returns an empty binary search tree

factory() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

factory() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

Returns an empty tree

finished - Variable in class scranton.IteratorThread

Set to true when the producer terminates.

front - Variable in class scranton.queue.QueueViaArrayCirc

The index to the array location that contains the front.

frontOf() - Method in interface scranton.queue.PriorityQueue

Method frontOf return front, a₀.

frontOf() - Method in class scranton.queue.PriorityQueueViaHeapArray

frontOf() - Method in interface scranton.queue.Queue

Queue does not change, returns the reference to the front object in the queue.

frontOf() - Method in class scranton.queue.QueueViaArrayCirc

frontOf() - Method in class scranton.queue.QueueViaLinear1Circ

full - Variable in class scranton.IteratorThread

Boolean mailbox flag used by the producer/consumer methods

G

Guard - class scranton.Guard.

Encapsulates a boolean object that may be used in a variety processes to guard against something changing, the guard may be truned on or off to indicate the presence or absence of a application specific conditon.

Guard() - Constructor for class scranton.Guard

Constructs a Guard object.

getData() - Method in class scranton.Linear1

Returns reference to the object referenced by the data field.

getLink() - Method in class scranton.Linear1

Returns reference to the next Linear1 recursive object.

getNext() - Method in class scranton.Linear2

Returns reference to the Linear2 recursive object that follows this Linear2 object.

getNode() - Method in interface scranton.tree.PositionalBinaryTree

Replace the root of the current tree.

getNode() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Access the root of the current tree.

getPrevious() - Method in class scranton.Linear2

Returns reference to the Linear2 recursive object that precedes this Linear2 object.

getRoot() - Method in interface scranton.tree.RecursiveBinaryTree

Returns a reference to the root of the current tree.

getRoot() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

graft(BinarySearchTree) - Method in class scranton.tree.BinarySearchTree

Graft the tree O to the current tree satisfying the search tree order given by the tree's comparator.

graft(PositionalBinaryTree) - Method in interface scranton.tree.PositionalBinaryTree

Grafts a tree to the current position of the tree, which must be empty.

graft(PositionalBinaryTree) - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Grafts a tree to the current position of the tree, which must be empty.

graft(RecursiveBinaryTree) - Method in interface scranton.tree.RecursiveBinaryTree

Replace the current tree by T.

graft(RecursiveBinaryTree) - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

guard - Variable in class scranton.Guard

The boolean guard that is set on/off to indicate various conditions.

H

Heap - interface scranton.tree.Heap.

Heap interface, assume a comparator applies the heap order.

HeapViaArray - class scranton.tree.HeapViaArray.

Heap Class: Manages a heap in an array applying a comparator.

HeapViaArray(Comparator) - Constructor for class scranton.tree.HeapViaArray

Method Heap construct a heap with Comparator c and initially of size max.

HeapViaArray(Comparator, int) - Constructor for class scranton.tree.HeapViaArray

Method Heap construct a heap with Comparator c and initially of size max.

HeapViaArray(Object[], int, Comparator) - Constructor for class scranton.tree.HeapViaArray

Method Heap construct a heap from an exisitng array of data with.

hasNext() - Method in class scranton.IteratorThread

Implements the Iterator's hasNext method

headOf() - Method in interface scranton.list.RecursiveList

Returns reference to the Object at the head of the list.

headOf() - Method in class scranton.list.RecursiveListViaLinear1Ind

heap - Variable in class scranton.tree.HeapViaArray

The array that holds the heap

heapSize - Variable in class scranton.tree.HeapViaArray

The size of the heap

I

IteratorThread - class scranton.IteratorThread.

An abstract class that implements the Iterator Interface by extending the Thread class allowing software developers to construct iterators over various containers by constructing an agorithm, as a run method, that visits each object int the container and calls the produce method to make the object available to the consumer employing the iterator.

IteratorThread(Guard) - Constructor for class scranton.IteratorThread

indInsert(Linear1Ind) - Method in class scranton.Linear1Ind

Relinks the recursively referenced Linear1Ind structure by inserting a new Linear1Ind object, newObj, at one level of indirection from this, addressing the additonal level of indirection normally associated with a linear structure that begins with a "null object".

indInsert(Linear2Ind) - Method in class scranton.Linear2Ind

Relinks the recursively referenced Linear1Ind structure by inserting a new Linear2Ind object, newObj, at one level of indirection from this, addressing the additonal level of indirection normally associated with a linear structure that begins with a "null object".

indRemove() - Method in class scranton.Linear1Ind

Removes an object at one level of indirection from "this", addressing the removal of an object from a linear structure that begins with a "null object".

indRemove() - Method in class scranton.Linear2Ind

Removes an object at one level of indirection from "this", addressing the removal of an object from a linear structure that begins with a "null object".

indReplace(Object) - Method in class scranton.Linear1Ind

Replaces the contents of the Linear1Ind object at one level of indirection from this.

indReplace(Object) - Method in class scranton.Linear2Ind

Replaces the contents of the Linear2Ind object at one level of indirection from this.

indView() - Method in class scranton.Linear1Ind

References the object in the Linear1Ind object at one level of indirection from this.

indView() - Method in class scranton.Linear2Ind

References the object in the Linear2Ind object at one level of indirection from this.

insert(Object) - Method in interface scranton.list.PositionalList

Inserts obj at the current position in the list.

insert(Object) - Method in class scranton.list.PositionalListVia2Stacks

Insert obj at the current position in the list Pre: #(L) = 0 or 0 <= i Post: L' = #(L)+1 if #(L)=0 then i'=0, L' = (obj) else if i>#(L)-1 then i' = #(L')-1, L' = (L, obj) else i' = i, L' = (a₀, ..., a_i-1, obj, a_i, ..., a_n-1) Mapping: obj is pushed into the stack, current, on top of other objects in that stack

insert(RecursiveList) - Method in interface scranton.list.RecursiveList

Replaces the current list with a new list composed by concatenating the current list to the list in the parameter, this = L+this.

insert(RecursiveList) - Method in class scranton.list.RecursiveListViaLinear1Ind

insert(Object) - Method in interface scranton.queue.PriorityQueue

Method insert item into the PriorityQueue.

insert(Object) - Method in class scranton.tree.BinarySearchTree

Accept an object for insertion in the binary search tree, embed it in a tree and call the graft process to insert it.

insert(Object) - Method in interface scranton.tree.Heap

Method insert a new object and reorganize the heap by applying the siftUp process.

insert(Object) - Method in class scranton.tree.HeapViaArray

Method insert a new object and reorganize the heap by applying the siftUp process.

isEmpty() - Method in interface scranton.list.PositionalList

Reports whether or not the list is empty (i.e., contains no items).

isEmpty() - Method in class scranton.list.PositionalListVia2Stacks

isEmpty() - Method in interface scranton.list.RecursiveList

Returns true if the current list is empty.

isEmpty() - Method in class scranton.list.RecursiveListViaLinear1Ind

isEmpty() - Method in interface scranton.queue.PriorityQueue

Method isEmpty returns this==().

isEmpty() - Method in class scranton.queue.PriorityQueueViaHeapArray

isEmpty() - Method in interface scranton.queue.Queue

Queue does not change, returns true iff the queue is empty.

isEmpty() - Method in class scranton.queue.QueueViaArrayCirc

isEmpty() - Method in class scranton.queue.QueueViaLinear1Circ

isEmpty() - Method in interface scranton.stack.Stack

Stack does not change, returns true iff the stack is empty.

isEmpty() - Method in class scranton.stack.StackViaArray

Stack does not change, returns true iff the stack is empty.

isEmpty() - Method in class scranton.stack.StackViaLinear1

isEmpty() - Method in class scranton.stack.StackViaLinear1Ind

isEmpty() - Method in interface scranton.tree.PositionalBinaryTree

Returns true if the current position is an empty tree.

isEmpty() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Returns true if the current position is an empty tree.

isEmpty() - Method in interface scranton.tree.RecursiveBinaryTree

Returns true if and only if the current tree is empty.

isEmpty() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

isLeaf(int) - Method in class scranton.tree.HeapViaArray

Method isLeaf.

isOff() - Method in class scranton.Guard

Returns true if the guard is off

isOn() - Method in class scranton.Guard

Returns true if the guard is on

isRoot() - Method in interface scranton.tree.PositionalBinaryTree

Returns true iff the current position is the root fo the tree.

isRoot() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Returns true iff the current position is the root fo the tree.

iterating - Variable in class scranton.IteratorThread

The flag in the Guard object is set to false if the structure is changed while the iteration is in progress.

L

Linear1 - class scranton.Linear1.

Fundamental class for constructing linear recursive objects.

Linear1() - Constructor for class scranton.Linear1

Constructs a "null" Linear1 object.

Linear1(Object) - Constructor for class scranton.Linear1

Constructs an non-empty Linear1 object with no recursive reference (a null reference).

Linear1(Object, Linear1) - Constructor for class scranton.Linear1

Constructs a non empty Linear1 object with a recursive reference to a next (possibly null) object.

Linear1Ind - class scranton.Linear1Ind.

Extends the Linear1 class with insert and remove methods that assume one level of indirection that is normally associated with one way linear recursive structures that apply a null object at the beginning of the structure.

Linear1Ind() - Constructor for class scranton.Linear1Ind

Constructs a "null" Liner1Ind object.

Linear1Ind(Object) - Constructor for class scranton.Linear1Ind

Constructs a non-empty Linear1Ind object with no recursive reference (a null reference).

Linear1Ind(Object, Linear1Ind) - Constructor for class scranton.Linear1Ind

Constructs a non empty Linear1Ind object with a given recursive reference to another (possibly null) object.

Linear2 - class scranton.Linear2.

Extends the Linear1 class to a class to construct two way linked linearly recursive collection objects.

Linear2() - Constructor for class scranton.Linear2

Constructs a "null" Linear2 object.

Linear2(Object) - Constructor for class scranton.Linear2

Constructs a non-empty object with (null reference) no preceding or following recursive references.

Linear2(Linear2, Object, Linear2) - Constructor for class scranton.Linear2

Linear2 constructor creates a non empty object with a given recursive reference to another (possibly null) object.

Linear2Ind - class scranton.Linear2Ind.

Extends the Linear2 class with insert and remove methods that hide a level of indirection normally associated with one way linear structures that require a null object at the beginning of the structure.

Linear2Ind() - Constructor for class scranton.Linear2Ind

Constructs a "null" Liner2Ind object.

Linear2Ind(Object) - Constructor for class scranton.Linear2Ind

Constructs a non-empty Linear2Ind object with no recursive reference (a null reference).

Linear2Ind(Linear2, Object, Linear2) - Constructor for class scranton.Linear2Ind

Constructs a non empty Linear2Ind object with a given recursive reference to another (possibly null) object.

left - Variable in class scranton.list.PositionalListVia2Stacks

For i>0, left contains a₀, ..., a_i-1 with a_i-1 at the top of the stack

leftSubtree() - Method in interface scranton.tree.RecursiveBinaryTree

Returns a reference to the left subtree of the current tree.

leftSubtree() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

leftchild(int) - Method in class scranton.tree.HeapViaArray

Method leftchild.

link - Variable in class scranton.Linear1

Field (possibly null) referencing the Linear1 object that follows this one in the recursive structure.

lrPromote() - Method in class scranton.tree.BinarySearchTree

Performs a ccounterClockwise rotation around the left subchild of "this" before performing a clockwise rotation around "this".

M

mailbox - Variable in class scranton.IteratorThread

The producer/consumer mailbox

N

next() - Method in class scranton.IteratorThread

Implements the Iterator's next method

next() - Method in interface scranton.list.PositionalList

Moves current viewing position one object towards the rear, if possible.

next() - Method in class scranton.list.PositionalListVia2Stacks

O

off() - Method in class scranton.Guard

Turn the guard off

on() - Method in class scranton.Guard

Turn the guard on

P

PositionalBinaryTree - interface scranton.tree.PositionalBinaryTree.

A class that represents a positional binary tree with a recursive binary tree and a stack.

PositionalBinaryTreeViaRecTreeWStk - class scranton.tree.PositionalBinaryTreeViaRecTreeWStk.

A class that represents a positional binary tree with a recursive binary tree and a stack.

PositionalBinaryTreeViaRecTreeWStk() - Constructor for class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Construct an empty tree.

PositionalBinaryTreeViaRecTreeWStk(Object, PositionalBinaryTreeViaRecTreeWStk, PositionalBinaryTreeViaRecTreeWStk) - Constructor for class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Construct a tree with a root and two subtrees.

PositionalList - interface scranton.list.PositionalList.

A positional list may be specified as an ordered pair this = (R, L), where L and R are n-tuples, L = () or (l₀, l₁, ..., l_#(L)-1 and R = () or (r₀, r₁, ..., r_#(R)-1 L is the sublist to the left of the current position and R is the sublist to the right of the current positon

PositionalListVia2Stacks - class scranton.list.PositionalListVia2Stacks.

LinkedSList implements the PositionalList interface with a pair of stacks.

PositionalListVia2Stacks() - Constructor for class scranton.list.PositionalListVia2Stacks

Initialize the list as a pair of empty stacks.

PriorityQueue - interface scranton.queue.PriorityQueue.

A priority queue applies a comparator so that the remove method dispenses the object that preceed the other objects in the queue when odered with the comparator.

PriorityQueueViaHeapArray - class scranton.queue.PriorityQueueViaHeapArray.

PriorityQueueViaHeap Class applies a heap to implement a priority queue.

PriorityQueueViaHeapArray(Comparator, int) - Constructor for class scranton.queue.PriorityQueueViaHeapArray

Construct a PriorityQueue with Comparator c, and initially of size max

PriorityQueueViaHeapArray(Comparator) - Constructor for class scranton.queue.PriorityQueueViaHeapArray

Construct a PriorityQueue with Comparator c, and initially of size, max.

parent(int) - Method in class scranton.tree.HeapViaArray

Method parent.

pop() - Method in interface scranton.stack.Stack

Decrease the size of the stack by one by removing and returning the object at the top.

pop() - Method in class scranton.stack.StackViaArray

Decrease the size of the stack by one by removing and returning the object at the top.

pop() - Method in class scranton.stack.StackViaLinear1

pop() - Method in class scranton.stack.StackViaLinear1Ind

previous - Variable in class scranton.Linear2

Field (possibly null) referencing the recursive Linear2 object that precedes this object.

previous() - Method in interface scranton.list.PositionalList

Moves current viewing position one place towards the front, if possible.

previous() - Method in class scranton.list.PositionalListVia2Stacks

produce(Object, Object) - Method in class scranton.IteratorThread

Classical thread code for a producer method that is called by the extended class's run method each time an object is produced.

prune() - Method in interface scranton.tree.PositionalBinaryTree

Returns the subtree at the current position in the tree and makes the tree at the current position be empty.

prune() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Returns the subtree at the current position in the tree and makes the tree at the current position be empty.

prune() - Method in interface scranton.tree.RecursiveBinaryTree

Return reference to the current tree, then make current tree empty.

prune() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

push(Object) - Method in interface scranton.stack.Stack

Increase the size of the stack by one by placing item as the new top of the stack.

push(Object) - Method in class scranton.stack.StackViaArray

Increase the size of the stack by one by placing item as the new top of the stack.

push(Object) - Method in class scranton.stack.StackViaLinear1

push(Object) - Method in class scranton.stack.StackViaLinear1Ind

Q

Queue - interface scranton.queue.Queue.

Specifications for a queue, the semi-formal notation for specifications appears on the notation page.

QueueViaArrayCirc - class scranton.queue.QueueViaArrayCirc.

Implements the Queue interface via compositon using an array (wraparound).

QueueViaArrayCirc() - Constructor for class scranton.queue.QueueViaArrayCirc

Constructs an empty queue

QueueViaArrayCirc(int) - Constructor for class scranton.queue.QueueViaArrayCirc

Constructs an empty queue of the indicated size.

QueueViaLinear1Circ - class scranton.queue.QueueViaLinear1Circ.

Implements the Queue interface via composition of the Linear1 class, which is used to represent the array as a circularly linked structure.

QueueViaLinear1Circ() - Constructor for class scranton.queue.QueueViaLinear1Circ

Constructs and empty queue

qSize - Variable in class scranton.queue.QueueViaArrayCirc

The actual size of the queue

R

RecursiveBinaryTree - interface scranton.tree.RecursiveBinaryTree.

This interface describes one interpretation of an object oriented versions of the recursive binary tree found in McCarthey's LISP.

RecursiveBinaryTreeViaLinear1 - class scranton.tree.RecursiveBinaryTreeViaLinear1.

This interface describes one interpretation of an object oriented versions of the recursive binary tree found in McCarthey's LISP.

RecursiveBinaryTreeViaLinear1() - Constructor for class scranton.tree.RecursiveBinaryTreeViaLinear1

Construct an empty tree, T=();

RecursiveBinaryTreeViaLinear1(Object, RecursiveBinaryTreeViaLinear1, RecursiveBinaryTreeViaLinear1) - Constructor for class scranton.tree.RecursiveBinaryTreeViaLinear1

Construct a tree, T=(obj, ((),())); NOTE: May be used by extensions of this class to construct

RecursiveList - interface scranton.list.RecursiveList.

A Java interface that parallels lists as defined by John McCarthy in LISP, a list is either empty or it is an ordered pair (head, Tail) where "head" is the object in the list and "Tail" is a, possibly empty, list (sublist).

RecursiveListViaLinear1Ind - class scranton.list.RecursiveListViaLinear1Ind.

A implementation of the RecursiveList paradigm using the Linear1Ind class, the implementation represents an empty list with a "null object".

RecursiveListViaLinear1Ind() - Constructor for class scranton.list.RecursiveListViaLinear1Ind

Constructs a "null object", (null, ()).

RecursiveListViaLinear1Ind(Object) - Constructor for class scranton.list.RecursiveListViaLinear1Ind

Constructs a Linear1 object containing o as its head and an empty tail, (o, ()).

remove() - Method in class scranton.IteratorThread

Remove is not implemented within the thread.

remove() - Method in interface scranton.list.PositionalList

Removes the current item from the list

remove() - Method in class scranton.list.PositionalListVia2Stacks

remove() - Method in interface scranton.list.RecursiveList

If this = (h, T), remove the current list and replace it by its tail, this' = T, return (h, ()).

remove() - Method in class scranton.list.RecursiveListViaLinear1Ind

remove() - Method in interface scranton.queue.PriorityQueue

Method remove the object from the front of the PriorityQueue, a₀.

remove() - Method in interface scranton.tree.Heap

Method removes the root and applies the heap siftDown process to maintain the heap correctly.

remove() - Method in class scranton.tree.HeapViaArray

Method remove removes the root and applies the siftDown process to maintain the heap correctly.

removeback - Variable in class scranton.IteratorThread

Feedback to the extended class used by the remove() method.

removebox - Variable in class scranton.IteratorThread

The producer/consumer info to remove the object in the mailbox

replace(Object) - Method in interface scranton.list.PositionalList

Replaces item at current position in the list with obj.

replace(Object) - Method in class scranton.list.PositionalListVia2Stacks

rightSubtree() - Method in interface scranton.tree.RecursiveBinaryTree

Returns a reference to the right subtree of the current tree.

rightSubtree() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

rightchild(int) - Method in class scranton.tree.HeapViaArray

Method rightchild.

rlPromote() - Method in class scranton.tree.BinarySearchTree

Performs a clockwise rotation around the right subchild of "this" before performing a counterClockwise rotation around "this".

S

Stack - interface scranton.stack.Stack.

Specifications for a (pushdown) stack, the semi-formal notation for specifications appears on the notation page.

StackViaArray - class scranton.stack.StackViaArray.

An implementation of the Stack interface using an array via composition.

StackViaArray() - Constructor for class scranton.stack.StackViaArray

Constructs a stack, the client does not specify an intial size.

StackViaArray(int) - Constructor for class scranton.stack.StackViaArray

Constructs a stack of a size determined by the client.

StackViaLinear1 - class scranton.stack.StackViaLinear1.

An implementation of the Stack interface applying the the Linear1 class via composition.

StackViaLinear1() - Constructor for class scranton.stack.StackViaLinear1

Constructs an empty stack.

StackViaLinear1Ind - class scranton.stack.StackViaLinear1Ind.

An implementation of the Stack interface via extension of the Linear1Ind class.

StackViaLinear1Ind() - Constructor for class scranton.stack.StackViaLinear1Ind

Constructs an empty stack by extending the Linear1Indclass.

StackViaLinear1Ind(Object) - Constructor for class scranton.stack.StackViaLinear1Ind

This constructor is for use by extensions of this class.

Stk - Variable in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

The stack contains the path from the root (bottom of the stack) to the current tree (top of the stack).

scranton - package scranton

Contains the recursive classes that are applied in the construction of the recursive implementations of various containers.

scranton.list - package scranton.list

Contains interfaces for several list paradigms, along with various implementations.

scranton.queue - package scranton.queue

Contains the Queue interface and several static and recursive implementations of the Queue interface.

scranton.stack - package scranton.stack

Contains the Stack interface and several static and recursive implementations of the Stack interface.

scranton.tree - package scranton.tree

Contains several interfaces for trees along with implementations.

setData(Object) - Method in class scranton.Linear1

Replace the current data field reference with a reference to newData.

setLink(Linear1) - Method in class scranton.Linear1

Replace the current contents of the link field with a reference to the newLink Linear1 object.

setNext(Linear2) - Method in class scranton.Linear2

Replace the current contents of the link field with a reference to the newLink Linear2 object.

setNode(Object) - Method in interface scranton.tree.PositionalBinaryTree

Replace the current root with obj

setNode(Object) - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Replace the current root with obj

setPrevious(Linear2) - Method in class scranton.Linear2

Replace the current contents of the previous field with a reference to the newLink Linear2 object.

setRoot(Object) - Method in interface scranton.tree.RecursiveBinaryTree

Modify the root of the current tree.

setRoot(Object) - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

sideways(String, char, int) - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

Constructs a stylized string representation of a binary tree structure that appears sideways when displayed.

siftDown(int) - Method in class scranton.tree.HeapViaArray

Method siftDown implements the siftDown process.

siftUp(int) - Method in class scranton.tree.HeapViaArray

Method siftUp apply the siftUp method starting at curr.

size() - Method in interface scranton.tree.Heap

Method size reports the current size of the heap.

size() - Method in class scranton.tree.HeapViaArray

Method size reports the current size of the heap.

swap(int, int) - Method in class scranton.tree.HeapViaArray

Method swap interchanges two objects in the array.

T

T - Variable in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

The recursive binary tree used to represent the entire tree structure.

tailOf() - Method in interface scranton.list.RecursiveList

Returns reference to the tail of the current list.

tailOf() - Method in class scranton.list.RecursiveListViaLinear1Ind

terminate - Variable in class scranton.IteratorThread

Set to true when the consumer terminates the process.

terminate() - Method in class scranton.IteratorThread

Referenced by the client when the client wishes to abort the iteration.

toFront() - Method in interface scranton.list.PositionalList

Moves current viewing position to front of list Pre: none Post: L'==(), R'==(L, R)

toFront() - Method in class scranton.list.PositionalListVia2Stacks

toLeftSubtree() - Method in interface scranton.tree.PositionalBinaryTree

Navigates to the left subtree of the current tree.

toLeftSubtree() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Navigates to the left subtree of the current tree.

toParent() - Method in interface scranton.tree.PositionalBinaryTree

Navigates to the parent of the current tree.

toParent() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Navigates to the parent of the current tree.

toRear() - Method in interface scranton.list.PositionalList

Moves current viewing position to rear of list Pre: none Post: L'==(L, R), R'==()

toRear() - Method in class scranton.list.PositionalListVia2Stacks

toRightSubtree() - Method in interface scranton.tree.PositionalBinaryTree

Navigates to the right subtree of the current tree.

toRightSubtree() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Navigates to the right subtree of the current tree.

toRoot() - Method in interface scranton.tree.PositionalBinaryTree

Navigates to the root of the tree structure.

toRoot() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Navigates to the root of the tree structure.

toString() - Method in class scranton.Linear1

Returns a string composed of a tab delimited sequence of the data.toString()s of the objects in the recursive Linear1 structure.

toString() - Method in class scranton.Linear1Ind

Returns a string composed of a tab delimited sequence of the data.toString()s of the objects in the recursive Linear1Ind structure starting at one level of indirection from this.

toString() - Method in interface scranton.list.PositionalList

Return a string representation of a positonal list.

toString() - Method in class scranton.list.PositionalListVia2Stacks

toString() - Method in interface scranton.list.RecursiveList

Returns a string representation of the list.

toString() - Method in class scranton.list.RecursiveListViaLinear1Ind

toString() - Method in interface scranton.queue.Queue

Returns a string representation of the queue.

toString() - Method in class scranton.queue.QueueViaArrayCirc

toString() - Method in class scranton.queue.QueueViaLinear1Circ

toString() - Method in interface scranton.stack.Stack

Returns a string representation of the stack.

toString() - Method in class scranton.stack.StackViaArray

toString() - Method in class scranton.stack.StackViaLinear1

toString() - Method in class scranton.stack.StackViaLinear1Ind

toString() - Method in interface scranton.tree.PositionalBinaryTree

Returns a string representation of the tree.

toString() - Method in class scranton.tree.PositionalBinaryTreeViaRecTreeWStk

Returns a parenthesized string representation of the tree at the current position.

toString() - Method in interface scranton.tree.RecursiveBinaryTree

Returns a string representation of the tree.

toString() - Method in class scranton.tree.RecursiveBinaryTreeViaLinear1

tookLast() - Method in class scranton.IteratorThread

Called by the extended class's run method after all objects have been produced, it sets the "finished" flag after the last object has been consumed, or if the consumer terminated the iteration.

topOf() - Method in interface scranton.stack.Stack

Stack does not change, returns the reference to the top object in the stack.

topOf() - Method in class scranton.stack.StackViaArray

Stack does not change, returns the reference to the top object in the stack.

topOf() - Method in class scranton.stack.StackViaLinear1

topOf() - Method in class scranton.stack.StackViaLinear1Ind

V

view() - Method in interface scranton.list.PositionalList

Returns a reference to the current item in list.

view() - Method in class scranton.list.PositionalListVia2Stacks

A B C D E F G H I L M N O P Q R S T V