- fixed issue where
DirectedGraph.edges()
returned edges pointing in the wrong direction - fixed issue in
List
where series of operations includingslice()
could lead to a degenerate structure which made lookups impossible. If you haven't seen mysteriousIndexOutOfBoundsException
s, this didn't affect you. - fixed surprising implementation detail where
List
couldn't hold more thanInteger.MAX_VALUE
elements - fixed issue where
list.toList().equals(...)
would always return true no matter the input - fixed issue where
IntMap.slice(min, max)
would omit any negative entries ifmin
was negative andmax
was non-negative - fixed issue where
LinearSet.union
would update the collection in-place if given a set which was not also aLinearSet
- moved
Lists.EMPTY
,Sets.EMPTY
, andMaps.EMPTY
toList.EMPTY
,Set.EMPTY
, andMap.EMPTY
respectively - moved
Lists.VirtualList
,Sets.VirtualSet
, andMaps.VirtualMap
todiffs.DiffList
,diffs.DiffSet
, anddiffs.DiffMap
respectively - moved
Lists.Concat
todiffs.ConcatList
- subsumed
Lists.Slice
intodiffs.DiffList
- made all hash functions (
IMap.keyHash
,ISet.valueHash
,IGraph.vertexHash
) yieldlong
s instead ofint
s. - changed
indexOf
methods to returnOptionalInt
instead of anint
which is-1
if no such element is found