packages feed

focuslist 0.1.0.1 → 0.1.0.2

raw patch · 5 files changed

+24/−12 lines, 5 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.FocusList: lensFocusList :: forall a_af01 a_aknP. Lens (FocusList a_af01) (FocusList a_aknP) (Seq a_af01) (Seq a_aknP)
+ Data.FocusList: lensFocusList :: forall a_af3x a_akrU. Lens (FocusList a_af3x) (FocusList a_akrU) (Seq a_af3x) (Seq a_akrU)
- Data.FocusList: lensFocusListFocus :: forall a_af01. Lens' (FocusList a_af01) Focus
+ Data.FocusList: lensFocusListFocus :: forall a_af3x. Lens' (FocusList a_af3x) Focus

Files

CHANGELOG.md view
@@ -2,7 +2,16 @@  ## Unreleased changes +## v0.1.0.2++- Update to allow the latest version of genvalidity+  ([#8](https://github.com/cdepillabout/focuslist/pull/8)).+  Thanks [George Wilson](https://github.com/gwils)!++- Add some lower version bounds to dependencies.+ ## v0.1.0.1+ - Enables older GHC versions for Travis  ## v0.1.0.0
README.md view
@@ -11,6 +11,8 @@ supports quick insertion and indexing by its implementation with [`Seq`](http://hackage.haskell.org/package/containers-0.6.0.1/docs/Data-Sequence.html#t:Seq). +The fcuslist package is similar to [pointed-list](http://hackage.haskell.org/package/pointedlist-0.6.1) or [list-zipper](http://hackage.haskell.org/package/ListZipper). Focuslist however is optimised for fast indexing and insertion at any point, and can be empty. For operations where linked lists perform better the other packages are likely to be superior, though for other operations focuslist is likely to be faster.+ ## Example  Here is a short example of using `FocusList`.
focuslist.cabal view
@@ -1,5 +1,5 @@ name:                focuslist-version:             0.1.0.1+version:             0.1.0.2 synopsis:            Lists with a focused element description:         Please see <https://github.com/cdepillabout/focuslist#readme README.md>. homepage:            https://github.com/cdepillabout/focuslist@@ -31,9 +31,9 @@   exposed-modules:     Data.FocusList   build-depends:       base >= 4.9 && < 5                      , containers >= 0.5.8-                     , lens+                     , lens >= 4.16                      , mono-traversable-                     , QuickCheck+                     , QuickCheck >= 2.11.3   default-language:    Haskell2010   ghc-options:         -Wall -Wincomplete-uni-patterns -Wincomplete-record-updates @@ -57,14 +57,14 @@                      , Test.FocusList.Invariants   build-depends:       base                      , focuslist-                     , genvalidity-containers-                     , genvalidity-hspec-                     , hedgehog+                     , genvalidity-containers >= 0.5+                     , genvalidity-hspec >= 0.6+                     , hedgehog >= 0.6.1                      , lens                      , QuickCheck-                     , tasty-                     , tasty-hedgehog-                     , tasty-hspec+                     , tasty >= 1.1+                     , tasty-hedgehog >= 0.2+                     , tasty-hspec >= 1.1   default-language:    Haskell2010   ghc-options:         -Wall -Wincomplete-uni-patterns -Wincomplete-record-updates -threaded -rtsopts -with-rtsopts=-N @@ -100,4 +100,3 @@ source-repository head   type:     git   location: git@github.com:cdepillabout/focuslist.git-
test/Test/FocusList.hs view
@@ -22,11 +22,11 @@ instance Validity (FocusList a) where   validate fl = check (invariantFL fl) "the FocusList has been constructed correctly" -instance GenValid a => GenValid (FocusList a) where+instance (GenValid a, GenUnchecked a) => GenValid (FocusList a) where   genValid :: Gen (FocusList a)   genValid = genValidFL genValid -instance GenInvalid a => GenInvalid (FocusList a)+instance (GenInvalid a, GenUnchecked a) => GenInvalid (FocusList a)  focusListTestsIO :: IO TestTree focusListTestsIO = do
test/readme/README.lhs view
@@ -11,6 +11,8 @@ supports quick insertion and indexing by its implementation with [`Seq`](http://hackage.haskell.org/package/containers-0.6.0.1/docs/Data-Sequence.html#t:Seq). +The fcuslist package is similar to [pointed-list](http://hackage.haskell.org/package/pointedlist-0.6.1) or [list-zipper](http://hackage.haskell.org/package/ListZipper). Focuslist however is optimised for fast indexing and insertion at any point, and can be empty. For operations where linked lists perform better the other packages are likely to be superior, though for other operations focuslist is likely to be faster.+ ## Example  Here is a short example of using `FocusList`.