io.lacuna.bifurcan.nodes

Class IntMapNodes.Node<V>

java.lang.Object

io.lacuna.bifurcan.nodes.IntMapNodes.Node<V>

Enclosing class:

IntMapNodes

public static class IntMapNodes.Node<V>
extends java.lang.Object

Field Summary

Fields

Modifier and Type	Field and Description
java.lang.Object[]	content
int	datamap
java.lang.Object	editor
long[]	keys
static IntMapNodes.Node	NEG_EMPTY
int	nodemap
int	offset
static IntMapNodes.Node	POS_EMPTY
long	prefix
int	size

Constructor Summary

Constructors

Constructor and Description
Node(java.lang.Object editor, long prefix, int offset)

Method Summary

Modifier and Type	Method and Description
IEntry<java.lang.Long,V>	ceil(long key)
boolean	equals(IntMapNodes.Node<V> n, java.util.function.BiPredicate<V,V> equalsFn)
IEntry<java.lang.Long,V>	floor(long key)
java.lang.Object	get(long k, java.lang.Object defaultVal)
java.util.OptionalLong	indexOf(long key)
boolean	isNode(int mask)
java.util.Iterator<IEntry<java.lang.Long,V>>	iterator()
long	key(int mask)
<U> IntMapNodes.Node<U>	mapVals(java.lang.Object editor, java.util.function.BiFunction<java.lang.Long,V,U> f)
IntMapNodes.Node<V>	node(int mask)
IEntry<java.lang.Long,V>	nth(long idx)
IntMapNodes.Node<V>	put(java.lang.Object editor, long k, V v, java.util.function.BinaryOperator<V> mergeFn)
IntMapNodes.Node<V>	remove(java.lang.Object editor, long k)
int	size()
IntMapNodes.Node<V>	slice(java.lang.Object editor, long min, long max)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

POS_EMPTY

public static final IntMapNodes.Node POS_EMPTY

NEG_EMPTY

public static final IntMapNodes.Node NEG_EMPTY

editor

public final java.lang.Object editor

prefix

public final long prefix

offset

public final int offset

datamap

public int datamap

nodemap

public int nodemap

size

public int size

keys

public long[] keys

content

public java.lang.Object[] content

Constructor Detail

Node

public Node(java.lang.Object editor,
            long prefix,
            int offset)

Method Detail

get

public java.lang.Object get(long k,
                            java.lang.Object defaultVal)

nth

public IEntry<java.lang.Long,V> nth(long idx)

indexOf

public java.util.OptionalLong indexOf(long key)

floor

public IEntry<java.lang.Long,V> floor(long key)

ceil

public IEntry<java.lang.Long,V> ceil(long key)

mapVals

public <U> IntMapNodes.Node<U> mapVals(java.lang.Object editor,
                                       java.util.function.BiFunction<java.lang.Long,V,U> f)

put

public IntMapNodes.Node<V> put(java.lang.Object editor,
                               long k,
                               V v,
                               java.util.function.BinaryOperator<V> mergeFn)

remove

public IntMapNodes.Node<V> remove(java.lang.Object editor,
                                  long k)

iterator

public java.util.Iterator<IEntry<java.lang.Long,V>> iterator()

slice

public IntMapNodes.Node<V> slice(java.lang.Object editor,
                                 long min,
                                 long max)

size

public int size()

equals

public boolean equals(IntMapNodes.Node<V> n,
                      java.util.function.BiPredicate<V,V> equalsFn)

key

public long key(int mask)

isNode

public boolean isNode(int mask)

node

public IntMapNodes.Node<V> node(int mask)