lrs
Interface IAlgo<T,R,P>
- All Known Implementing Classes:
- InsertInOrder
public interface IAlgo<T,R,P>
Represents an abstract algorithm on an LRStruct. Acts as a visitor to a
LRStruct host.
Since LRStruct is a mutable data structure, we require an exact match for
the data type (LRStruct, not LRStruct extends T>).
- Since:
- 8/25/05
Method Summary |
R |
emptyCase(LRStruct<T> host,
P... inp)
Operates on an empty LRStruct host, given an input object. |
R |
nonEmptyCase(LRStruct<T> host,
P... inp)
Operates on a non-empty LRStruct host, given an input object. |
emptyCase
R emptyCase(LRStruct<T> host,
P... inp)
- Operates on an empty LRStruct host, given an input object.
- Parameters:
host
- an empty LRStruct.inp
- variable input list of objects needed by this IVisitor.
- Returns:
- an appropriate output object.
nonEmptyCase
R nonEmptyCase(LRStruct<T> host,
P... inp)
- Operates on a non-empty LRStruct host, given an input object.
- Parameters:
host
- a non-empty LRStruct.inp
- variable input list of objects needed by this IVisitor.
- Returns:
- an appropriate output object.