public class AbstractPossibleExtensions<BPN extends IBPNode<N>,C extends ICondition<BPN,C,E,F,N,P,T,M>,E extends IEvent<BPN,C,E,F,N,P,T,M>,F extends IFlow<N>,N extends INode,P extends IPlace,T extends ITransition,M extends IMarking<F,N,P,T>> extends TreeSet<E> implements IPossibleExtensions<BPN,C,E,F,N,P,T,M>
| Constructor and Description |
|---|
AbstractPossibleExtensions(IAdequateOrder<BPN,C,E,F,N,P,T,M> order) |
| Modifier and Type | Method and Description |
|---|---|
E |
getMinimal() |
add, addAll, ceiling, clear, clone, comparator, contains, descendingIterator, descendingSet, first, floor, headSet, headSet, higher, isEmpty, iterator, last, lower, pollFirst, pollLast, remove, size, subSet, subSet, tailSet, tailSetequals, hashCode, removeAllcontainsAll, retainAll, toArray, toArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitCopyright © 2017. All rights reserved.