| net.sourceforge.groboutils.mbtf.v1.IPath
All known Subclasses: net.sourceforge.groboutils.mbtf.v1.engine.PathImpl,
| IPath | | public interface IPath (Code) | | An ordered set of transitions plus a start state, which can be iterated
through to discover a state-machine transition path.
author:
Matt Albrecht groboclown@users.sourceforge.net
version:
$Date: 2003/02/10 22:52:24 $
since:
June 12, 2002 |
| Method Summary | |
| public int | getDepth()
Returns the number of states visited in the path, which should
always equal size() + 2, due to the start and final states,
unless there are no transitions, in which case the depth is 1
(there must always be a start state). | | public IState | getStartState()
Retrieve the starting state for this path. | | public IPathIterator | iterator()
Generate an iterator for this path. | | public int | size()
Returns the number of transitions in the path. |
| getDepth | | public int getDepth()(Code) | | Returns the number of states visited in the path, which should
always equal size() + 2, due to the start and final states,
unless there are no transitions, in which case the depth is 1
(there must always be a start state).
the depth of the path. |
| getStartState | | public IState getStartState()(Code) | | Retrieve the starting state for this path.
the start state for the path, which can never be null. |
| iterator | | public IPathIterator iterator()(Code) | | Generate an iterator for this path. The iterator will only return
transition elements.
a new iterator for the path. |
| size | | public int size()(Code) | | Returns the number of transitions in the path. This is named "size" to
correspond to the java.util
container classes terminology.
the path transition count. |
|
|