Custom hash-based linked list map which accepts no null keys nor null values,
where equality and hash code calculations are done based on passed
function implementations for keys
and values, as opposed to relying on their own equals/hashCode/toString
implementations. This is handy when using key/values whose mentioned
methods cannot be overriden, i.e. arrays, and in situations where users
want to avoid using wrapper objects.
In order to provide linked list behaviour, entries are linked with each
other in a predictable order.
- Galder Zamarreño
super(initialCapacity, loadFactor, keyEq, valueEq);
return prevNode == null ? null : prevNode.remove();
Exported Entry for iterators
The modCount value that the iterator believes that the backing
List should have. If this expectation is violated, the iterator
has detected concurrent modification.
e.after.before, e.after.after, map);
return entry.key == node.key
&& entry.val == node.value
&& entry.before == node.before
&& entry.after == node.after;