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

A

Add - Class in fp

Adding two Integers

Add() - Constructor for class fp.Add

add - Variable in class fp.Test_Add

algo - Variable in class listFW.test.TestAppend

algo - Variable in class listFW.test.TestReverse

ALRSRACFactory<T> - Class in rac

Implements a factory for restricted access containers.

ALRSRACFactory() - Constructor for class rac.ALRSRACFactory

ALRSRACFactory.LRSRAContainer<T> - Class in rac

Implements a general-purpose restricted access container using an LRStruct.

ALRSRACFactory.LRSRAContainer(IAlgo<T, LRStruct<T>, T>) - Constructor for class rac.ALRSRACFactory.LRSRAContainer

ANode<T> - Class in brs

Represents the state of the owner binary tree structure.

ANode() - Constructor for class brs.ANode

ANode<T> - Class in lrs

Represents the abstract list state.

ANode() - Constructor for class lrs.ANode

Append<T> - Class in listFW.visitor

Append another list, passed as input[0], at the end of this list.

Append(IListFactory<T>) - Constructor for class listFW.visitor.Append

apply(Integer...) - Method in class fp.Add

Adds zero to many Integer.

apply(Object...) - Method in class fp.Cons

Creates an INEList with a given first and rest.

apply(T, IList<T>) - Method in class fp.Cons2

Creates an NEList with a given first and rest.

apply(T...) - Method in class fp.Identity

apply(P...) - Method in interface fp.ILambda

apply(P) - Method in interface fp.ILambda1

apply(P, Q) - Method in interface fp.ILambda2

apply(P, Q, S) - Method in interface fp.ILambda3

B

BiTree<T> - Class in brs

Models the binary tree structure using the state pattern and the visitor pattern.

BiTree() - Constructor for class brs.BiTree

Initializes this BiTree to the empty state.

brs - package brs

brs.visitor - package brs.visitor

C

clear() - Method in class rac.ALRSRACFactory.LRSRAContainer

Empty the container.

clear() - Method in interface rac.IRAContainer

Empty the container.

CompositeListFactory<E> - Class in listFW.factory

Manufactures concrete IMTList and INEList objects.

CompositeListFactory() - Constructor for class listFW.factory.CompositeListFactory

Cons<T> - Class in fp

Makes new NEList given a first and rest.

Cons(IListFactory<T>) - Constructor for class fp.Cons

Cons2<T> - Class in fp

Makes new NEList given a first and rest.

Cons2(IListFactory<T>) - Constructor for class fp.Cons2

CopyList<T> - Class in listFW.visitor

Copies an IList using the an IListFactory supplied as an input parameter

CopyList() - Constructor for class listFW.visitor.CopyList

CopyList2<T> - Class in listFW.visitor

Copies an IList using the supplied IListFactory

CopyList2(IListFactory<T>) - Constructor for class listFW.visitor.CopyList2

CopyList3<T> - Class in listFW.visitor

Copies an IList using the an IListFactory supplied as an input parameter

CopyList3() - Constructor for class listFW.visitor.CopyList3

D

DatNode<T> - Class in brs

Stores data and represents a non-empty state.

DatNode(T) - Constructor for class brs.DatNode

Initialize the data element to a given object.

E

elements(IListFactory<T>) - Method in class rac.ALRSRACFactory.LRSRAContainer

Return an immutable list of all elements in the container.

elements(IListFactory<T>) - Method in interface rac.IRAContainer

Return an immutable list of all elements in the container.

emptyCase(BiTree<T>, P...) - Method in interface brs.IVisitor

Called by the host when the host is empty.

emptyCase(BiTree<T>, Void...) - Method in class brs.ToString

Returns "[]", a String representation of an empty binary tree.

emptyCase(BiTree<T>, String...) - Method in class brs.ToStringHelp

Returns "|_[]" to denote an empty tree subtree.

emptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder1

emptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder2

emptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder3

emptyCase(BiTree<T>, Void...) - Method in class brs.visitor.InOrderPrint

emptyCase(IMTList<? extends E>, P...) - Method in interface listFW.IListAlgo

emptyCase(IMTList<? extends T>, IList<T>...) - Method in class listFW.visitor.Append

Returns the input list.

