Module de.learnlib.filter.reuse

Package de.learnlib.filter.reuse.tree

Interface Summary

Interface	Description
SystemStateHandler<S>	An implementation of this interface that is set to the ReuseTree (see ReuseOracleBuilder.withSystemStateHandler(SystemStateHandler)) will be informed about all removed system states whenever ReuseTree.disposeSystemStates() gets called.

Class Summary

Class	Description
BoundedDeque<E>	A generic deque-derived container which transparently acts either as a stack or a queue, and optionally a capacity restriction with a configurable policy which element is evicted (or reject) if the maximum capacity is reached.
ReuseEdge<S,I,O>	A ReuseEdge connects two ReuseNode's in the ReuseTree and is labeled with input and output behavior.
ReuseNode<S,I,O>	A ReuseNode is a vertex in the ReuseTree that contains (a possibly empty) set of outgoing ReuseEdges.
ReuseNode.NodeResult<S,I,O>
ReuseTree<S,I,O>	The ReuseTree is a tree like structure consisting of nodes (see ReuseNode) and edges (see ReuseEdge) that is used by the ReuseOracle: Nodes may contain a system state (see ReuseNode.fetchSystemState(boolean)) that could be used for executing suffixes of membership queries.
ReuseTreeBuilder<S,I,O>	A builder for constructing ReuseTree instances.

Enum Summary

Enum	Description
BoundedDeque.AccessPolicy	The policy which determines in which order elements are accessed.
BoundedDeque.EvictPolicy	The policy which determines in which order elements are removed if the maximum capacity is reached.