io.lacuna.bifurcan.nodes

Class MapNodes.Collision<K,V>

java.lang.Object

io.lacuna.bifurcan.nodes.MapNodes.Collision<K,V>

Enclosing class:

MapNodes

public static class MapNodes.Collision<K,V>
extends java.lang.Object

Field Summary

Fields

Modifier and Type	Field and Description
java.lang.Object[]	entries
int	hash

Constructor Summary

Constructors

Constructor and Description
Collision(int hash, K k1, V v1, K k2, V v2)

Method Summary

Modifier and Type	Method and Description
boolean	contains(int hash, K key, java.util.function.BiPredicate<K,K> equals)
java.lang.Iterable<IEntry<K,V>>	entries()
boolean	equals(io.lacuna.bifurcan.nodes.MapNodes.INode<K,V> o, java.util.function.BiPredicate<K,K> keyEquals, java.util.function.BiPredicate<V,V> valEquals)
java.lang.Object	get(int hash, K key, java.util.function.BiPredicate<K,K> equals, java.lang.Object defaultValue)
int	hash(int idx)
long	indexOf(int shift, int hash, K key, java.util.function.BiPredicate<K,K> equals)
<U> MapNodes.Collision<K,U>	mapVals(java.lang.Object editor, java.util.function.BiFunction<K,V,U> f)
IEntry<K,V>	nth(long idx)
io.lacuna.bifurcan.nodes.MapNodes.INode<K,V>	put(int shift, java.lang.Object editor, int hash, K key, V value, java.util.function.BiPredicate<K,K> equals, java.util.function.BinaryOperator<V> merge)
io.lacuna.bifurcan.nodes.MapNodes.INode<K,V>	remove(int shift, java.lang.Object editor, int hash, K key, java.util.function.BiPredicate<K,K> equals)
long	size()

Methods inherited from class java.lang.Object

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

Field Detail

hash

public final int hash

entries

public final java.lang.Object[] entries

Constructor Detail

Collision

public Collision(int hash,
                 K k1,
                 V v1,
                 K k2,
                 V v2)

Method Detail

contains

public boolean contains(int hash,
                        K key,
                        java.util.function.BiPredicate<K,K> equals)

get

public java.lang.Object get(int hash,
                            K key,
                            java.util.function.BiPredicate<K,K> equals,
                            java.lang.Object defaultValue)

hash

public int hash(int idx)

nth

public IEntry<K,V> nth(long idx)

indexOf

public long indexOf(int shift,
                    int hash,
                    K key,
                    java.util.function.BiPredicate<K,K> equals)

put

public io.lacuna.bifurcan.nodes.MapNodes.INode<K,V> put(int shift,
                                                        java.lang.Object editor,
                                                        int hash,
                                                        K key,
                                                        V value,
                                                        java.util.function.BiPredicate<K,K> equals,
                                                        java.util.function.BinaryOperator<V> merge)

remove

public io.lacuna.bifurcan.nodes.MapNodes.INode<K,V> remove(int shift,
                                                           java.lang.Object editor,
                                                           int hash,
                                                           K key,
                                                           java.util.function.BiPredicate<K,K> equals)

mapVals

public <U> MapNodes.Collision<K,U> mapVals(java.lang.Object editor,
                                           java.util.function.BiFunction<K,V,U> f)

entries

public java.lang.Iterable<IEntry<K,V>> entries()

size

public long size()

equals

public boolean equals(io.lacuna.bifurcan.nodes.MapNodes.INode<K,V> o,
                      java.util.function.BiPredicate<K,K> keyEquals,
                      java.util.function.BiPredicate<V,V> valEquals)