range-set-list 0.1.2.1 → 0.1.3

raw patch · 3 files changed

+11/−5 lines, 3 filesdep ~basedep ~containersPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: base, containers

API changes (from Hackage documentation)

Files

• CHANGELOG.md +4/−0
• range-set-list.cabal +5/−3
• src/Data/RangeSet/Map.hs +2/−2

@@ -1,3 +1,7 @@+### 0.1.3++- Data.RangeSet.Map.member doesn't require Enum+ ### 0.1.2.0  - Map implementations: `Data.RangeSet.IntMap` and `Data.RangeSet.Map`

@@ -1,17 +1,19 @@+cabal-version:       >= 1.10 name:                range-set-list-version:             0.1.2.1+version:             0.1.3+ synopsis:            Memory efficient sets with ranges of elements.+category:            Data description:         Memory efficient sets with continuous ranges of discrete, bounded elements. List- and map-based implementations. Interface mimics 'Data.Set' where possible.+ homepage:            https://github.com/phadej/range-set-list#readme bug-reports:         https://github.com/phadej/range-set-list/issues license:             MIT license-file:        LICENSE author:              Oleg Grenrus <oleg.grenrus@iki.fi> maintainer:          Oleg Grenrus <oleg.grenrus@iki.fi>-category:            Data tested-with:         GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.2, GHC==8.4.2 build-type:          Simple-cabal-version:       >= 1.10  extra-source-files:   CHANGELOG.md

@@ -145,11 +145,11 @@ contains' x y (RSet xm) = Fold.any ((y <=) . snd) $ Map.lookupLE x xm  -- | /O(log n)/. Is the element in the set?-member :: (Ord a, Enum a) => a -> RSet a -> Bool+member :: Ord a => a -> RSet a -> Bool member x = contains' x x  -- | /O(log n)/. Is the element not in the set?-notMember :: (Ord a, Enum a) => a -> RSet a -> Bool+notMember :: Ord a => a -> RSet a -> Bool notMember a r = not $ member a r  -- | /O(log n)/. Find largest element smaller than the given one.