- optimalUnmodifiableSet
Gets the optimal implementation for unmodifiable set. If set is empty, uses
Collections.emptySet. I
- optimalUnmodifiableList
Gets the optimal implementation for unmodifiable list. If list is empty, uses
Collections.emptyList
- optimalUnmodifiableMap
Gets the optimal implementation for unmodifiable map. If map is empty, uses
Collections.emptyMap. I
- unmodifiableCopySet
Performs defensive shallow copy and returns unmodifiable set. The iteration
order of the original se
- emptyIterator
Gets the empty iterator.
- emptySortedSet
Java 1.8: use standard version
- optimalUnmodifiableSortedSet
Gets the optimal implementation for unmodifiable sorted set. If sorted set is
empty, uses emptySorte
- singletonSortedSet
- unmodifiableCopyMap
Performs defensive shallow copy and returns unmodifiable map. The iteration
order of the original se
- equals
Two collections are considered equal when they are the same size and have the
same elements in the s
- hashCode
Computes the hashCode of a collection in a manner consistent with AbstractList.
- optimalUnmodifiableSortedMap
Gets the optimal implementation for unmodifiable sorted map. If sorted map is
empty, uses emptySorte