org.mapdb

Class QueueLong

org.mapdb.QueueLong

All Implemented Interfaces:

Verifiable

public class QueueLong
implements Verifiable

FIFO Queue with option to remove element from middle

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	QueueLong.Companion
static class	QueueLong.Node

Field Summary

Fields

Modifier and Type	Field and Description
static QueueLong.Companion	Companion

Constructor Summary

Constructors

Constructor and Description
QueueLong(Store store, long tailRecid, long headRecid, long headPrevRecid) FIFO Queue with option to remove element from middle

Method Summary

Modifier and Type	Method and Description
void	bump(long nodeRecid, long newTimestamp)
void	clear()
void	forEach(Function3<? super java.lang.Long,? super java.lang.Long,? super java.lang.Long,Unit> body)
long	getHead()
long	getHeadPrev()
long	getHeadPrevRecid()
long	getHeadRecid()
Store	getStore()
long	getTail()
long	getTailRecid()
void	printContent(java.io.PrintStream out)
long	put(long timestamp, long value) puts Node into queue, returns recid which represents this node
void	put(long timestamp, long value, long nodeRecid) puts Node into queue, returns recid which represents this node
QueueLong.Node	remove(long nodeRecid, boolean removeNode)
void	setHead(long value)
void	setHeadPrev(long value)
void	setTail(long value)
long	size()
QueueLong.Node	take()
void	takeUntil(QueueLongTakeUntil f) Takes elements, until callback returns true. When callback returns false, last node is preserved in Queue
long[]	valuesArray()
void	verify()

Methods inherited from interface org.mapdb.Verifiable

verify

Field Detail

Companion

public static QueueLong.Companion Companion

Constructor Detail

QueueLong

public QueueLong(Store store,
                 long tailRecid,
                 long headRecid,
                 long headPrevRecid)

FIFO Queue with option to remove element from middle

Method Detail

getTail

public long getTail()

setTail

public void setTail(long value)

getHead

public long getHead()

setHead

public void setHead(long value)

getHeadPrev

public long getHeadPrev()

setHeadPrev

public void setHeadPrev(long value)

put

public long put(long timestamp,
                long value)

puts Node into queue, returns recid which represents this node

put

public void put(long timestamp,
                long value,
                long nodeRecid)

puts Node into queue, returns recid which represents this node

take

public QueueLong.Node take()

takeUntil

public void takeUntil(QueueLongTakeUntil f)

Takes elements, until callback returns true. When callback returns false, last node is preserved in Queue

remove

public QueueLong.Node remove(long nodeRecid,
                             boolean removeNode)

bump

public void bump(long nodeRecid,
                 long newTimestamp)

clear

public void clear()

size

public long size()

verify

public void verify()

valuesArray

public long[] valuesArray()

forEach

public void forEach(Function3<? super java.lang.Long,? super java.lang.Long,? super java.lang.Long,Unit> body)

printContent

public void printContent(java.io.PrintStream out)

getStore

public Store getStore()

getTailRecid

public long getTailRecid()

getHeadRecid

public long getHeadRecid()

getHeadPrevRecid

public long getHeadPrevRecid()