bitwise-enum 1.0.1.1 → 1.0.1.2
raw patch · 5 files changed
+12/−106 lines, 5 filesdep ~aesondep ~basedep ~deepseqPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: aeson, base, deepseq
API changes (from Hackage documentation)
Files
- CHANGES.md +0/−3
- README.md +0/−36
- bitwise-enum.cabal +12/−2
- package.yaml +0/−64
- stack.yaml +0/−1
− CHANGES.md
@@ -1,3 +0,0 @@-## [1.0.1.0]--* Add `EnumSet.toRaw`.
− README.md
@@ -1,36 +0,0 @@-# bitwise-enum--Efficient sets over bounded enumerations, using bitwise operations based on [containers](https://hackage.haskell.org/package/containers-0.6.0.1/docs/src/Data.IntSet.Internal.html) and [EdisonCore](https://hackage.haskell.org/package/EdisonCore-1.3.2.1/docs/src/Data-Edison-Coll-EnumSet.html). All operations apart from folds are constant-time. In many cases, the compiler may use constant folding to optimize `EnumSet`s away entirely. For example, in the following code:--```hs-import Data.Enum.Set as E--data Foo = A | B | C | D | E | F | G | H deriving (Bounded, Enum, Eq, Ord)--instance E.AsEnumSet Foo--addFoos :: E.EnumSet Foo -> E.EnumSet Foo-addFoos = E.delete A . E.insert B--bar :: E.EnumSet Foo-bar = addFoos $ E.fromFoldable [A, C, E]--barHasA :: Bool-barHasA = E.member A bar-```--With -O or -O2 , `bar` will compile to `GHC.Types.W# 22##` and `barHasA` will compile to `GHC.Types.False`.--By default, `Word`s are used as the representation. Other representations may be chosen in the class instance:--```hs-{-# LANGUAGE TypeFamilies #-}--import Data.Enum.Set as E-import Data.Word (Word64)--data Foo = A | B | C | D | E | F | G | H deriving (Bounded, Enum, Eq, Ord, Show)--instance E.AsEnumSet Foo where- type EnumSetRep Foo = Word64-```
bitwise-enum.cabal view
@@ -5,7 +5,7 @@ -- see: https://github.com/sol/hpack name: bitwise-enum-version: 1.0.1.1+version: 1.0.1.2 synopsis: Bitwise operations on bounded enumerations description: Bitwise operations on bounded enumerations. .@@ -20,7 +20,17 @@ license: BSD3 license-file: LICENSE build-type: Simple+tested-with:+ GHC ==8.6.1+ || ==8.6.5+ || ==8.8.4+ || ==8.10.7+ || ==9.0.2+ || ==9.2.8+ || ==9.4.5+ || ==9.6.2 + source-repository head type: git location: https://github.com/jnbooth/bitwise-enum@@ -38,7 +48,7 @@ build-depends: aeson >=0.11 && <2.3 , array >=0.5.1 && <0.6- , base >=4.5 && <5+ , base >=4.12 && <5 , deepseq >=1.1 && <1.6 , mono-traversable >=1.0.12 && <1.1 , vector >=0.11 && <0.14
− package.yaml
@@ -1,64 +0,0 @@-name: bitwise-enum-version: 1.0.1.1-github: "jnbooth/bitwise-enum"-homepage: https://github.com/jnbooth/bitwise-enum-bug-reports: https://github.com/jnbooth/bitwise-enum/issues-author: "Joshua Booth <joshua.n.booth@gmail.com>"-maintainer: "Joshua Booth <joshua.n.booth@gmail.com>"-license: BSD3-license-file: LICENSE-category: Data, Data Structures, Foreign-synopsis: "Bitwise operations on bounded enumerations"-description: |- Bitwise operations on bounded enumerations.- .- ["Data.Enum.Set"] Constant-time sets using bit flags.- .- ["Data.Enum.Memo"] Constant-time lookup memoization for functions on enumerated types.--dependencies:- - aeson >=0.11 && <2.3- - array >=0.5.1 && <0.6- - base >=4.5 && <5- - deepseq >=1.1 && <1.6- - mono-traversable >=1.0.12 && <1.1- - vector >=0.11 && <0.14--ghc-options:- - -Wall- - -Wcompat- - -Widentities- - -Wincomplete-uni-patterns- - -Wincomplete-record-updates- - -ferror-spans- - -funbox-small-strict-fields--library:- source-dirs: ./- ghc-options: -O2--benchmarks:- enumset-benchmarks:- main: EnumSet.hs- source-dirs: benchmarks- dependencies:- - base- - bitwise-enum- - gauge >=0.2.5- - wide-word >=0.1.0.9- ghc-options:- - -rtsopts- - -threaded- - -with-rtsopts=-N- - -O2--tests:- enumset-test-suite:- main: set-properties.hs- source-dirs: tests- dependencies:- - base- - bitwise-enum- - QuickCheck >=2.13.2- - test-framework >=0.8.2.0- - test-framework-quickcheck2 >=0.3.0.5
− stack.yaml
@@ -1,1 +0,0 @@-resolver: lts-21.5