haskell-generic-trie 0.3.1-4 source package in Ubuntu
Changelog
haskell-generic-trie (0.3.1-4) unstable; urgency=medium * Patch for newer deps -- Gianfranco Costamagna <email address hidden> Sat, 03 Aug 2019 12:14:03 +0200
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-generic-trie_0.3.1-4.dsc | 2.3 KiB | 6da9c3bc878ed898c5358b17b1f8637cc4e437d10a5362bc12654d80c8183f24 |
| haskell-generic-trie_0.3.1.orig.tar.gz | 9.5 KiB | d0aac1fe751dbdae7c801ed69ddeb3bf2657851f84a214ce386f8476ee2aeef4 |
| haskell-generic-trie_0.3.1-4.debian.tar.xz | 2.9 KiB | 64e47a575fb1508204f9a1dc34d139f600b5887c76693ebe92782e154f8b7ed5 |
Available diffs
- diff from 0.3.1-3 to 0.3.1-4 (597 bytes)
- diff from 0.3.1-3build2 (in Ubuntu) to 0.3.1-4 (367 bytes)
No changes file available.
Binary packages built by this source
- libghc-generic-trie-dev: No summary available for libghc-generic-trie-dev in ubuntu groovy.
No description available for libghc-
generic- trie-dev in ubuntu groovy.
- libghc-generic-trie-doc: a map, where the keys may be complex structured data; documentation
This type implements maps where the keys are themselves complex structured
data. For example, the keys may be the abstract syntax trees for a
programming language. The map is implemented as a trie, so common parts of
the keys will be shared in the representation. The library provides a generic
implementation of the data structure, so values of types that have support for
'Generic' may be automatically used as keys in the map.
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-generic-trie-prof: a map, where the keys may be complex structured data; profiling libraries
This type implements maps where the keys are themselves complex structured
data. For example, the keys may be the abstract syntax trees for a
programming language. The map is implemented as a trie, so common parts of
the keys will be shared in the representation. The library provides a generic
implementation of the data structure, so values of types that have support for
'Generic' may be automatically used as keys in the map.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell. org/ for more information on Haskell.
