void (final Entry<V> e) { if (!accessOrder) { return; } final Entry<V> top = this.top; if (top != e) { final Entry<V> prev = e.previous; final Entry<V> next = e.next; prev.next = next; if (next != null) { next.previous = prev; } else { back = prev; } top.previous = e; e.next = top; e.previous = null; this.top = e; } }