Interface IntersectionPathList

All Superinterfaces:

AutoCloseable, Closeable, OsidList, OsidList

public interface IntersectionPathList
extends OsidList

Like all OsidLists , IntersectionPathList provides a means for accessing IntersectionPath elements sequentially either one at a time or many at a time. Examples:

while (ipl.hasNext()) {
     IntersectionPath path = ipl.getNextIntersectionPath();
}            
  

or

while (ipl.hasNext()) {
     IntersectionPath[] paths = ipl.getNextIntersectionPaths(ipl.available());
}            
  

Method Summary

Modifier and Type	Method	Description
IntersectionPath	getNextIntersectionPath()	Gets the next IntersectionPath in this list.
IntersectionPath[]	getNextIntersectionPaths(long n)	Gets the next set of IntersectionPath elements in this list.

Methods inherited from interface Closeable

close

Methods inherited from interface OsidList

close

Modifier and Type	Method	Description
void	close()	Close this list.

Methods inherited from interface OsidList

available, hasNext, skip

Modifier and Type	Method	Description
long	available()	Gets the number of elements available for retrieval.
boolean	hasNext()	Tests if there are more elements in this list.
void	skip(long n)	Skip the specified number of elements in the list.

Method Details

getNextIntersectionPath

IntersectionPath getNextIntersectionPath()
                                  throws OperationFailedException

Gets the next IntersectionPath in this list.

Returns:

the next IntersectionPath in this list. The hasNext() method should be used to test that a next IntersectionPath is available before calling this method.

Throws:

IllegalStateException - no more elements available in this list

OperationFailedException - unable to complete request

Compliance:

mandatory - This method must be implemented.

getNextIntersectionPaths

IntersectionPath[] getNextIntersectionPaths(long n)
                                     throws OperationFailedException

Gets the next set of IntersectionPath elements in this list. The specified amount must be less than or equal to the return from available() .

Parameters:

n - the number of IntersectionPath elements requested which must be less than or equal to available()

Returns:

an array of IntersectionPath elements. The length of the array is less than or equal to the number specified.

Throws:

IllegalStateException - no more elements available in this list

OperationFailedException - unable to complete request

Compliance:

mandatory - This method must be implemented.