Package | Description |
---|---|
de.learnlib.filters.reuse | |
de.learnlib.filters.reuse.tree |
Class and 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.
|
ReuseTree
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. |
SystemStateHandler
A implementation of this interface that is set to the
ReuseTree
(see ReuseOracle.ReuseOracleBuilder.withSystemStateHandler(SystemStateHandler) )
will be informed about all removed system states whenever
ReuseTree.disposeSystemstates() gets called. |
Class and 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.
|
ReuseEdge |
ReuseNode |
ReuseNode.NodeResult |
ReuseTree
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. |
ReuseTree.ReuseTreeBuilder |
SystemStateHandler
A implementation of this interface that is set to the
ReuseTree
(see ReuseOracle.ReuseOracleBuilder.withSystemStateHandler(SystemStateHandler) )
will be informed about all removed system states whenever
ReuseTree.disposeSystemstates() gets called. |
Copyright © 2015. All rights reserved.