Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
removeInternal(adjacent); // takes care of rebalance and size--
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }
private Entry<K, V> internalPollLastEntry() { if (root == null) { return null; } Node<K, V> result = root.last(); removeInternal(result); return result; }
private Entry<K, V> internalPollFirstEntry() { if (root == null) { return null; } Node<K, V> result = root.first(); removeInternal(result); return result; }