Class IShortList.IReadOnlyShortList
- java.lang.Object
-
- org.magicwerk.brownies.collections.primitive.IShortList
-
- org.magicwerk.brownies.collections.primitive.IShortList.IReadOnlyShortList
-
- All Implemented Interfaces:
java.io.Serializable,java.lang.Cloneable
- Direct Known Subclasses:
IShortList.IReadOnlyShortListFromArray,IShortList.IReadOnlyShortListFromCollection,IShortList.IReadOnlyShortListFromList,IShortList.IReadOnlyShortListFromMult
- Enclosing class:
- IShortList
protected abstract static class IShortList.IReadOnlyShortList extends IShortList
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.magicwerk.brownies.collections.primitive.IShortList
IShortList.IReadOnlyShortList, IShortList.IReadOnlyShortListFromArray, IShortList.IReadOnlyShortListFromCollection, IShortList.IReadOnlyShortListFromList, IShortList.IReadOnlyShortListFromMult
-
-
Constructor Summary
Constructors Modifier Constructor Description protectedIReadOnlyShortList()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description intbinarySearch(int index, int len, short key)Searches the specified range for an object using the binary search algorithm.intcapacity()Returns capacity of this list.protected booleandoAdd(int index, short elem)Helper method for adding an element to the list.protected voiddoAssign(IShortList that)Assign this list the content of the that list.protected voiddoClone(IShortList that)Initialize this object after the bitwise copy has been made by Object.clone().protected IShortListdoCreate(int capacity)Create list with specified capacity.protected voiddoEnsureCapacity(int minCapacity)Increases the capacity of this list instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.protected shortdoRemove(int index)Helper method to remove an element.protected shortdoReSet(int index, short elem)Sets an element at specified position.protected shortdoSet(int index, short elem)Helper method for setting an element in the list.private voiderror()Throw exception if an attempt is made to change an immutable list.protected shortgetDefaultElem()voidsort(int index, int len)Sort specified elements in the list using the specified comparator.voidtrimToSize()IShortListunmodifiableList()-
Methods inherited from class org.magicwerk.brownies.collections.primitive.IShortList
add, add, addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, binarySearch, checkIndex, checkIndexAdd, checkLength, checkLengths, checkNonNull, checkRange, clear, clone, contains, containsAll, containsAny, containsIf, copy, copy, count, countIf, crop, doAddAll, doClear, doCreateArray, doGet, doGetAll, doModify, doRemoveAll, doReplaceAll, doRotate, doTransfer, doTransferSwap, drag, element, ensureCapacity, equals, equalsElem, extract, extractIf, fill, filter, filterMap, get, getAll, getAll, getDistinct, getFirst, getFirstOrNull, getIf, getLast, getLastOrNull, getSingle, getSingleOrNull, hashCode, hashCodeElem, indexOf, indexOf, indexOfIf, initAll, initAll, initArray, initMult, isEmpty, lastIndexOf, lastIndexOf, map, mapFilter, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, remove, remove, removeAll, removeAll, removeAll, removeElem, removeFirst, removeFirstOccurrence, removeIf, removeLast, removeLastOccurrence, replaceAll, replaceAll, replaceArray, replaceMult, resize, retain, retainAll, retainAll, retainIf, reverse, reverse, rotate, rotate, set, setAll, setAll, setArray, setArray, setMult, size, sort, swap, toArray, toArray, toArray, toArray, toArray, toArray, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap, transform, transformedList
-
-
-
-
Method Detail
-
unmodifiableList
public IShortList unmodifiableList()
- Specified by:
unmodifiableListin classIShortList
-
doClone
protected void doClone(IShortList that)
Description copied from class:IShortListInitialize this object after the bitwise copy has been made by Object.clone().- Specified by:
doClonein classIShortList- Parameters:
that- source object
-
capacity
public int capacity()
Description copied from class:IShortListReturns capacity of this list. Note that two lists are considered equal even if they have a distinct capacity. Also the capacity can be changed by operations like clone() etc.- Specified by:
capacityin classIShortList- Returns:
- capacity of this list
-
doSet
protected short doSet(int index, short elem)Description copied from class:IShortListHelper method for setting an element in the list. This is the only method which really sets an element. Override if you need to validity checks before setting.- Specified by:
doSetin classIShortList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
doReSet
protected short doReSet(int index, short elem)Description copied from class:IShortListSets an element at specified position. This method is used internally if existing elements will be moved etc. Override if you need to validity checks.- Specified by:
doReSetin classIShortList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
getDefaultElem
protected short getDefaultElem()
- Specified by:
getDefaultElemin classIShortList
-
doAdd
protected boolean doAdd(int index, short elem)Description copied from class:IShortListHelper method for adding an element to the list. This is the only method which really adds an element. Override if you need to validity checks before adding.- Specified by:
doAddin classIShortList- Parameters:
index- index where element should be added (-1 means it is up to the implementation to choose the index)elem- element to add- Returns:
- true if element has been added, false otherwise
-
doRemove
protected short doRemove(int index)
Description copied from class:IShortListHelper method to remove an element. This is the only method which really removes an element. Override if you need to validity checks before removing.- Specified by:
doRemovein classIShortList- Parameters:
index- index of element to remove- Returns:
- removed element
-
doEnsureCapacity
protected void doEnsureCapacity(int minCapacity)
Description copied from class:IShortListIncreases the capacity of this list instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.- Specified by:
doEnsureCapacityin classIShortList- Parameters:
minCapacity- the desired minimum capacity
-
trimToSize
public void trimToSize()
- Specified by:
trimToSizein classIShortList
-
doCreate
protected IShortList doCreate(int capacity)
Description copied from class:IShortListCreate list with specified capacity.- Specified by:
doCreatein classIShortList- Parameters:
capacity- initial capacity (use -1 for default capacity)- Returns:
- created list
-
doAssign
protected void doAssign(IShortList that)
Description copied from class:IShortListAssign this list the content of the that list. This is done by bitwise copying so the that list should not be used afterwards.- Specified by:
doAssignin classIShortList- Parameters:
that- list to copy content from
-
sort
public void sort(int index, int len)Description copied from class:IShortListSort specified elements in the list using the specified comparator.- Specified by:
sortin classIShortList- Parameters:
index- index of first element to sortlen- number of elements to sort- See Also:
Arrays.sort(int[])
-
binarySearch
public int binarySearch(int index, int len, short key)Description copied from class:IShortListSearches the specified range for an object using the binary search algorithm.Note that the method is defined to work with an arbitrary type <K>. This allows to search directly for a key field in the object without the need to construct an object containing the key:
persons.binarySearch("john", new SearchByName()); class SearchByName implements Comparator<Object> { public int compare(Object o1, Object o2) { String s1 = (o1 instanceof String) ? (String) o1 : ((Name) o1).getName(); String s2 = (o2 instanceof String) ? (String) o2 : ((Name) o2).getName(); return s1.compareTo(s2); } }/- Specified by:
binarySearchin classIShortList- Parameters:
index- index of first element to searchlen- number of elements to searchkey- the value to be searched for- Returns:
- index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
- See Also:
Arrays.binarySearch(long[], long)
-
error
private void error()
Throw exception if an attempt is made to change an immutable list.
-
-