Package | Description |
---|---|
org.processmining.lpm.adjustedalignments |
Modifier and Type | Method and Description |
---|---|
protected PHead |
PHead.createHead(nl.tue.astar.util.ShortShortMultiset marking,
nl.tue.astar.util.ShortShortMultiset parikh,
int hashCode) |
PHead |
PHead.getNextHead(nl.tue.astar.Record rec,
nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d,
int modelMove,
int logMove,
int activity) |
PHead |
PHeadCompressor.inflate(java.io.InputStream stream) |
Modifier and Type | Method and Description |
---|---|
nl.tue.storage.EqualOperation<nl.tue.astar.impl.State<PHead,T>> |
AbstractPDelegate.getHeadBasedEqualOperation() |
nl.tue.storage.HashOperation<nl.tue.astar.impl.State<PHead,T>> |
AbstractPDelegate.getHeadBasedHashOperation() |
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
Modifier and Type | Method and Description |
---|---|
nl.tue.astar.Record |
AbstractPDelegate.createInitialRecord(PHead head,
nl.tue.astar.Trace trace) |
nl.tue.astar.impl.DijkstraTail |
PDelegate.createInitialTail(PHead head) |
void |
PHeadCompressor.deflate(PHead object,
java.io.OutputStream stream) |
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
void |
PHeadCompressor.skip(PHead head,
nl.tue.storage.impl.SkippableOutputStream out) |
Modifier and Type | Method and Description |
---|---|
boolean |
PHeadCompressor.equals(nl.tue.astar.impl.State<PHead,T> object,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
boolean |
PHeadCompressor.equals(nl.tue.astar.impl.State<PHead,T> object,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
protected boolean |
PHeadCompressor.equalsInflating(nl.tue.astar.impl.State<PHead,T> vector,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
protected boolean |
PHeadCompressor.equalsInflating(nl.tue.astar.impl.State<PHead,T> vector,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
int |
PHeadCompressor.getHashCode(nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
int |
PHeadCompressor.getHashCode(nl.tue.astar.impl.State<PHead,T> object) |
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
void |
PDelegate.setStateSpace(nl.tue.storage.CompressedHashSet<nl.tue.astar.impl.State<PHead,nl.tue.astar.impl.DijkstraTail>> statespace) |