data-forest 0.1.0.9 → 0.1.0.10
raw patch · 4 files changed
+43/−35 lines, 4 filesdep ~basePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base
API changes (from Hackage documentation)
Files
- changelog.md +7/−0
- data-forest.cabal +31/−34
- license.txt +1/−1
- readme.md +4/−0
+ changelog.md view
@@ -0,0 +1,7 @@+## 0.1.0.10 (2022-12-29)++Metadata changes only++## 0.1.0.9 (2021-11-16)++Start of changelog
data-forest.cabal view
@@ -1,47 +1,44 @@-name: data-forest-version: 0.1.0.9+cabal-version: 3.0++name: data-forest+version: 0.1.0.10 category: Data Structures-synopsis: A simple multi-way tree data structure.+synopsis: A simple multi-way tree data structure description: In some contexts, forests (collections of zero- or more trees) are more important than trees.- The /data-forest/ library provides a @Tree@- type much like the one from the popular- /containers/ library, but it also provides a- @Forest@ type with its own @Functor@ and- @Foldable@ instances.+ or more trees) are more important than trees. The /data-forest/+ library provides a @Tree@ type much like the one from the popular+ /containers/ library, but it also provides a @Forest@ type with+ its own @Functor@ and @Foldable@ instances. -homepage: https://github.com/chris-martin/data-forest+homepage: https://github.com/typeclasses/data-forest -author: Chris Martin <ch.martin@gmail.com>-maintainer: Chris Martin <ch.martin@gmail.com>+author: Chris Martin+maintainer: Chris Martin, Julie Moronuki +copyright: 2017 Mission Valley Software LLC license: Apache-2.0 license-file: license.txt -build-type: Simple-cabal-version: >= 1.10--library- default-language: Haskell2010- hs-source-dirs: src- default-extensions: NoImplicitPrelude- ghc-options: -Wall+extra-doc-files: *.md - build-depends:- base >=4.9 && <4.17+common base+ default-language: Haskell2010+ default-extensions: NoImplicitPrelude+ ghc-options: -Wall+ build-depends:+ base ^>=4.14 || ^>=4.15 || ^>=4.16 || ^>=4.17 - exposed-modules:- Data.Forest+library+ import: base+ hs-source-dirs: src+ exposed-modules:+ Data.Forest test-suite test- default-language: Haskell2010- type: exitcode-stdio-1.0- main-is: Main.hs- hs-source-dirs: test- default-extensions: NoImplicitPrelude- ghc-options: -Wall-- build-depends:- base >=4.9 && <4.17- , data-forest+ import: base+ type: exitcode-stdio-1.0+ main-is: Main.hs+ hs-source-dirs: test+ build-depends:+ data-forest
license.txt view
@@ -1,4 +1,4 @@-Copyright 2017 Chris Martin+Copyright 2017 Mission Valley Software LLC Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License.
+ readme.md view
@@ -0,0 +1,4 @@+In some contexts, forests (collections of zero or more trees) are more important+than trees. The *data-forest* library provides a `Tree` type much like the one+from the popular *containers* library, but it also provides a `Forest` type with+its own `Functor` and `Foldable` instances.