emptyCase(IMTList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.CopyList

emptyCase(IMTList<? extends T>, Void...) - Method in class listFW.visitor.CopyList2

emptyCase(IMTList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.CopyList3

emptyCase(IMTList<? extends T>, P...) - Method in class listFW.visitor.FoldL

Empty case.

emptyCase(IMTList<? extends T>, P...) - Method in class listFW.visitor.FoldR

Empty case.

emptyCase(IMTList<? extends String>, String...) - Method in class listFW.visitor.MakePhrase

emptyCase(IMTList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.Reverse

Returns the empty list.

emptyCase(IMTList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.ReverseList

emptyCase(IMTList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.ReverseList2

emptyCase(IMTList<? extends Object>, IListFactory<?>...) - Method in class listFW.visitor.ReverseList3

emptyCase(IMTList<? extends Integer>, Object...) - Method in class listFW.visitor.SumIntList

emptyCase(IMTList<? extends Integer>, Object...) - Method in class listFW.visitor.SumIntList_Fwd

emptyCase(IMTList<? extends Number>, Object...) - Method in class listFW.visitor.SumIntValList

emptyCase(IMTList<? extends Number>, Object...) - Method in class listFW.visitor.SumNumList

emptyCase(IMTList<? extends Object>, Object...) - Method in class listFW.visitor.ToStringAlgo

Returns "()".

emptyCase(IMTList<? extends Object>, String...) - Method in class listFW.visitor.ToStringHelper

Returns the accumulated String + ")".

emptyCase(LRStruct<T>, P...) - Method in interface lrs.IAlgo

Operates on an empty LRStruct host, given an input object.

emptyCase(LRStruct<T>, T...) - Method in class lrs.visitor.InsertInOrder

Simply inserts the given parameter n at the front.

emptyCase(IRAContainer<T>, P...) - Method in interface rac.IRACVisitor

emptyCase(IRAContainer<T>, Void...) - Method in class rac.visitor.IsEmpty

EmptyNode<T> - Class in brs

Represents the empty state of a BiTree.

EmptyNode() - Constructor for class brs.EmptyNode

EmptyNode<T> - Class in lrs

Represents the empty state of a mutable list LRStruct.

EmptyNode() - Constructor for class lrs.EmptyNode

execute(BiTree<T>, IVisitor<T, R, P>, P...) - Method in class brs.ANode

Calls the appropriate visitor's method to execute the visiting algorithm.

execute(IVisitor<T, R, P>, P...) - Method in class brs.BiTree

Hook to execute any algorithm that presents itself as a visitor to this BiTree.

execute(BiTree<T>, IVisitor<T, R, P>, P...) - Method in class brs.DatNode

Calls algo's nonEmptyCase() method to execute the algorithm algo.

execute(BiTree<T>, IVisitor<T, R, P>, P...) - Method in class brs.EmptyNode

Calls algo's emptyCase () method to execute the algorithm algo.

execute(IListAlgo<? super E, R, P>, P...) - Method in interface listFW.IList

A visitor pattern "hook" method that executes an IListAlgo.

execute(LRStruct<T>, IAlgo<T, R, P>, P...) - Method in class lrs.ANode

Executes a visitor algorithm and returns the output.

execute(LRStruct<T>, IAlgo<T, R, P>, P...) - Method in class lrs.EmptyNode

Calls the IAlgo visitor's empty case.

execute(IAlgo<T, R, P>, P...) - Method in class lrs.LRStruct

Hook method to execute an algorithm with a given input and return an appropriate output object.

execute(LRStruct<T>, IAlgo<T, R, P>, P...) - Method in class lrs.NENode

Calls the visitor's non-empty case.

execute(IRACVisitor<T, R, P>, P...) - Method in class rac.ALRSRACFactory.LRSRAContainer

Extensibility hook to accept a visitor algorithm.

execute(IRACVisitor<T, R, P>, P...) - Method in interface rac.IRAContainer

Extensibility hook to accept a visitor algorithm.

F

f - Variable in class listFW.test.TestAppend

f - Variable in class listFW.test.TestReverse

fac - Variable in class listFW.test.TestAppend

fac - Variable in class listFW.test.TestReverse

fac - Variable in class listFW.visitor.CopyList2

FoldL<T,P> - Class in listFW.visitor

Folds a list, starting at the left side.

FoldL(ILambda2<P, T, P>) - Constructor for class listFW.visitor.FoldL

Constructor for a FoldL algorithm.

FoldR<T,P> - Class in listFW.visitor

Folds a list, starting at the right side.

FoldR(ILambda2<P, T, P>) - Constructor for class listFW.visitor.FoldR

Constructor for a FoldR algorithm.

fp - package fp

G

get() - Method in class rac.ALRSRACFactory.LRSRAContainer

Remove the next item from the container and return it.

get() - Method in interface rac.IRAContainer

Remove the next item from the container and return it.

getFirst() - Method in interface listFW.INEList

"Gettor" method for the list's first.

getFirst(LRStruct<T>) - Method in class lrs.ANode

Returns the first data object of the referencing LRStruct.

getFirst(LRStruct<T>) - Method in class lrs.EmptyNode

Throws java.util.NoSuchElementException.

getFirst() - Method in class lrs.LRStruct

Gets the first data element from this LRStruct

getFirst(LRStruct<T>) - Method in class lrs.NENode

getHead() - Method in class lrs.LRStruct

Gets the head node (i.e.

getLeftSubTree(BiTree<T>) - Method in class brs.ANode

Gets the left subtree of the owner tree.

getLeftSubTree() - Method in class brs.BiTree

Gets the left subtree of this BiTree if it exists.

getLeftSubTree(BiTree<T>) - Method in class brs.DatNode

Gets the left subtree of the owner tree.

getLeftSubTree(BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

getRest() - Method in interface listFW.INEList

"Gettor" method for the list's rest.

getRest(LRStruct<T>) - Method in class lrs.ANode

Returns the tail LRStruct of the referencing LRStruct.

getRest(LRStruct<T>) - Method in class lrs.EmptyNode

Throws java.util.NoSuchElementException.

getRest() - Method in class lrs.LRStruct

Gets the rest of this LRStruct.

getRest(LRStruct<T>) - Method in class lrs.NENode

getRightSubTree(BiTree<T>) - Method in class brs.ANode

Gets the right subtree of the owner tree.

getRightSubTree() - Method in class brs.BiTree

Gets the right subtree of this BiTree if it exsists.

getRightSubTree(BiTree<T>) - Method in class brs.DatNode

Gets the right subtree of the owner tree.

getRightSubTree(BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

getRootDat(BiTree<T>) - Method in class brs.ANode

Gets the root data of the owner tree if it exists.

getRootDat() - Method in class brs.BiTree

Gets the root data of this BiTree if it exists.

getRootDat(BiTree<T>) - Method in class brs.DatNode

Gets the root data of the owner Tree.

getRootDat(BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

getRootNode() - Method in class brs.BiTree

Returns the current node (i.e.

H

helper - Variable in class listFW.visitor.SumIntList_Fwd

I

IAlgo<T,R,P> - Interface in lrs

Represents an abstract algorithm on an LRStruct.

Identity<T> - Class in fp

Identity function.

Identity() - Constructor for class fp.Identity

ILambda<R,P> - Interface in fp

Varargs lambda.

ILambda1<R,P> - Interface in fp

Unary lambda.

ILambda2<R,P,Q> - Interface in fp

Binary lambda.

ILambda3<R,P,Q,S> - Interface in fp

Ternary lambda.

IList<E> - Interface in listFW

Defines an immutable list that holds elements of type E.

IListAlgo<E,R,P> - Interface in listFW

A visitor to (algorithm on) an IList where T is a subclass of E Also parameterized by it return type R and parameter type T.

IListFactory<E> - Interface in listFW

Abstract factory to manufacture IEmptyList and INEList.

IMTList<E> - Interface in listFW

Represents the structural behavior of the immutable empty list.

INEList<E> - Interface in listFW

Represents the structural behavior of an immutable non-empty list that holds elements of type E.

InOrder1<T,P> - Class in brs.visitor

Traverse a binary tree in order: For an empty tree: do the appropriate processing.

InOrder1(ILambda3<P, P, BiTree<T>, P>) - Constructor for class brs.visitor.InOrder1

InOrder2<T,P> - Class in brs.visitor

Traverse a binary tree in order: For an empty tree: do the appropriate processing.

InOrder2(ILambda2<P, P, P>, ILambda2<P, P, BiTree<T>>) - Constructor for class brs.visitor.InOrder2

InOrder3<T,P> - Class in brs.visitor

Traverse a binary tree in order: For an empty tree: do the appropriate processing.

InOrder3(ILambda3<P, P, P, P>, ILambda3<P, P, BiTree<T>, P>, ILambda2<P, P, P>) - Constructor for class brs.visitor.InOrder3

InOrderPrint<T> - Class in brs.visitor

Print all the numbers in a tree in in-order, line by line

InOrderPrint() - Constructor for class brs.visitor.InOrderPrint

insertFront(T, LRStruct<T>) - Method in class lrs.ANode

Inserts a data object at the front of the LRStruct owner.

insertFront(T, LRStruct<T>) - Method in class lrs.EmptyNode

The owner becomes non-empty and has dat as its first element.

insertFront(T) - Method in class lrs.LRStruct

Inserts dat to the front of this LRStruct.
post condition: getFirst() now returns dat.

insertFront(T, LRStruct<T>) - Method in class lrs.NENode

Inserts a data object at the front of the LRStruct owner.

InsertInOrder<T> - Class in lrs.visitor

Algorithm for inserting elements into an LRStruct in order.

InsertInOrder(Comparator<T>) - Constructor for class lrs.visitor.InsertInOrder

insertRoot(BiTree<T>, T) - Method in class brs.ANode

Inserts a root element to the owner tree.

insertRoot(T) - Method in class brs.BiTree

Inserts a root element to this BiTree.

insertRoot(BiTree<T>, T) - Method in class brs.DatNode

Throws an IllegalStateException because the owner tree is not empty.

insertRoot(BiTree<T>, T) - Method in class brs.EmptyNode

Asks the owner tree to set the root node to a new DatNode containing dat, resulting in a state change from empty to non-empty.

IRACFactory<T> - Interface in rac

Abstract Factory to manufacture RACs.

IRAContainer<T> - Interface in rac

Defines the interface for a restricted access container.

IRACVisitor<T,R,P> - Interface in rac

Visitor on a RAC.

IsEmpty<T> - Class in rac.visitor

Visitor that returns true if the RAC is empty.

IsEmpty() - Constructor for class rac.visitor.IsEmpty

isFull() - Method in class rac.ALRSRACFactory.LRSRAContainer

Return TRUE if the container is full; otherwise, return FALSE.

isFull() - Method in interface rac.IRAContainer

Return TRUE if the container is full; otherwise, return FALSE.

IVisitor<T,R,P> - Interface in brs

Represents all extrinsic algorithms on a BiTree as a visitor to the BiTree host structure.

L

listFW - package listFW

listFW.factory - package listFW.factory

listFW.test - package listFW.test

listFW.visitor - package listFW.visitor

lrs - package lrs

lrs.visitor - package lrs.visitor

LRSQueueFactory<T> - Class in rac

FIFO RAC

LRSQueueFactory() - Constructor for class rac.LRSQueueFactory

LRSStackFactory<T> - Class in rac

LIFO RAC.

LRSStackFactory() - Constructor for class rac.LRSStackFactory

LRStruct<T> - Class in lrs

Mutable linear recursive structure.

LRStruct() - Constructor for class lrs.LRStruct

Initializes this LRStruct to the empty state.

LRStruct(ANode<T>) - Constructor for class lrs.LRStruct

Initiazes this LRStruct with a given head node.

M

main(String[]) - Static method in class brs.visitor.InOrder1

main(String[]) - Static method in class brs.visitor.InOrder2

main(String[]) - Static method in class brs.visitor.InOrder3

main(String[]) - Static method in class brs.visitor.InOrderPrint

main(String[]) - Static method in class fp.Add

makeEmptyList() - Method in class listFW.factory.CompositeListFactory

Creates an empty list.

makeEmptyList() - Method in interface listFW.IListFactory

Creates an empty list.

makeNEList(E, IList<? extends E>) - Method in class listFW.factory.CompositeListFactory

Creates a non-empty list containing a given first and a given rest.

makeNEList(E, IList<? extends E>) - Method in interface listFW.IListFactory

Creates a non-empty list containing a given first and a given rest.

MakePhrase - Class in listFW.visitor

A test algorithm that works on a list of strings, combining the elements into a single String.

MakePhrase() - Constructor for class listFW.visitor.MakePhrase

makeRAC() - Method in interface rac.IRACFactory

Returns an empty IRAContainer.

makeRAC() - Method in class rac.LRSQueueFactory

Create a ``first-in, first-out'' (FIFO) container.

makeRAC() - Method in class rac.LRSStackFactory

Create a ``last-in, first-out'' (LIFO) container.

makeRAC() - Method in class rac.PQComparatorRACFactory

Create a container that returns the item with the highest priority according to a given Comparator.

makeRAC() - Method in class rac.RandomRACFactory

Create a container that returns a random item.

mt - Variable in class listFW.test.TestAppend

mt - Variable in class listFW.test.TestReverse

mtList - Variable in class listFW.factory.CompositeListFactory

Note: A parametrized IMTList(E> cannot be static.

N

ne1 - Variable in class listFW.test.TestAppend

ne2 - Variable in class listFW.test.TestAppend

NENode<T> - Class in lrs

Represents the non-empty state of a LStruct.

NENode(T, LRStruct<T>) - Constructor for class lrs.NENode

Initializes this NENode to contain dat and a given tail list.

nonEmptyCase(BiTree<T>, P...) - Method in interface brs.IVisitor

Called by the host when the host is not empty.

nonEmptyCase(BiTree<T>, Void...) - Method in class brs.ToString

Computes a String representation of the binary tree host so that it can be printed vertically.

nonEmptyCase(BiTree<T>, String...) - Method in class brs.ToStringHelp

Computes a String representation of the binary tree host so that it can be printed vertically.

nonEmptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder1

nonEmptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder2

nonEmptyCase(BiTree<T>, P...) - Method in class brs.visitor.InOrder3

nonEmptyCase(BiTree<T>, Void...) - Method in class brs.visitor.InOrderPrint

nonEmptyCase(INEList<? extends E>, P...) - Method in interface listFW.IListAlgo

nonEmptyCase(INEList<? extends T>, IList<T>...) - Method in class listFW.visitor.Append

Returns the appended lists.

nonEmptyCase(INEList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.CopyList

nonEmptyCase(INEList<? extends T>, Void...) - Method in class listFW.visitor.CopyList2

nonEmptyCase(INEList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.CopyList3

nonEmptyCase(INEList<? extends T>, P...) - Method in class listFW.visitor.FoldL

Non-empty case.

nonEmptyCase(INEList<? extends T>, P...) - Method in class listFW.visitor.FoldR

Non-empty case.

nonEmptyCase(INEList<? extends String>, String...) - Method in class listFW.visitor.MakePhrase

nonEmptyCase(INEList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.Reverse

Returns the reversed list.

nonEmptyCase(INEList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.ReverseList

nonEmptyCase(INEList<? extends T>, IListFactory<T>...) - Method in class listFW.visitor.ReverseList2

nonEmptyCase(INEList<? extends Object>, IListFactory<?>...) - Method in class listFW.visitor.ReverseList3

nonEmptyCase(INEList<? extends Integer>, Object...) - Method in class listFW.visitor.SumIntList

nonEmptyCase(INEList<? extends Integer>, Object...) - Method in class listFW.visitor.SumIntList_Fwd

nonEmptyCase(INEList<? extends Number>, Object...) - Method in class listFW.visitor.SumIntValList

nonEmptyCase(INEList<? extends Number>, Object...) - Method in class listFW.visitor.SumNumList

nonEmptyCase(INEList<? extends Object>, Object...) - Method in class listFW.visitor.ToStringAlgo

Passes "(" + first to the rest of IList and asks for help to complete the computation.

nonEmptyCase(INEList<? extends Object>, String...) - Method in class listFW.visitor.ToStringHelper

Continues accumulating the String representation by appending ", " + first to acc and recur!

nonEmptyCase(LRStruct<T>, P...) - Method in interface lrs.IAlgo

Operates on a non-empty LRStruct host, given an input object.

nonEmptyCase(LRStruct<T>, T...) - Method in class lrs.visitor.InsertInOrder

Based on the comparison between first and n, inserts at the front or recurs!

nonEmptyCase(IRAContainer<T>, P...) - Method in interface rac.IRACVisitor

nonEmptyCase(IRAContainer<T>, Void...) - Method in class rac.visitor.IsEmpty

P

peek() - Method in class rac.ALRSRACFactory.LRSRAContainer

Return the next element in this IRAContainer withour removing it.

peek() - Method in interface rac.IRAContainer

Return the next element in this IRAContainer withour removing it.

PQComparatorRACFactory<T extends java.lang.Comparable<T>> - Class in rac

PQComparatorRACFactory() - Constructor for class rac.PQComparatorRACFactory

Used when the items in the container are Comparable objects.

PQComparatorRACFactory(Comparator<T>) - Constructor for class rac.PQComparatorRACFactory

Used when we want to prioritize the items according to a given Comparator.

put(T) - Method in class rac.ALRSRACFactory.LRSRAContainer

Add an item to the container.

put(T) - Method in interface rac.IRAContainer

Add an item to the container.

R

rac - package rac

rac.test - package rac.test

rac.visitor - package rac.visitor

RandomRACFactory<T> - Class in rac

RandomRACFactory() - Constructor for class rac.RandomRACFactory

removeFront(LRStruct<T>) - Method in class lrs.ANode

Removes and returns the first data object for the referencing LRStruct.

removeFront(LRStruct<T>) - Method in class lrs.EmptyNode

Throws java.util.NoSuchElementException.

removeFront() - Method in class lrs.LRStruct

Removes and returns this LRStruct's first.

removeFront(LRStruct<T>) - Method in class lrs.NENode

remRoot(BiTree<T>) - Method in class brs.ANode

Removes and returns the root element from the owner tree.

remRoot() - Method in class brs.BiTree

Removes and returns the root data element of this BiTree.

remRoot(BiTree<T>) - Method in class brs.DatNode

Removes and returns the root element from the owner tree by asking the left subtree and, if necessary, the right subtree to help do the job.

remRoot(BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

Reverse<T> - Class in listFW.visitor

Reverses a list.

Reverse() - Constructor for class listFW.visitor.Reverse

ReverseList<T> - Class in listFW.visitor

Reverses a particular kind of list only

ReverseList() - Constructor for class listFW.visitor.ReverseList

ReverseList2<T> - Class in listFW.visitor

Reverses a particular kind of list only, but with reduced type safety due to delegating to host instead of rest.

ReverseList2() - Constructor for class listFW.visitor.ReverseList2

ReverseList3 - Class in listFW.visitor

Attempt to reverse any kind of list, but requires that the factory match the list Could have serious problems at run-time due to type erasure

ReverseList3() - Constructor for class listFW.visitor.ReverseList3

S

s - Variable in class listFW.test.Test_NewList.TestClass

setFirst(T, LRStruct<T>) - Method in class lrs.ANode

Sets a new first data object for the referencing LRStruct.

setFirst(T, LRStruct<T>) - Method in class lrs.EmptyNode

Throws java.util.NoSuchElementException.

setFirst(T) - Method in class lrs.LRStruct

Sets first data element to a new value.

setFirst(T, LRStruct<T>) - Method in class lrs.NENode

setHead(ANode<T>) - Method in class lrs.LRStruct

Changes the head node (i.e.

setLeftSubTree(BiTree<T>, BiTree<T>) - Method in class brs.ANode

Sets the left subtree of the owner tree to a given tree.

setLeftSubTree(BiTree<T>) - Method in class brs.BiTree

Attaches a new left subtree to the left of this BiTree, allowing this BiTree to grow to the left.

setLeftSubTree(BiTree<T>, BiTree<T>) - Method in class brs.DatNode

Sets the left subtree of this Datnode to a given tree.

setLeftSubTree(BiTree<T>, BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

setRest(LRStruct<T>, LRStruct<T>) - Method in class lrs.ANode

Sets a new tail for the referencing LRStruct.

setRest(LRStruct<T>, LRStruct<T>) - Method in class lrs.EmptyNode

Throws java.util.NoSuchElementException.

setRest(LRStruct<T>) - Method in class lrs.LRStruct

Sets a new tail for this LRStruct.
post condition: getRest() now returns tail.

setRest(LRStruct<T>, LRStruct<T>) - Method in class lrs.NENode

setRightSubTree(BiTree<T>, BiTree<T>) - Method in class brs.ANode

Sets the right subtree of the owner tree to a given tree.

setRightSubTree(BiTree<T>) - Method in class brs.BiTree

Attaches a new right subtree to the left of this BiTree, allowing this BiTree to grow to the right.

setRightSubTree(BiTree<T>, BiTree<T>) - Method in class brs.DatNode

Sets the right subtree of this node to a given tree.

setRightSubTree(BiTree<T>, BiTree<T>) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

setRootDat(BiTree<T>, T) - Method in class brs.ANode

Sets the root element of the owner tree to a given data object.

setRootDat(T) - Method in class brs.BiTree

Sets the root data element to a given object.

setRootDat(BiTree<T>, T) - Method in class brs.DatNode

Sets the data element of this node to a given data object.

setRootDat(BiTree<T>, T) - Method in class brs.EmptyNode

Throws java.util.NoSuchElementException.

setRootNode(ANode<T>) - Method in class brs.BiTree

Changes this BiTree to a given new node (i.e.

Singleton - Static variable in class fp.Add

Singleton - Static variable in class listFW.visitor.MakePhrase

Singleton - Static variable in class listFW.visitor.ToStringAlgo

Singleton - Static variable in class listFW.visitor.ToStringHelper

SumIntList - Class in listFW.visitor

Sums a IList using a reverse accumulation (natural recursion) algorithm.

SumIntList() - Constructor for class listFW.visitor.SumIntList

SumIntList_Fwd - Class in listFW.visitor

Sums a IList using a forward accumulation algorithm.

SumIntList_Fwd() - Constructor for class listFW.visitor.SumIntList_Fwd

SumIntValList - Class in listFW.visitor

Sums a list of Numbers, but only the integer part of the values.

SumIntValList() - Constructor for class listFW.visitor.SumIntValList

SumNumList - Class in listFW.visitor

Sums a list of Numbers, including lists of any sub-types.

SumNumList() - Constructor for class listFW.visitor.SumNumList

T

Test_Add - Class in fp

A JUnit test case class.

Test_Add() - Constructor for class fp.Test_Add

test_CopyList() - Method in class listFW.test.Test_NewList

Test copying the list using a copy visitor that takes the factory as its input parameter.

test_CopyList2() - Method in class listFW.test.Test_NewList

Test copying the list using a copy visitor that takes the factory in its constructor and thus does not use its parameter.

test_CopyList3() - Method in class listFW.test.Test_NewList

Test copying the list using a copy visitor that takes the factory as a parameter

test_factory() - Method in class listFW.test.Test_NewList

Test the parameterized list factory

Test_IsEmpty - Class in rac.test

Test case of IsEmpty.

Test_IsEmpty() - Constructor for class rac.test.Test_IsEmpty

test_MakePhrase() - Method in class listFW.test.Test_NewList

Test a more complex visitor that uses an input parameter that is not itself parameterized.

Test_NewList - Class in listFW.test

A JUnit test case class.

Test_NewList() - Constructor for class listFW.test.Test_NewList

Test_NewList.TestClass - Class in listFW.test

Custom class used by the test_ToStringAlgo test

Test_NewList.TestClass(String) - Constructor for class listFW.test.Test_NewList.TestClass

test_RAC() - Method in class rac.test.Test_IsEmpty

test_ReverseList() - Method in class listFW.test.Test_NewList

test_ReverseList2() - Method in class listFW.test.Test_NewList

test_ReverseList3() - Method in class listFW.test.Test_NewList

test_SumIntList() - Method in class listFW.test.Test_NewList

Test the summing of a list of integers

test_SumIntList_Fwd() - Method in class listFW.test.Test_NewList

Test a forward accumulation algorithm which is an algorithm that takes an unparameterized input value.

test_SumIntValList() - Method in class listFW.test.Test_NewList

Test the summing of the integer part of a list of numbers.

test_SumNumList() - Method in class listFW.test.Test_NewList

Test the summing of a list of numbers, which should work on a list of integers or a list of doubles.

test_toString() - Method in class listFW.test.Test_NewList

Test the internal toString() method of a list

test_ToStringAlgo() - Method in class listFW.test.Test_NewList

Tests the universality of the ToStringAlgo visitor.

testAdd() - Method in class fp.Test_Add

TestAppend - Class in listFW.test

Testing appending a list.

TestAppend() - Constructor for class listFW.test.TestAppend

testEmpty() - Method in class listFW.test.TestAppend

testEmpty() - Method in class listFW.test.TestReverse

testEmptyNE() - Method in class listFW.test.TestAppend

testFoldEmpty() - Method in class listFW.test.TestAppend

testFoldEmpty() - Method in class listFW.test.TestReverse

testFoldEmptyNE() - Method in class listFW.test.TestAppend

testFoldNEEmpty() - Method in class listFW.test.TestAppend

testFoldNENE() - Method in class listFW.test.TestAppend

testFoldNonEmpty() - Method in class listFW.test.TestReverse

testNEEmpty() - Method in class listFW.test.TestAppend

testNENE() - Method in class listFW.test.TestAppend

testNonEmpty() - Method in class listFW.test.TestReverse

TestReverse - Class in listFW.test

Testing reversing a list.

TestReverse() - Constructor for class listFW.test.TestReverse

toString() - Method in class brs.BiTree

ToString<T> - Class in brs

Computes a String representation of the binary tree host so that it can be printed vertically.

ToString() - Constructor for class brs.ToString

toString() - Method in class listFW.test.Test_NewList.TestClass

toString(LRStruct<T>) - Method in class lrs.ANode

toString() - Method in class lrs.LRStruct

Returns "()" if empty, otherwise returns the contents of this LRStruct enclosed in parentheses.

toStringAlgo - Static variable in class listFW.factory.CompositeListFactory

ToStringAlgo - Class in listFW.visitor

Computes a String reprsentation of IList showing a left parenthesis followed by elements of the IList separated by commas, ending with with a right parenthesis.

ToStringAlgo() - Constructor for class listFW.visitor.ToStringAlgo

ToStringAlgo - Variable in class lrs.ANode

Uses anonymous visitor class to compute a String representation.

ToStringHelp<T> - Class in brs

Computes a String representation of the binary tree host so that it can be printed vertically, given a leftmost leading string for the two subtrees.

ToStringHelp() - Constructor for class brs.ToStringHelp

ToStringHelper - Class in listFW.visitor

Helps ToStringAlgo compute the String representation of the rest of the list.

ToStringHelper() - Constructor for class listFW.visitor.ToStringHelper

_

_comp - Variable in class rac.PQComparatorRACFactory

_dat - Variable in class brs.DatNode

the stored data element.

_dat - Variable in class lrs.NENode

_f - Variable in class brs.visitor.InOrder1

_f - Variable in class listFW.visitor.FoldL

_f - Variable in class listFW.visitor.FoldR

_fac - Variable in class fp.Cons

_fac - Variable in class fp.Cons2

_fac - Variable in class listFW.visitor.Append

_fLeft - Variable in class brs.visitor.InOrder2

_fLeft - Variable in class brs.visitor.InOrder3

_fRight - Variable in class brs.visitor.InOrder2

_fRight - Variable in class brs.visitor.InOrder3

_fRoot - Variable in class brs.visitor.InOrder3

_head - Variable in class lrs.LRStruct

The state of of this LRStruct.

_insertStrategy - Variable in class rac.ALRSRACFactory.LRSRAContainer

_leftTree - Variable in class brs.DatNode

Data Invariant: != null.

_lrs - Variable in class rac.ALRSRACFactory.LRSRAContainer

_order - Variable in class lrs.visitor.InsertInOrder

_rightTree - Variable in class brs.DatNode

Data Invariant: != null.

_rootNode - Variable in class brs.BiTree

the state of this BiTree.

_tail - Variable in class lrs.NENode

_toString - Variable in class brs.BiTree

Visitor to generate string representation.

_toStringHelp - Variable in class brs.ToString

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