From 7a49116466da1ff5297de640c0bd79fb08016126 Mon Sep 17 00:00:00 2001 From: Ben Boeckel Date: Sat, 23 Apr 2016 14:03:58 -0400 Subject: [PATCH] update to 0.2.4.1 --- .gitignore | 1 + ghc-bytestring-trie.spec | 30 +++++++++++++++++++++--------- sources | 2 +- 3 files changed, 23 insertions(+), 10 deletions(-) diff --git a/.gitignore b/.gitignore index 0e70a49..2d2e315 100644 --- a/.gitignore +++ b/.gitignore @@ -1,3 +1,4 @@ /bytestring-trie-0.2.2.tar.gz /bytestring-trie-0.2.3.tar.gz /bytestring-trie-0.2.4.tar.gz +/bytestring-trie-0.2.4.1.tar.gz diff --git a/ghc-bytestring-trie.spec b/ghc-bytestring-trie.spec index 7a7fca9..37fb256 100644 --- a/ghc-bytestring-trie.spec +++ b/ghc-bytestring-trie.spec @@ -3,8 +3,8 @@ %global pkg_name bytestring-trie Name: ghc-%{pkg_name} -Version: 0.2.4 -Release: 3%{?dist} +Version: 0.2.4.1 +Release: 1%{?dist} Summary: An efficient finite map from (byte)strings to values License: BSD @@ -21,12 +21,19 @@ BuildRequires: ghc-bytestring-devel %description An efficient finite map from bytestrings 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. +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.). %package devel @@ -53,6 +60,8 @@ files. %install %ghc_lib_install +rm %{buildroot}%{ghc_pkgdocdir}/LICENSE + %post devel %ghc_pkg_recache @@ -63,7 +72,7 @@ files. %files -f %{name}.files -%doc LICENSE +%license LICENSE %files devel -f %{name}-devel.files @@ -71,6 +80,9 @@ files. %changelog +* Sat Apr 23 2016 Ben Boeckel - 0.2.4.1-1 +- update to 0.2.4.1 + * Wed Feb 03 2016 Fedora Release Engineering - 0.2.4-3 - Rebuilt for https://fedoraproject.org/wiki/Fedora_24_Mass_Rebuild diff --git a/sources b/sources index 26740eb..367c179 100644 --- a/sources +++ b/sources @@ -1 +1 @@ -62330133977413e2dca875b0cb672f8f bytestring-trie-0.2.4.tar.gz +9040e364910ec899041510082e4d4cf0 bytestring-trie-0.2.4.1.tar.gz