yaya-hedgehog 0.3.0.3 → 0.3.0.4
raw patch · 2 files changed
+20/−20 lines, 2 filesdep ~hedgehog
Dependency ranges changed: hedgehog
Files
- docs/license-report.md +17/−17
- yaya-hedgehog.cabal +3/−3
docs/license-report.md view
@@ -9,9 +9,9 @@ | Name | Version | [SPDX](https://spdx.org/licenses/) License Id | Description | Also depended upon by | | --- | --- | --- | --- | --- | | **`base`** | [`4.20.0.0`](http://hackage.haskell.org/package/base-4.20.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/base-4.20.0.0/src/LICENSE) | Core data structures and operations | *(core library)* |-| `deriving-compat` | [`0.6.6`](http://hackage.haskell.org/package/deriving-compat-0.6.6) | [`BSD-3-Clause`](http://hackage.haskell.org/package/deriving-compat-0.6.6/src/LICENSE) | Backports of GHC deriving extensions | |-| `hedgehog` | [`1.4`](http://hackage.haskell.org/package/hedgehog-1.4) | [`BSD-3-Clause`](http://hackage.haskell.org/package/hedgehog-1.4/src/LICENSE) | Release with confidence. | |-| `yaya` | [`0.6.2.2`](http://hackage.haskell.org/package/yaya-0.6.2.2) | *MISSING* | *MISSING* | |+| `deriving-compat` | [`0.6.7`](http://hackage.haskell.org/package/deriving-compat-0.6.7) | [`BSD-3-Clause`](http://hackage.haskell.org/package/deriving-compat-0.6.7/src/LICENSE) | Backports of GHC deriving extensions | |+| `hedgehog` | [`1.5`](http://hackage.haskell.org/package/hedgehog-1.5) | [`BSD-3-Clause`](http://hackage.haskell.org/package/hedgehog-1.5/src/LICENSE) | Release with confidence. | |+| `yaya` | [`0.6.2.2`](http://hackage.haskell.org/package/yaya-0.6.2.2) | [`AGPL-3.0-or-later`](http://hackage.haskell.org/package/yaya-0.6.2.2/src/LICENSE) | Total recursion schemes. | | ## Indirect transitive dependencies @@ -19,21 +19,21 @@ | --- | --- | --- | --- | --- | | `OneTuple` | [`0.4.2`](http://hackage.haskell.org/package/OneTuple-0.4.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/OneTuple-0.4.2/src/LICENSE) | Singleton Tuple | `indexed-traversable-instances` | | `StateVar` | [`1.2.2`](http://hackage.haskell.org/package/StateVar-1.2.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/StateVar-1.2.2/src/LICENSE) | State variables | `contravariant`, `invariant` |-| `adjunctions` | [`4.4.2`](http://hackage.haskell.org/package/adjunctions-4.4.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/adjunctions-4.4.2/src/LICENSE) | Adjunctions and representable functors | `kan-extensions` |-| `ansi-terminal` | [`1.1.1`](http://hackage.haskell.org/package/ansi-terminal-1.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/ansi-terminal-1.1.1/src/LICENSE) | Simple ANSI terminal support | `concurrent-output`, `hedgehog` |+| `adjunctions` | [`4.4.3`](http://hackage.haskell.org/package/adjunctions-4.4.3) | [`BSD-2-Clause`](http://hackage.haskell.org/package/adjunctions-4.4.3/src/LICENSE) | Adjunctions and representable functors | `kan-extensions` |+| `ansi-terminal` | [`1.1.2`](http://hackage.haskell.org/package/ansi-terminal-1.1.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/ansi-terminal-1.1.2/src/LICENSE) | Simple ANSI terminal support | `concurrent-output`, `hedgehog` | | `ansi-terminal-types` | [`1.1`](http://hackage.haskell.org/package/ansi-terminal-types-1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/ansi-terminal-types-1.1/src/LICENSE) | Types and functions used to represent SGR aspects | `ansi-terminal` | | **`array`** | [`0.5.7.0`](http://hackage.haskell.org/package/array-0.5.7.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/array-0.5.7.0/src/LICENSE) | Mutable and immutable arrays | `adjunctions`, `binary`, `containers`, `deepseq`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `parallel`, `pretty-show`, `stm`, `text` | | `assoc` | [`1.1.1`](http://hackage.haskell.org/package/assoc-1.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/assoc-1.1.1/src/LICENSE) | swap and assoc: Symmetric and Semigroupy Bifunctors | `bifunctors`, `lens`, `strict`, `these` | | `async` | [`2.2.5`](http://hackage.haskell.org/package/async-2.2.5) | [`BSD-3-Clause`](http://hackage.haskell.org/package/async-2.2.5/src/LICENSE) | Run IO operations asynchronously and wait for their results | `concurrent-output`, `hedgehog`, `lifted-async` | | `barbies` | [`2.1.1.0`](http://hackage.haskell.org/package/barbies-2.1.1.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/barbies-2.1.1.0/src/LICENSE) | Classes for working with types that can change clothes. | `hedgehog` |-| `base-orphans` | [`0.9.2`](http://hackage.haskell.org/package/base-orphans-0.9.2) | [`MIT`](http://hackage.haskell.org/package/base-orphans-0.9.2/src/LICENSE) | Backwards-compatible orphan instances for base | `distributive`, `lens`, `profunctors`, `semigroupoids`, `transformers-base` |+| `base-orphans` | [`0.9.3`](http://hackage.haskell.org/package/base-orphans-0.9.3) | [`MIT`](http://hackage.haskell.org/package/base-orphans-0.9.3/src/LICENSE) | Backwards-compatible orphan instances for base | `distributive`, `lens`, `profunctors`, `semigroupoids`, `transformers-base` | | `bifunctors` | [`5.6.2`](http://hackage.haskell.org/package/bifunctors-5.6.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/bifunctors-5.6.2/src/LICENSE) | Bifunctors | `either`, `invariant`, `lens`, `profunctors`, `semigroupoids` | | **`binary`** | [`0.8.9.2`](http://hackage.haskell.org/package/binary-0.8.9.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/binary-0.8.9.2/src/LICENSE) | Binary serialisation for Haskell values using lazy ByteStrings | `constraints`, `strict`, `text`, `these` | | `boring` | [`0.2.2`](http://hackage.haskell.org/package/boring-0.2.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/boring-0.2.2/src/LICENSE) | Boring and Absurd types | `constraints` | | **`bytestring`** | [`0.12.1.0`](http://hackage.haskell.org/package/bytestring-0.12.1.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/bytestring-0.12.1.0/src/LICENSE) | Fast, compact, strict and lazy byte strings with a list interface | `binary`, `filepath`, `hashable`, `hedgehog`, `lens`, `os-string`, `random`, `strict`, `text`, `unix` | | `call-stack` | [`0.4.0`](http://hackage.haskell.org/package/call-stack-0.4.0) | [`MIT`](http://hackage.haskell.org/package/call-stack-0.4.0/src/LICENSE) | Use GHC call-stacks in a backward compatible way | `lens` | | `colour` | [`2.3.6`](http://hackage.haskell.org/package/colour-2.3.6) | [`MIT`](http://hackage.haskell.org/package/colour-2.3.6/src/LICENSE) | A model for human colour/color perception | `ansi-terminal`, `ansi-terminal-types` |-| `comonad` | [`5.0.8`](http://hackage.haskell.org/package/comonad-5.0.8) | [`BSD-3-Clause`](http://hackage.haskell.org/package/comonad-5.0.8/src/LICENSE) | Comonads | `adjunctions`, `bifunctors`, `free`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`, `yaya` |+| `comonad` | [`5.0.9`](http://hackage.haskell.org/package/comonad-5.0.9) | [`BSD-3-Clause`](http://hackage.haskell.org/package/comonad-5.0.9/src/LICENSE) | Comonads | `adjunctions`, `bifunctors`, `free`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`, `yaya` | | `concurrent-output` | [`1.10.21`](http://hackage.haskell.org/package/concurrent-output-1.10.21) | [`BSD-2-Clause`](http://hackage.haskell.org/package/concurrent-output-1.10.21/src/LICENSE) | Ungarble output from several threads or commands | `hedgehog` | | `constraints` | [`0.14.2`](http://hackage.haskell.org/package/constraints-0.14.2) | [`BSD-2-Clause`](http://hackage.haskell.org/package/constraints-0.14.2/src/LICENSE) | Constraint manipulation | `lifted-async` | | **`containers`** | [`0.7`](http://hackage.haskell.org/package/containers-0.7) | [`BSD-3-Clause`](http://hackage.haskell.org/package/containers-0.7/src/LICENSE) | Assorted concrete container types | `adjunctions`, `bifunctors`, `binary`, `comonad`, `deriving-compat`, `free`, `hashable`, `hedgehog`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `parallel`, `resourcet`, `semigroupoids`, `th-abstraction`, `wl-pprint-annotated` |@@ -51,13 +51,13 @@ | **`ghc-internal`** | [`9.1001.0`](http://hackage.haskell.org/package/ghc-internal-9.1001.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/ghc-internal-9.1001.0/src/LICENSE) | Basic libraries | `base` | | **`ghc-prim`** | [`0.11.0`](http://hackage.haskell.org/package/ghc-prim-0.11.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/ghc-prim-0.11.0/src/LICENSE) | GHC primitives | *(core library)* | | `hashable` | [`1.5.0.0`](http://hackage.haskell.org/package/hashable-1.5.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/hashable-1.5.0.0/src/LICENSE) | A class for types that can be converted to a hash value | `async`, `constraints`, `lens`, `semigroupoids`, `strict`, `these`, `unordered-containers` |-| `haskell-lexer` | [`1.1.1`](http://hackage.haskell.org/package/haskell-lexer-1.1.1) | [`MIT`](http://hackage.haskell.org/package/haskell-lexer-1.1.1/src/LICENSE) | A fully compliant Haskell 98 lexer | `pretty-show` |+| `haskell-lexer` | [`1.2.1`](http://hackage.haskell.org/package/haskell-lexer-1.2.1) | [`MIT`](http://hackage.haskell.org/package/haskell-lexer-1.2.1/src/LICENSE) | A fully compliant Haskell 98 lexer | `pretty-show` | | `indexed-traversable` | [`0.1.4`](http://hackage.haskell.org/package/indexed-traversable-0.1.4) | [`BSD-2-Clause`](http://hackage.haskell.org/package/indexed-traversable-0.1.4/src/LICENSE) | FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | `comonad`, `free`, `indexed-traversable-instances`, `lens` | | `indexed-traversable-instances` | [`0.1.2`](http://hackage.haskell.org/package/indexed-traversable-instances-0.1.2) | [`BSD-2-Clause`](http://hackage.haskell.org/package/indexed-traversable-instances-0.1.2/src/LICENSE) | More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | `lens` |-| `invariant` | [`0.6.3`](http://hackage.haskell.org/package/invariant-0.6.3) | [`BSD-2-Clause`](http://hackage.haskell.org/package/invariant-0.6.3/src/LICENSE) | Haskell98 invariant functors | `kan-extensions` |+| `invariant` | [`0.6.4`](http://hackage.haskell.org/package/invariant-0.6.4) | [`BSD-2-Clause`](http://hackage.haskell.org/package/invariant-0.6.4/src/LICENSE) | Haskell98 invariant functors | `kan-extensions` | | `kan-extensions` | [`5.2.6`](http://hackage.haskell.org/package/kan-extensions-5.2.6) | [`BSD-3-Clause`](http://hackage.haskell.org/package/kan-extensions-5.2.6/src/LICENSE) | Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads | `lens`, `yaya` |-| `lens` | [`5.3.2`](http://hackage.haskell.org/package/lens-5.3.2) | [`BSD-2-Clause`](http://hackage.haskell.org/package/lens-5.3.2/src/LICENSE) | Lenses, Folds and Traversals | `yaya` |-| `lifted-async` | [`0.10.2.6`](http://hackage.haskell.org/package/lifted-async-0.10.2.6) | [`BSD-3-Clause`](http://hackage.haskell.org/package/lifted-async-0.10.2.6/src/LICENSE) | Run lifted IO operations asynchronously and wait for their results | `hedgehog` |+| `lens` | [`5.3.4`](http://hackage.haskell.org/package/lens-5.3.4) | [`BSD-2-Clause`](http://hackage.haskell.org/package/lens-5.3.4/src/LICENSE) | Lenses, Folds and Traversals | `yaya` |+| `lifted-async` | [`0.10.2.7`](http://hackage.haskell.org/package/lifted-async-0.10.2.7) | [`BSD-3-Clause`](http://hackage.haskell.org/package/lifted-async-0.10.2.7/src/LICENSE) | Run lifted IO operations asynchronously and wait for their results | `hedgehog` | | `lifted-base` | [`0.2.3.12`](http://hackage.haskell.org/package/lifted-base-0.2.3.12) | [`BSD-3-Clause`](http://hackage.haskell.org/package/lifted-base-0.2.3.12/src/LICENSE) | lifted IO operations from the base library | `lifted-async` | | `mmorph` | [`1.2.0`](http://hackage.haskell.org/package/mmorph-1.2.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/mmorph-1.2.0/src/LICENSE) | Monad morphisms | `hedgehog` | | `monad-control` | [`1.0.3.1`](http://hackage.haskell.org/package/monad-control-1.0.3.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/monad-control-1.0.3.1/src/LICENSE) | Lift control operations, like exception catching, through monad transformers | `hedgehog`, `lifted-async`, `lifted-base` |@@ -69,20 +69,20 @@ | `primitive` | [`0.9.0.0`](http://hackage.haskell.org/package/primitive-0.9.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/primitive-0.9.0.0/src/LICENSE) | Primitive memory-related operations | `hedgehog`, `resourcet`, `vector` | | **`process`** | [`1.6.19.0`](http://hackage.haskell.org/package/process-1.6.19.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/process-1.6.19.0/src/LICENSE) | Process libraries | `concurrent-output` | | `profunctors` | [`5.6.2`](http://hackage.haskell.org/package/profunctors-5.6.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/profunctors-5.6.2/src/LICENSE) | Profunctors | `adjunctions`, `either`, `free`, `invariant`, `kan-extensions`, `lens`, `yaya` |-| `random` | [`1.2.1.2`](http://hackage.haskell.org/package/random-1.2.1.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/random-1.2.1.2/src/LICENSE) | Pseudo-random number generation | `hedgehog` |-| `reflection` | [`2.1.8`](http://hackage.haskell.org/package/reflection-2.1.8) | [`BSD-3-Clause`](http://hackage.haskell.org/package/reflection-2.1.8/src/LICENSE) | Reifies arbitrary terms into types that can be reflected back into terms | `lens` |+| `random` | [`1.2.1.3`](http://hackage.haskell.org/package/random-1.2.1.3) | [`BSD-3-Clause`](http://hackage.haskell.org/package/random-1.2.1.3/src/LICENSE) | Pseudo-random number generation | `hedgehog` |+| `reflection` | [`2.1.9`](http://hackage.haskell.org/package/reflection-2.1.9) | [`BSD-3-Clause`](http://hackage.haskell.org/package/reflection-2.1.9/src/LICENSE) | Reifies arbitrary terms into types that can be reflected back into terms | `lens` | | `resourcet` | [`1.3.0`](http://hackage.haskell.org/package/resourcet-1.3.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/resourcet-1.3.0/src/LICENSE) | Deterministic allocation and freeing of scarce resources. | `hedgehog` | | `safe-exceptions` | [`0.1.7.4`](http://hackage.haskell.org/package/safe-exceptions-0.1.7.4) | [`MIT`](http://hackage.haskell.org/package/safe-exceptions-0.1.7.4/src/LICENSE) | Safe, consistent, and easy exception handling | `hedgehog` | | `semigroupoids` | [`6.0.1`](http://hackage.haskell.org/package/semigroupoids-6.0.1) | [`BSD-2-Clause`](http://hackage.haskell.org/package/semigroupoids-6.0.1/src/LICENSE) | Semigroupoids: Category sans id | `adjunctions`, `either`, `free`, `kan-extensions`, `lens` | | `semigroups` | [`0.20`](http://hackage.haskell.org/package/semigroups-0.20) | [`BSD-3-Clause`](http://hackage.haskell.org/package/semigroups-0.20/src/LICENSE) | Anything that associates | `adjunctions` |-| `splitmix` | [`0.1.0.5`](http://hackage.haskell.org/package/splitmix-0.1.0.5) | [`BSD-3-Clause`](http://hackage.haskell.org/package/splitmix-0.1.0.5/src/LICENSE) | Fast Splittable PRNG | `random` |+| `splitmix` | [`0.1.1`](http://hackage.haskell.org/package/splitmix-0.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/splitmix-0.1.1/src/LICENSE) | Fast Splittable PRNG | `random` | | **`stm`** | [`2.5.3.1`](http://hackage.haskell.org/package/stm-2.5.3.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/stm-2.5.3.1/src/LICENSE) | Software Transactional Memory | `StateVar`, `async`, `concurrent-output`, `exceptions`, `hedgehog`, `invariant`, `monad-control`, `transformers-base` | | `strict` | [`0.5.1`](http://hackage.haskell.org/package/strict-0.5.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/strict-0.5.1/src/LICENSE) | Strict data types and String IO. | `lens`, `yaya` |-| `tagged` | [`0.8.8`](http://hackage.haskell.org/package/tagged-0.8.8) | [`BSD-3-Clause`](http://hackage.haskell.org/package/tagged-0.8.8/src/LICENSE) | Haskell 98 phantom types to avoid unsafely passing dummy arguments | `adjunctions`, `bifunctors`, `boring`, `comonad`, `distributive`, `indexed-traversable-instances`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids` |+| `tagged` | [`0.8.9`](http://hackage.haskell.org/package/tagged-0.8.9) | [`BSD-3-Clause`](http://hackage.haskell.org/package/tagged-0.8.9/src/LICENSE) | Haskell 98 phantom types to avoid unsafely passing dummy arguments | `adjunctions`, `bifunctors`, `boring`, `comonad`, `distributive`, `indexed-traversable-instances`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids` | | **`template-haskell`** | [`2.22.0.0`](http://hackage.haskell.org/package/template-haskell-2.22.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/template-haskell-2.22.0.0/src/LICENSE) | Support library for Template Haskell | `OneTuple`, `bifunctors`, `bytestring`, `containers`, `deriving-compat`, `exceptions`, `filepath`, `free`, `hedgehog`, `invariant`, `lens`, `os-string`, `primitive`, `reflection`, `semigroupoids`, `tagged`, `text`, `th-abstraction`, `unordered-containers`, `yaya` | | `terminal-size` | [`0.3.4`](http://hackage.haskell.org/package/terminal-size-0.3.4) | [`BSD-3-Clause`](http://hackage.haskell.org/package/terminal-size-0.3.4/src/LICENSE) | Get terminal window height and width | `concurrent-output` | | **`text`** | [`2.1.1`](http://hackage.haskell.org/package/text-2.1.1) | [`BSD-2-Clause`](http://hackage.haskell.org/package/text-2.1.1/src/LICENSE) | An efficient packed Unicode text type. | `concurrent-output`, `hashable`, `hedgehog`, `lens`, `pretty-show`, `strict`, `wl-pprint-annotated` |-| `th-abstraction` | [`0.7.0.0`](http://hackage.haskell.org/package/th-abstraction-0.7.0.0) | [`ISC`](http://hackage.haskell.org/package/th-abstraction-0.7.0.0/src/LICENSE) | Nicer interface for reified information about data types | `bifunctors`, `deriving-compat`, `free`, `invariant`, `lens`, `yaya` |+| `th-abstraction` | [`0.7.1.0`](http://hackage.haskell.org/package/th-abstraction-0.7.1.0) | [`ISC`](http://hackage.haskell.org/package/th-abstraction-0.7.1.0/src/LICENSE) | Nicer interface for reified information about data types | `bifunctors`, `deriving-compat`, `free`, `invariant`, `lens`, `yaya` | | `these` | [`1.2.1`](http://hackage.haskell.org/package/these-1.2.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/these-1.2.1/src/LICENSE) | An either-or-both data type. | `lens`, `strict` | | **`time`** | [`1.12.2`](http://hackage.haskell.org/package/time-1.12.2) | [`BSD-2-Clause`](http://hackage.haskell.org/package/time-1.12.2/src/LICENSE) | A time library | `directory`, `hedgehog`, `unix` | | **`transformers`** | [`0.6.1.1`](http://hackage.haskell.org/package/transformers-0.6.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/transformers-0.6.1.1/src/LICENSE) | Concrete functor and monad transformers | `StateVar`, `adjunctions`, `barbies`, `bifunctors`, `boring`, `comonad`, `concurrent-output`, `constraints`, `contravariant`, `deriving-compat`, `distributive`, `exceptions`, `free`, `hedgehog`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `mmorph`, `monad-control`, `mtl`, `primitive`, `profunctors`, `resourcet`, `safe-exceptions`, `semigroupoids`, `strict`, `tagged`, `transformers-base`, `transformers-compat`, `unliftio-core`, `yaya` |@@ -91,7 +91,7 @@ | **`unix`** | [`2.8.5.1`](http://hackage.haskell.org/package/unix-2.8.5.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/unix-2.8.5.1/src/LICENSE) | POSIX functionality | `concurrent-output`, `directory`, `process` | | `unliftio-core` | [`0.2.1.0`](http://hackage.haskell.org/package/unliftio-core-0.2.1.0) | [`MIT`](http://hackage.haskell.org/package/unliftio-core-0.2.1.0/src/LICENSE) | The MonadUnliftIO typeclass for unlifting monads to IO | `resourcet` | | `unordered-containers` | [`0.2.20`](http://hackage.haskell.org/package/unordered-containers-0.2.20) | [`BSD-3-Clause`](http://hackage.haskell.org/package/unordered-containers-0.2.20/src/LICENSE) | Efficient hashing-based container types | `indexed-traversable-instances`, `invariant`, `lens`, `semigroupoids` |-| `vector` | [`0.13.1.0`](http://hackage.haskell.org/package/vector-0.13.1.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/vector-0.13.1.0/src/LICENSE) | Efficient Arrays | `indexed-traversable-instances`, `lens` |+| `vector` | [`0.13.2.0`](http://hackage.haskell.org/package/vector-0.13.2.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/vector-0.13.2.0/src/LICENSE) | Efficient Arrays | `indexed-traversable-instances`, `lens` | | `vector-stream` | [`0.1.0.1`](http://hackage.haskell.org/package/vector-stream-0.1.0.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/vector-stream-0.1.0.1/src/LICENSE) | Efficient Streams | `vector` | | `void` | [`0.7.3`](http://hackage.haskell.org/package/void-0.7.3) | [`BSD-3-Clause`](http://hackage.haskell.org/package/void-0.7.3/src/LICENSE) | A Haskell 98 logically uninhabited data type | `adjunctions` | | `wl-pprint-annotated` | [`0.1.0.1`](http://hackage.haskell.org/package/wl-pprint-annotated-0.1.0.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/wl-pprint-annotated-0.1.0.1/src/LICENSE) | Pretty printer with annotation support | `hedgehog` |
yaya-hedgehog.cabal view
@@ -1,7 +1,7 @@ cabal-version: 3.0 name: yaya-hedgehog-version: 0.3.0.3+version: 0.3.0.4 synopsis: Hedgehog testing support for the Yaya recursion scheme library. description: If you use Yaya in your own code and have tests written using Hedgehog, then this library will help you with@@ -167,7 +167,7 @@ src build-depends: deriving-compat ^>= {0.5.9, 0.6},- hedgehog ^>= {1.0, 1.1, 1.2, 1.4},+ hedgehog ^>= {1.0, 1.1, 1.2, 1.4, 1.5}, yaya ^>= {0.5.1, 0.6.0}, exposed-modules: Yaya.Hedgehog@@ -219,7 +219,7 @@ Test.Retrofit build-depends: deriving-compat ^>= {0.5.9, 0.6},- hedgehog ^>= {1.0, 1.1, 1.2, 1.4},+ hedgehog ^>= {1.0, 1.1, 1.2, 1.4, 1.5}, yaya ^>= {0.5.1, 0.6.0}, yaya-hedgehog, ghc-options: