protected class AbstractGroup.ChildArray extends NotableLinkedList<Item>
modCount| Modifier | Constructor and Description |
|---|---|
protected |
ChildArray() |
| Modifier and Type | Method and Description |
|---|---|
protected void |
onAdd(Item newElement,
Item followingElement)
Called each time an new element is about being added into the array.
|
protected void |
onRemove(Item item)
Called each time an element is about being removed from the array.
|
protected void |
onSet(Item newElement,
Item replaced)
Called each time an element is about being assigned into the array
and replace an existence one (by ListIterator.set).
|
listIterator, sizeadd, addAll, get, iterator, remove, setadd, clear, equals, hashCode, indexOf, lastIndexOf, listIterator, removeRange, subListaddAll, contains, containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, add, addAll, addAll, clear, contains, containsAll, equals, get, hashCode, indexOf, isEmpty, iterator, lastIndexOf, listIterator, remove, remove, removeAll, replaceAll, retainAll, set, sort, spliterator, subList, toArray, toArrayparallelStream, removeIf, streamprotected void onAdd(Item newElement, Item followingElement)
NotableLinkedListDeriving classes usually put checking codes here. And, throws exception if failure and nothing will be affected.
onAdd in class NotableLinkedList<Item>newElement - the element to be addedfollowingElement - the element that will 'follow' the new element.
In other words, newElement will be inserted before
followingElement. If null, it means newElement is appended at the endprotected void onSet(Item newElement, Item replaced)
NotableLinkedListDeriving classes usually put checking codes here. And, throws exception if failure and nothing will be affected.
onSet in class NotableLinkedList<Item>newElement - the element to be addedreplaced - the element to be replacedprotected void onRemove(Item item)
NotableLinkedListonRemove in class NotableLinkedList<Item>Copyright © 2018. All rights reserved.