diff --git a/bytestring-trie-0.2.5.0.cabal b/bytestring-trie-0.2.5.0.cabal index 0c06bc0..f36829a 100644 --- a/bytestring-trie-0.2.5.0.cabal +++ b/bytestring-trie-0.2.5.0.cabal @@ -1,82 +1,82 @@ ------------------------------------------------------------- --- wren gayle romano ~ 2019.02.25 ------------------------------------------------------------- - --- By and large Cabal >=1.2 is fine; but --- * >=1.6 gives tested-with: and source-repository: --- * >=1.8 allows executables to build-depends: on the library --- * >=1.9.2 allows Test-Suite -Cabal-Version: >= 1.9.2 -Build-Type: Simple - -Name: bytestring-trie -Version: 0.2.5.0 -x-revision: 1 -Stability: provisional -Homepage: http://wrengr.org -Author: wren gayle romano -Maintainer: wren@cpan.org -Copyright: Copyright (c) 2008--2019 wren gayle romano -License: BSD3 -License-File: LICENSE - -Category: Data, Data Structures -Synopsis: An efficient finite map from (byte)strings to values. -Description: An efficient finite map from (byte)strings to values. - . - The implementation is based on big-endian patricia - trees, like "Data.IntMap". We first trie on the - elements of "Data.ByteString" and then trie on the - big-endian bit representation of those elements. - Patricia trees have efficient algorithms for union - and other merging operations, but they're also quick - for lookups and insertions. - . - If you are only interested in being able to associate - strings to values, then you may prefer the @hashmap@ - package which is faster for those only needing a - map-like structure. This package is intended for - those who need the extra capabilities that a trie-like - structure can offer (e.g., structure sharing to - reduce memory costs for highly redundant keys, - taking the submap of all keys with a given prefix, - contextual mapping, extracting the minimum and - maximum keys, etc.) - - -Extra-source-files: - AUTHORS, CHANGELOG, README.md - --- Cf., -Tested-With: - GHC ==7.4.1, GHC ==7.4.2, - GHC ==7.6.1, GHC ==7.6.2, GHC ==7.6.3, - GHC ==7.8.1, GHC ==7.8.2, GHC ==7.8.3, GHC ==7.8.4, - GHC ==7.10.1, GHC ==7.10.2, GHC ==7.10.3, - GHC ==8.0.1, GHC ==8.0.2, - GHC ==8.2.1, GHC ==8.2.2, - GHC ==8.4.1, GHC ==8.4.2, GHC ==8.4.3, - GHC ==8.6.1, GHC ==8.6.2 - -Source-Repository head - Type: git - Location: https://github.com/wrengr/bytestring-trie.git - ------------------------------------------------------------- -Library - Hs-Source-Dirs: src - Exposed-Modules: Data.Trie - , Data.Trie.Internal - , Data.Trie.Convenience - Other-Modules: Data.Trie.BitTwiddle - , Data.Trie.ByteStringInternal - , Data.Trie.Errors - -- The lower bounds are more restrictive than necessary. - -- But then, we don't maintain any CI tests for older - -- versions, so these are the lowest bounds we've verified. - Build-Depends: base >= 4.5 && < 4.14 - , bytestring >= 0.9.2 && < 0.11 - , binary >= 0.5.1 && < 0.8.8 - ------------------------------------------------------------- -------------------------------------------------------- fin. +------------------------------------------------------------ +-- wren gayle romano ~ 2019.02.25 +------------------------------------------------------------ + +-- By and large Cabal >=1.2 is fine; but +-- * >=1.6 gives tested-with: and source-repository: +-- * >=1.8 allows executables to build-depends: on the library +-- * >=1.9.2 allows Test-Suite +Cabal-Version: >= 1.9.2 +Build-Type: Simple + +Name: bytestring-trie +Version: 0.2.5.0 +x-revision: 2 +Stability: provisional +Homepage: http://wrengr.org +Author: wren gayle romano +Maintainer: wren@cpan.org +Copyright: Copyright (c) 2008--2019 wren gayle romano +License: BSD3 +License-File: LICENSE + +Category: Data, Data Structures +Synopsis: An efficient finite map from (byte)strings to values. +Description: An efficient finite map from (byte)strings to values. + . + The implementation is based on big-endian patricia + trees, like "Data.IntMap". We first trie on the + elements of "Data.ByteString" and then trie on the + big-endian bit representation of those elements. + Patricia trees have efficient algorithms for union + and other merging operations, but they're also quick + for lookups and insertions. + . + If you are only interested in being able to associate + strings to values, then you may prefer the @hashmap@ + package which is faster for those only needing a + map-like structure. This package is intended for + those who need the extra capabilities that a trie-like + structure can offer (e.g., structure sharing to + reduce memory costs for highly redundant keys, + taking the submap of all keys with a given prefix, + contextual mapping, extracting the minimum and + maximum keys, etc.) + + +Extra-source-files: + AUTHORS, CHANGELOG, README.md + +-- Cf., +Tested-With: + GHC ==7.4.1, GHC ==7.4.2, + GHC ==7.6.1, GHC ==7.6.2, GHC ==7.6.3, + GHC ==7.8.1, GHC ==7.8.2, GHC ==7.8.3, GHC ==7.8.4, + GHC ==7.10.1, GHC ==7.10.2, GHC ==7.10.3, + GHC ==8.0.1, GHC ==8.0.2, + GHC ==8.2.1, GHC ==8.2.2, + GHC ==8.4.1, GHC ==8.4.2, GHC ==8.4.3, + GHC ==8.6.1, GHC ==8.6.2 + +Source-Repository head + Type: git + Location: https://github.com/wrengr/bytestring-trie.git + +------------------------------------------------------------ +Library + Hs-Source-Dirs: src + Exposed-Modules: Data.Trie + , Data.Trie.Internal + , Data.Trie.Convenience + Other-Modules: Data.Trie.BitTwiddle + , Data.Trie.ByteStringInternal + , Data.Trie.Errors + -- The lower bounds are more restrictive than necessary. + -- But then, we don't maintain any CI tests for older + -- versions, so these are the lowest bounds we've verified. + Build-Depends: base >= 4.5 && < 4.16 + , bytestring >= 0.9.2 && < 0.11 + , binary >= 0.5.1 && < 0.8.8 + +------------------------------------------------------------ +------------------------------------------------------- fin. diff --git a/ghc-bytestring-trie.spec b/ghc-bytestring-trie.spec index 8ebc91a..50e8cd5 100644 --- a/ghc-bytestring-trie.spec +++ b/ghc-bytestring-trie.spec @@ -1,4 +1,4 @@ -# generated by cabal-rpm-2.0.6 +# generated by cabal-rpm-2.0.9 # https://docs.fedoraproject.org/en-US/packaging-guidelines/Haskell/ %global pkg_name bytestring-trie @@ -17,6 +17,7 @@ Source1: https://hackage.haskell.org/package/%{pkgver}/%{pkg_name}.cabal# # End cabal-rpm sources # Begin cabal-rpm deps: +BuildRequires: dos2unix BuildRequires: ghc-Cabal-devel BuildRequires: ghc-rpm-macros BuildRequires: ghc-base-prof @@ -60,6 +61,7 @@ files. %package doc Summary: Haskell %{pkg_name} library documentation BuildArch: noarch +Requires: ghc-filesystem %description doc This package provides the Haskell %{pkg_name} library documentation. @@ -80,7 +82,7 @@ This package provides the Haskell %{pkg_name} profiling library. %prep # Begin cabal-rpm setup: %setup -q -n %{pkgver} -cp -bp %{SOURCE1} %{pkg_name}.cabal +dos2unix -k -n %{SOURCE1} %{pkg_name}.cabal # End cabal-rpm setup