public class RowRecogPartitionStateRepoScheduleStateImpl extends Object implements RowRecogPartitionStateRepoScheduleState
Constructor and Description |
---|
RowRecogPartitionStateRepoScheduleStateImpl(RowRecogPartitionTerminationStateComparator terminationStateCompare) |
Modifier and Type | Method and Description |
---|---|
boolean |
containsKey(long matchBeginTime) |
boolean |
findRemoveAddToList(long matchBeginTime,
RowRecogNFAStateEntry state,
List<RowRecogNFAStateEntry> foundStates)
Find and remove operation, wherein removed items are added to the found list,
returning an indicator whether the item was found and removed
|
long |
firstKey() |
Object |
get(long matchBeginTime) |
boolean |
isEmpty() |
boolean |
putOrAdd(long matchBeginTime,
RowRecogNFAStateEntry state)
Add entry returning true if the key did not exist.
|
void |
removeAddRemoved(long matchBeginTime,
List<RowRecogNFAStateEntry> foundStates) |
public RowRecogPartitionStateRepoScheduleStateImpl(RowRecogPartitionTerminationStateComparator terminationStateCompare)
public boolean isEmpty()
isEmpty
in interface RowRecogPartitionStateRepoScheduleState
public boolean putOrAdd(long matchBeginTime, RowRecogNFAStateEntry state)
RowRecogPartitionStateRepoScheduleState
putOrAdd
in interface RowRecogPartitionStateRepoScheduleState
matchBeginTime
- keystate
- entrypublic Object get(long matchBeginTime)
public long firstKey()
firstKey
in interface RowRecogPartitionStateRepoScheduleState
public void removeAddRemoved(long matchBeginTime, List<RowRecogNFAStateEntry> foundStates)
removeAddRemoved
in interface RowRecogPartitionStateRepoScheduleState
public boolean containsKey(long matchBeginTime)
containsKey
in interface RowRecogPartitionStateRepoScheduleState
public boolean findRemoveAddToList(long matchBeginTime, RowRecogNFAStateEntry state, List<RowRecogNFAStateEntry> foundStates)
RowRecogPartitionStateRepoScheduleState
findRemoveAddToList
in interface RowRecogPartitionStateRepoScheduleState
matchBeginTime
- keystate
- entryfoundStates
- list to be added toCopyright © 2005–2021. All rights reserved.