convention for class names in Integers: [Abstract][Writable](Int/Long)*[Modificators][Type]
Almost all changes must throw compilation error in old code except methods from (Int/Long)Progression class, where was changed arguments order in methods.
| old name | new name | changes |
|---|---|---|
| AbstractLongListDecorator | AbstractLongListDecorator | |
| DiffIndexedLongListDecorator | LongListDiffIndexedDecorator | |
| DynamicLongSet | LongTreeSet | |
| EmptyLongIterator | LongEmptyIterator | |
| FindingLongIterator | LongFindingIterator | one method( findNext() ) instead of two; if findNext() returns false, will not be called again |
| IndexedLongIterator | LongIndexedIterator | |
| IndexedLongListIterator | LongListIndexedIterator | |
| IntLongMap | IntLongListMap | |
| ListLongMap | LongListMap | |
| LongArray | LongArray | |
| LongArrayIterator | LongArrayNativeIterator | |
| LongCollections | - | changed order of arguments in indexOf: (value, array, from, to) |
| LongCollector | method addAll(LongIterator) replaced with addAll(LongIterable) | |
| LongCollectorAdapter | AbstractLongCollector | |
| LongFunction | LongToLong | |
| LongFunction2 | LongLongToLong | |
| LongFunctions | LongFunctions | |
| LongIterator | - | added hasValue() method |
| LongList | - | isUniqueSorted() -> isSortedUnique() |
| LongListConcatenation | LongListConcatenation | |
| LongListInsertingDecorator | LongListInsertingDecorator | |
| LongListRemovingDecorator | AbstractLongListRemovingDecorator | |
| LongProgression | - | fillArray -> nativeArray, order of args: (initial, count, step) everywhere |
| ModifyingLongListRemovingDecorator | WritableLongListRemovingDecorator | |
| PairIntLongIterator | IntLongPairIterator | |
| ParallelLongList | LongParallelList | |
| ReadonlyLongListRemovingDecorator | LongListRemovingDecorator | |
| SameValuesLongList | LongSameValuesList | updated getChangeCount() method: old version doesn't count first element if it was zero and simply returns size of internal map: (0, 1, 2) -> 2; (1, 2, 3) -> 3; () -> 0; (1) -> 1; (0) -> 0 new version returns count of changes between adjacent indices in this list: () -> 0; (x) -> 0; (0, 1) -> 1; (1, 2) -> 1 |
| SegmentedLongArray | LongSegmentedArray | |
| SortedLongListIntersectionIterator | LongIntersectionIterator | |
| SortedLongListMinusIterator | LongMinusIterator | |
| TwoWayLongMap | LongTwoWayMap |