ral 0.2 → 0.2.1

raw patch · 4 files changed

+24/−8 lines, 4 filesdep +boringdep ~basedep ~bindep ~deepseq

Dependencies added: boring

Dependency ranges changed: base, bin, deepseq, fin, hashable, semigroupoids, semigroups

Files

• ChangeLog.md +4/−0
• ral.cabal +10/−8
• src/Data/RAList/NonEmpty/Internal.hs +5/−0
• src/Data/RAVec.hs +5/−0

@@ -1,5 +1,9 @@ # Version history for ral +## 0.2.1++- Add `boring` instances+ ## 0.2  - `fin-0.2` support

@@ -1,10 +1,10 @@ cabal-version:      2.2 name:               ral-version:            0.2+version:            0.2.1 synopsis:           Random access lists category:           Data, Dependent Types, Singletons description:-  This package provides ordinary random access list, 'RAList', and also +  This package provides ordinary random access list, 'RAList', and also   a length indexed variant, 'RAVec'.   .   The data structure allows fast cons-operation (like ordinary list) but also fast random access (like non-functional arrays).@@ -13,7 +13,7 @@   .   === Similar packages   .-  This packages don't provide length-indexed variant, and their 'RAList' has+  These packages don't provide length-indexed variants, and their 'RAList' has   opaque structure.   .   * https://hackage.haskell.org/package/ralist@@ -38,6 +38,7 @@    || ==8.8.4    || ==8.10.4    || ==9.0.1+   || ==9.2.1  source-repository head   type:     git@@ -84,20 +85,21 @@    -- GHC boot libs   build-depends:-    , base     >=4.7     && <4.16+    , base     >=4.7     && <4.17     , deepseq  >=1.3.0.1 && <1.5    if !impl(ghc >=8.0)-    build-depends: semigroups >=0.18.5 && <0.20+    build-depends: semigroups >=0.18.5 && <0.21    -- siblings   build-depends:-    , bin  ^>=0.1-    , fin  ^>=0.2+    , bin  ^>=0.1.1+    , fin  ^>=0.2.1    -- other dependencies   build-depends:-    , hashable             >=1.2.7.0 && <1.4+    , boring               ^>=0.2+    , hashable             >=1.2.7.0 && <1.5     , indexed-traversable  ^>=0.1.1     , QuickCheck           ^>=2.14.2 

@@ -52,6 +52,7 @@ import Control.Applicative (Applicative (..), (<$>)) import Control.DeepSeq     (NFData (..)) import Control.Exception   (ArrayException (IndexOutOfBounds), throw)+import Data.Boring         (Absurd (..)) import Data.Hashable       (Hashable (..)) import Data.List.NonEmpty  (NonEmpty (..)) import Data.Maybe          (fromMaybe)@@ -184,6 +185,10 @@ -- | @since 0.2 instance WI.TraversableWithIndex Int NERAList where     itraverse = itraverse++-- | @since 0.2.1+instance Absurd a => Absurd (NERAList a) where+    absurd = absurd . head  ------------------------------------------------------------------------------- -- Showing

@@ -80,6 +80,7 @@ import Control.DeepSeq     (NFData (..)) import Data.Bin            (Bin (..)) import Data.Bin.Pos        (Pos (..))+import Data.Boring         (Boring (..)) import Data.Hashable       (Hashable (..)) import Data.List.NonEmpty  (NonEmpty (..)) import Data.Monoid         (Monoid (..))@@ -230,6 +231,10 @@ #endif  -- TODO: I.Bind?++-- | @since 0.2.1+instance b ~ 'BZ => Boring (RAVec b a) where+    boring = empty  ------------------------------------------------------------------------------- -- Construction