mirrors/git-annex
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages 1 Wiki Activity Actions

data type that starts off using a set but converts to a bloom filter when large

Browse source 
This adds a dep on hashable, but it's a free dependency, since
unordered-containers already pulled it in.

Using unordered-containers for the set seems to make sense, since it
hashes and bloom filter hashes too. (Though different hashes.)
I dunno, never quite know if I should use unordered-containers or containers.
This commit is contained in:
Joey Hess 2020-07-01 14:03:16 -04:00
parent 424b1912d6
commit 7e2c4ed216
No known key found for this signature in database
GPG key ID: DB12DB0FF05F8F38
3 changed files with 92 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

1
debian/control vendored
View file

@ -29,6 +29,7 @@ Build-Depends:
libghc-aeson-dev,
libghc-tagsoup-dev,
libghc-unordered-containers-dev,
libghc-hashable-dev,
libghc-ifelse-dev,
libghc-bloomfilter-dev,
libghc-edit-distance-dev,