update to 0.2.4.1

This commit is contained in:
Ben Boeckel 2016-04-23 14:03:58 -04:00
parent 3b37c2f590
commit 7a49116466
3 changed files with 23 additions and 10 deletions

1
.gitignore vendored
View File

@ -1,3 +1,4 @@
/bytestring-trie-0.2.2.tar.gz /bytestring-trie-0.2.2.tar.gz
/bytestring-trie-0.2.3.tar.gz /bytestring-trie-0.2.3.tar.gz
/bytestring-trie-0.2.4.tar.gz /bytestring-trie-0.2.4.tar.gz
/bytestring-trie-0.2.4.1.tar.gz

View File

@ -3,8 +3,8 @@
%global pkg_name bytestring-trie %global pkg_name bytestring-trie
Name: ghc-%{pkg_name} Name: ghc-%{pkg_name}
Version: 0.2.4 Version: 0.2.4.1
Release: 3%{?dist} Release: 1%{?dist}
Summary: An efficient finite map from (byte)strings to values Summary: An efficient finite map from (byte)strings to values
License: BSD License: BSD
@ -21,12 +21,19 @@ BuildRequires: ghc-bytestring-devel
%description %description
An efficient finite map from bytestrings to values. An efficient finite map from bytestrings to values.
The implementation is based on big-endian patricia trees, The implementation is based on big-endian patricia trees, like "Data.IntMap".
like "Data.IntMap". We first trie on the elements of We first trie on the elements of "Data.ByteString" and then trie on the
"Data.ByteString" and then trie on the big-endian bit big-endian bit representation of those elements. Patricia trees have efficient
representation of those elements. Patricia trees have algorithms for union and other merging operations, but they're also quick for
efficient algorithms for union and other merging operations, lookups and insertions.
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 %package devel
@ -53,6 +60,8 @@ files.
%install %install
%ghc_lib_install %ghc_lib_install
rm %{buildroot}%{ghc_pkgdocdir}/LICENSE
%post devel %post devel
%ghc_pkg_recache %ghc_pkg_recache
@ -63,7 +72,7 @@ files.
%files -f %{name}.files %files -f %{name}.files
%doc LICENSE %license LICENSE
%files devel -f %{name}-devel.files %files devel -f %{name}-devel.files
@ -71,6 +80,9 @@ files.
%changelog %changelog
* Sat Apr 23 2016 Ben Boeckel <mathstuf@gmail.com> - 0.2.4.1-1
- update to 0.2.4.1
* Wed Feb 03 2016 Fedora Release Engineering <releng@fedoraproject.org> - 0.2.4-3 * Wed Feb 03 2016 Fedora Release Engineering <releng@fedoraproject.org> - 0.2.4-3
- Rebuilt for https://fedoraproject.org/wiki/Fedora_24_Mass_Rebuild - Rebuilt for https://fedoraproject.org/wiki/Fedora_24_Mass_Rebuild

View File

@ -1 +1 @@
62330133977413e2dca875b0cb672f8f bytestring-trie-0.2.4.tar.gz 9040e364910ec899041510082e4d4cf0 bytestring-trie-0.2.4.1.tar.gz