Uses of Interface
nl.tue.astar.Record

Packages that use Record

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

Uses of Record in nl.tue.astar

Methods in nl.tue.astar that return Record

Modifier and Type	Method	Description
Record	Delegate.createInitialRecord(H head, Trace trace)	instantiates a record for the given head.
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.
Record	AStarThread.getOptimalRecord(AStarThread.Canceller c)	Returns a Record for an optimal alignment.
Record	AStarThread.getOptimalRecord(AStarThread.Canceller c, int stopAt)	Returns a Record for an optimal alignment.
Record	Record.getPredecessor()	returns the predecessor record.

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

Modifier and Type	Method	Description
void	AStarObserver.edgeTraversed(Record from, Record to)
void	AStarObserver.finalNodeFound(Record node)
gnu.trove.list.TIntList	Head.getModelMoves(Record rec, Delegate<? extends Head,? extends Tail> delegate)	get the model moves that are possible.
Head	Head.getNextHead(Record rec, Delegate<? extends Head,? extends Tail> d, int modelMove, int logMove, int activity)	Produce the next head, given the moves.
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.
void	AStarObserver.initialNodeCreated(Record node)
void	AStarObserver.nodeVisited(Record node)
void	AStarObserver.stoppedUnreliablyAt(Record rec)

Uses of Record in nl.tue.astar.impl

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

Modifier and Type	Method	Description
Record	AbstractAStarThread.getOptimalRecord(AStarThread.Canceller c)
Record	AbstractAStarThread.getOptimalRecord(AStarThread.Canceller c, double timeLimit)
Record	AbstractAStarThread.getOptimalRecord(AStarThread.Canceller c, int stopAt)
Record	AbstractAStarThread.getOptimalRecord(AStarThread.Canceller c, int stopAt, double timeLimit)	gets the optimal record.
protected Record	AbstractAStarThread.poll()

Methods in nl.tue.astar.impl with parameters of type Record

Modifier and Type	Method	Description
protected void	DotGraphAStarObserver.addPathToRoot(Record node)
protected void	DotSpanningTreeObserver.addPathToRoot(Record node)
protected boolean	AbstractAStarThread.allowMove(Record rec, int modelMove, int logMove)	This method handles the filtering of moves in the situation the total ordering is implied.
protected T	AbstractAStarThread.computeNewTail(Record newRec, T tail, H newHead, int modelMove, int movedEvent, int activity)
protected H	AbstractAStarThread.computeNextHead(Record rec, H head, int modelMove, int movedEvent, int activity)
void	DotGraphAStarObserver.edgeTraversed(Record from, Record to)
void	DotSpanningTreeObserver.edgeTraversed(Record from, Record to)
void	FSMGraphAStarObserver.edgeTraversed(Record from, Record to)
void	FSMTraceAStarObserver.edgeTraversed(Record from, Record to)
void	DotGraphAStarObserver.finalNodeFound(Record node)
void	FSMGraphAStarObserver.finalNodeFound(Record node)
void	FSMTraceAStarObserver.finalNodeFound(Record node)
State<H,T>	AbstractAStarThread.StorageHandler.getStoredState(Record rec)
State<H,T>	JavaCollectionStorageHandler.getStoredState(Record rec)
void	DotGraphAStarObserver.initialNodeCreated(Record node)
void	FSMGraphAStarObserver.initialNodeCreated(Record node)
void	FSMTraceAStarObserver.initialNodeCreated(Record node)
protected boolean	AbstractAStarThread.isValidMoveOnLog(Record rec, int nextEvent, int activity, gnu.trove.list.TIntList modelMoves, gnu.trove.list.TIntList syncMoves)
protected boolean	AbstractAStarThread.isValidMoveOnModel(Record rec, gnu.trove.TIntCollection nextEvents, int activity, gnu.trove.list.TIntList modelMoves)
void	DotGraphAStarObserver.nodeVisited(Record node)
void	DotSpanningTreeObserver.nodeVisited(Record node)
void	FSMGraphAStarObserver.nodeVisited(Record node)
void	FSMTraceAStarObserver.nodeVisited(Record node)
protected void	AbstractAStarThread.processMove(H head, T tail, Record rec, int modelMove, int movedEvent, int activity)
protected void	AbstractAStarThread.processMovesForRecord(Record rec, H head, T tail, int stopAt, double timeLimit, long endTime)
protected void	AbstractAStarThread.processMovesForRecordWithUpToDateTail(Record rec, H head, T tail, int stopAt, double timeLimit, long endTime)
<TT extends FastLowerBoundTail> void	AbstractAStarThread.StorageHandler.reComputeFastLowerboundTail(Record rec, TT tail, H head, int storedEstimate)	implementations may assume that TT == T
<TT extends FastLowerBoundTail> void	JavaCollectionStorageHandler.reComputeFastLowerboundTail(Record rec, TT tail, H head, int storedEstimate)
protected void	AbstractAStarThread.setConsidered(Record record)
void	DotGraphAStarObserver.stoppedUnreliablyAt(Record node)
void	FSMGraphAStarObserver.stoppedUnreliablyAt(Record rec)
void	FSMTraceAStarObserver.stoppedUnreliablyAt(Record rec)
void	AbstractAStarThread.StorageHandler.storeStateForRecord(State<H,T> state, Record newRec)
void	JavaCollectionStorageHandler.storeStateForRecord(State<H,T> state, Record newRec)
static java.lang.String	FSMGraphAStarObserver.toString(Record from, Record to)

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

