private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }
private void removeAfter(Node<E> node) { Node<E> toRemove = node.next; node.next = toRemove.next; if (toRemove.next != null) { toRemove.next.prev = node; } if (toRemove == tail) { tail = node; } size--; if (toRemove.iterCount != 0) { LinkedListImpl.this.nudgeIterators(toRemove); } //Help GC - otherwise GC potentially has to traverse a very long list to see if elements are reachable, this can result in OOM //https://jira.jboss.org/browse/HORNETQ-469 toRemove.next = toRemove.prev = null; }