Uses of Interface
nl.tue.astar.Tail

Packages that use Tail

Package	Description
nl.tue.astar
nl.tue.astar.impl
nl.tue.astar.impl.memefficient

Uses of Tail in nl.tue.astar

Classes in nl.tue.astar with type parameters of type Tail

Modifier and Type	Interface	Description
interface	AStarThread<H extends Head,T extends Tail>	Interface for computing one (or more) alignments between a trace and a model.
static class	AStarThread.CPUEfficient<H extends Head,T extends Tail>
static class	AStarThread.MemoryEfficient<H extends Head,T extends Tail>
interface	Delegate<H extends Head,T extends Tail>
interface	ObservableAStarThread<H extends Head,T extends Tail>

Subinterfaces of Tail in nl.tue.astar

Modifier and Type	Interface	Description
interface	FastLowerBoundTail

Methods in nl.tue.astar with type parameters of type Tail

Modifier and Type	Method	Description
<H extends Head,T extends Tail> State<H,T>	Record.getState(CompressedStore<State<H,T>> storage)	retrieves the state stored at index getState() from the storage.

Methods in nl.tue.astar that return Tail

Modifier and Type	Method	Description
Tail	Tail.getNextTail(Delegate<? extends Head,? extends Tail> d, Head newHead, int modelMove, int logMove, int activity)	constructs the new tail based on the two operations from the old head.
<S> Tail	Tail.getNextTailFromStorage(Delegate<? extends Head,? extends Tail> d, CompressedStore<S> store, long index, int modelMove, int logMove, int activity)	constructs the new tail based on the two operations from the old state, which is stored in the given store at the given index.

Method parameters in nl.tue.astar with type arguments of type Tail

Modifier and Type	Method	Description
void	FastLowerBoundTail.computeEstimate(Delegate<? extends Head,? extends Tail> delegate, Head head, int lastEstimate)	Starts the computation of the exact estimate on the first call.
int	FastLowerBoundTail.getEstimatedCosts(Delegate<? extends Head,? extends Tail> delegate, Head head)	get an estimate of the remaining distance to the target state in the search.
int	Tail.getEstimatedCosts(Delegate<? extends Head,? extends Tail> d, Head head)	get an estimate of the remaining distance to the target state in the search.
gnu.trove.list.TIntList	Head.getModelMoves(Record rec, Delegate<? extends Head,? extends Tail> delegate)	get the model moves that are possible.
gnu.trove.TIntCollection	Record.getNextEvents(Delegate<? extends Head,? extends Tail> delegate, Trace trace)	return the events in the trace that are currently enabled.
Head	Head.getNextHead(Record rec, Delegate<? extends Head,? extends Tail> d, int modelMove, int logMove, int activity)	Produce the next head, given the moves.
Record	Record.getNextRecord(Delegate<? extends Head,? extends Tail> d, Trace trace, Head newHead, long state, int modelMove, int movedEvent, int activity)	creates a new record, based on the operations m and l applied to the old head.
Tail	Tail.getNextTail(Delegate<? extends Head,? extends Tail> d, Head newHead, int modelMove, int logMove, int activity)	constructs the new tail based on the two operations from the old head.
<S> Tail	Tail.getNextTailFromStorage(Delegate<? extends Head,? extends Tail> d, CompressedStore<S> store, long index, int modelMove, int logMove, int activity)	constructs the new tail based on the two operations from the old state, which is stored in the given store at the given index.
gnu.trove.list.TIntList	Head.getSynchronousMoves(Record rec, Delegate<? extends Head,? extends Tail> delegate, gnu.trove.list.TIntList enabled, int activity)	get the synchronous moves that are possible on activity, given the current list of enabled modelMoves.
boolean	Head.isFinal(Delegate<? extends Head,? extends Tail> delegate)	checks if this head belongs to a final state;

Uses of Tail in nl.tue.astar.impl

Classes in nl.tue.astar.impl with type parameters of type Tail

Modifier and Type	Class	Description
class	AbstractAStarThread<H extends Head,T extends Tail>
static interface	AbstractAStarThread.StorageHandler<H extends Head,T extends Tail>	The storageHandler handles the storing and retrieving of elements from the statespace searched by the AStar algorithm
class	JavaCollectionStorageHandler<H extends Head,T extends Tail>
class	State<H extends Head,T extends Tail>	A State can be constructed with or without a tail Both equals and hashcode are defined on the head only The tail is not guaranteed to be non-null
class	StateCompressor<H extends Head,T extends Tail>

Classes in nl.tue.astar.impl that implement Tail

Modifier and Type	Class	Description
class	DijkstraTail	Implementation of the tail that implements the Dijkstra estimate for the AStar, i.e.

Methods in nl.tue.astar.impl that return Tail

Modifier and Type	Method	Description
Tail	DijkstraTail.getNextTail(Delegate<? extends Head,? extends Tail> d, Head oldHead, int modelMove, int logMove, int activity)
<S> Tail	DijkstraTail.getNextTailFromStorage(Delegate<? extends Head,? extends Tail> d, CompressedStore<S> store, long index, int modelMove, int logMove, int activity)

Method parameters in nl.tue.astar.impl with type arguments of type Tail

Modifier and Type	Method	Description
int	DijkstraTail.getEstimatedCosts(Delegate<? extends Head,? extends Tail> d, Head head)
Tail	DijkstraTail.getNextTail(Delegate<? extends Head,? extends Tail> d, Head oldHead, int modelMove, int logMove, int activity)
<S> Tail	DijkstraTail.getNextTailFromStorage(Delegate<? extends Head,? extends Tail> d, CompressedStore<S> store, long index, int modelMove, int logMove, int activity)

Uses of Tail in nl.tue.astar.impl.memefficient

Classes in nl.tue.astar.impl.memefficient with type parameters of type Tail

Modifier and Type	Class	Description
class	MemoryEfficientAStarAlgorithm<H extends Head,T extends Tail>
class	MemoryEfficientStorageHandler<H extends Head,T extends Tail>
interface	StorageAwareDelegate<H extends Head,T extends Tail>
interface	TailInflater<T extends Tail>