class QueueLong : VerifiableFIFO Queue with option to remove element from middle
| Node |
data class Node |
| <init> |
QueueLong(store: Store, tailRecid: Long, headRecid: Long, headPrevRecid: Long)FIFO Queue with option to remove element from middle |
| head |
var head: Long |
| headPrev |
var headPrev: Long |
| headPrevRecid |
val headPrevRecid: Long |
| headRecid |
val headRecid: Long |
| store |
val store: Store |
| tail |
var tail: Long |
| tailRecid |
val tailRecid: Long |
| bump |
fun bump(nodeRecid: Long, newTimestamp: Long): Unit |
| clear |
fun clear(): Unit |
| forEach |
fun forEach(body: (Long, Long, Long) -> Unit): Unit |
| printContent |
fun printContent(out: PrintStream): Unit |
| put |
fun put(timestamp: Long, value: Long): Longfun put(timestamp: Long, value: Long, nodeRecid: Long): Unitputs Node into queue, returns recid which represents this node |
| remove |
fun remove(nodeRecid: Long, removeNode: Boolean): Node |
| size |
fun size(): Long |
| take |
fun take(): Node? |
| takeUntil |
fun takeUntil(f: QueueLongTakeUntil): UnitTakes elements, until callback returns true. When callback returns false, last node is preserved in Queue |
| valuesArray |
fun valuesArray(): LongArray |
| verify |
fun verify(): Unit |
| make |
fun make(store: Store = StoreTrivial(), tailRecid: Long = store.put(store.put(null, Node.SERIALIZER), Serializer.RECID), headRecid: Long = store.put(store.get(tailRecid, Serializer.RECID), Serializer.RECID), headPrevRecid: Long = store.put(0L, Serializer.RECID)): QueueLong |