Methods in nl.tue.astar.impl.memefficient with parameters of type Record

Modifier and Type	Method	Description
State<H,T>	MemoryEfficientStorageHandler.getStoredState(Record rec)
<TT extends FastLowerBoundTail> void	MemoryEfficientStorageHandler.reComputeFastLowerboundTail(Record rec, TT tail, H head, int storedEstimate)
void	MemoryEfficientStorageHandler.storeStateForRecord(State<H,T> state, Record newRec)

Uses of Record in nl.tue.astar.util

Fields in nl.tue.astar.util declared as Record

Modifier and Type	Field	Description
protected Record[]	AbstractFastLookupPriorityQueue.queue	Priority queue represented as a balanced binary heap: the two children of queue[n] are queue[2*n+1] and queue[2*(n+1)].

Methods in nl.tue.astar.util that return Record

Modifier and Type	Method	Description
Record	AbstractFastLookupPriorityQueue.contains(Record newRec)
Record	FastLookupPriorityQueue.contains(Record newRec)	Checks if the queue contains a record pointing to the same state as the given record.
Record	AbstractFastLookupPriorityQueue.peek()
protected Record	AbstractFastLookupPriorityQueue.peek(int location)
Record	FastLookupPriorityQueue.peek()
Record	AbstractFastLookupPriorityQueue.poll()
Record	FastLookupPriorityQueue.poll()

Methods in nl.tue.astar.util with parameters of type Record

Modifier and Type	Method	Description
boolean	AbstractFastLookupPriorityQueue.add(Record newE)	Inserts the specified element into this priority queue.
boolean	FastLookupPriorityQueue.add(Record newE)
Record	AbstractFastLookupPriorityQueue.contains(Record newRec)
Record	FastLookupPriorityQueue.contains(Record newRec)	Checks if the queue contains a record pointing to the same state as the given record.
protected abstract boolean	AbstractFastLookupPriorityQueue.isBetter(Record r1, Record r2)
boolean	BreadthFirstFastLookupPriorityQueue.isBetter(Record r1, Record r2)
boolean	DepthFirstFastLookupPriorityQueue.isBetter(Record r1, Record r2)
boolean	RandomFastLookupPriorityQueue.isBetter(Record r1, Record r2)
protected void	AbstractFastLookupPriorityQueue.offer(Record e)	Inserts the specified element into this priority queue.
protected void	AbstractFastLookupPriorityQueue.siftDown(int k, Record x)	Inserts item x at position k, maintaining heap invariant by demoting x down the tree repeatedly until it is less than or equal to its children or is a leaf.
protected void	AbstractFastLookupPriorityQueue.siftUp(int k, Record x)	Inserts item x at position k, maintaining heap invariant by promoting x up the tree until it is greater than or equal to its parent, or is the root.
protected void	AbstractFastLookupPriorityQueue.updateToBetter(int index, Record newRecord)