Cabal revisions of list-tries-0.6.0
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-Cabal-Version: >= 1.6--Name: list-tries-Version: 0.6.0-Homepage: http://iki.fi/matti.niemenmaa/list-tries/-Synopsis: Tries and Patricia tries: finite sets and maps for list keys-Category: Data, Data Structures-Stability: provisional-Description:- This library provides implementations of finite sets and maps for list keys- using tries, both simple and of the Patricia kind. In most (or all? sorry,- haven't benchmarked yet) cases, the Patricia tries will have better- performance, so use them unless you have reasons not to.- .- The data types are parametrized over the map type they use internally to- store the child nodes: this allows extending them to support different kinds- of key types or increasing efficiency. Child maps are required to be- instances of the Map class in Data.ListTrie.Base.Map. Some operations- additionally require an OrdMap instance.- .- The Eq, Ord, and Enum modules contain ready structures for key types which- are instances of those classes, using lists of pairs, Data.Map, and- Data.IntMap respectively.--Author: Matti Niemenmaa-Maintainer: Matti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>-License: BSD3-License-File: LICENSE.txt--Build-Type: Simple--Extra-Source-Files: CHANGELOG.txt- CREDITS.txt- headers/*.h- tests/README.txt- tests/*.hs- tests/Tests/*.hs--source-repository head- type: git- location: https://github.com/Deewiant/list-tries--flag testing- description: Enable building a test executable- default: False--Library- Build-Depends: base >= 3 && < 4.9- , containers >= 0.3 && < 0.6- , dlist >= 0.4 && < 0.8- , binary >= 0.5 && < 0.8-- Exposed-Modules: Data.ListTrie.Base.Map- Data.ListTrie.Map- Data.ListTrie.Map.Eq- Data.ListTrie.Map.Ord- Data.ListTrie.Map.Enum- Data.ListTrie.Set- Data.ListTrie.Set.Eq- Data.ListTrie.Set.Ord- Data.ListTrie.Set.Enum- Data.ListTrie.Patricia.Map- Data.ListTrie.Patricia.Map.Eq- Data.ListTrie.Patricia.Map.Ord- Data.ListTrie.Patricia.Map.Enum- Data.ListTrie.Patricia.Set- Data.ListTrie.Patricia.Set.Eq- Data.ListTrie.Patricia.Set.Ord- Data.ListTrie.Patricia.Set.Enum- Other-Modules: Data.ListTrie.Base- Data.ListTrie.Base.Classes- Data.ListTrie.Base.Map.Internal- Data.ListTrie.Patricia.Base- Data.ListTrie.Util-- Include-Dirs: headers--executable list-tries-tests- if !flag(testing)- buildable: False-- main-is: Main.hs- hs-source-dirs: ., tests-- Build-Depends: base >= 3 && < 4.9- , containers >= 0.3 && < 0.6- , dlist >= 0.4 && < 0.8- , binary >= 0.5 && < 0.8-- if flag(testing)- Build-Depends: template-haskell >= 2.3 && < 2.11- , HUnit >= 1.2 && < 1.3- , QuickCheck >= 2.1 && < 2.8- , test-framework >= 0.2 && < 0.9- , test-framework-hunit >= 0.2 && < 0.4- , test-framework-quickcheck2 >= 0.2 && < 0.4- , ChasingBottoms >= 1.2 && < 1.4-- Other-Modules: Data.ListTrie.Base.Map- Data.ListTrie.Map- Data.ListTrie.Map.Eq- Data.ListTrie.Map.Ord- Data.ListTrie.Map.Enum- Data.ListTrie.Set- Data.ListTrie.Set.Eq- Data.ListTrie.Set.Ord- Data.ListTrie.Set.Enum- Data.ListTrie.Patricia.Map- Data.ListTrie.Patricia.Map.Eq- Data.ListTrie.Patricia.Map.Ord- Data.ListTrie.Patricia.Map.Enum- Data.ListTrie.Patricia.Set- Data.ListTrie.Patricia.Set.Eq- Data.ListTrie.Patricia.Set.Ord- Data.ListTrie.Patricia.Set.Enum- Data.ListTrie.Base- Data.ListTrie.Base.Classes- Data.ListTrie.Base.Map.Internal- Data.ListTrie.Patricia.Base- Data.ListTrie.Util- Tests.Base- Tests.Cases- Tests.Properties- Tests.Strictness- Tests.TH-- Include-Dirs: headers+Cabal-Version: >= 1.6 + +Name: list-tries +Version: 0.6.0 +x-revision: 1 +Homepage: http://iki.fi/matti.niemenmaa/list-tries/ +Synopsis: Tries and Patricia tries: finite sets and maps for list keys +Category: Data, Data Structures +Stability: provisional +Description: + This library provides implementations of finite sets and maps for list keys + using tries, both simple and of the Patricia kind. In most (or all? sorry, + haven't benchmarked yet) cases, the Patricia tries will have better + performance, so use them unless you have reasons not to. + . + The data types are parametrized over the map type they use internally to + store the child nodes: this allows extending them to support different kinds + of key types or increasing efficiency. Child maps are required to be + instances of the Map class in Data.ListTrie.Base.Map. Some operations + additionally require an OrdMap instance. + . + The Eq, Ord, and Enum modules contain ready structures for key types which + are instances of those classes, using lists of pairs, Data.Map, and + Data.IntMap respectively. + +Author: Matti Niemenmaa +Maintainer: Matti Niemenmaa <matti.niemenmaa+list-tries@iki.fi> +License: BSD3 +License-File: LICENSE.txt + +Build-Type: Simple + +Extra-Source-Files: CHANGELOG.txt + CREDITS.txt + headers/*.h + tests/README.txt + tests/*.hs + tests/Tests/*.hs + +source-repository head + type: git + location: https://github.com/Deewiant/list-tries + +flag testing + description: Enable building a test executable + default: False + +Library + Build-Depends: base >= 3 && < 4.8 + , containers >= 0.3 && < 0.6 + , dlist >= 0.4 && < 0.8 + , binary >= 0.5 && < 0.8 + + Exposed-Modules: Data.ListTrie.Base.Map + Data.ListTrie.Map + Data.ListTrie.Map.Eq + Data.ListTrie.Map.Ord + Data.ListTrie.Map.Enum + Data.ListTrie.Set + Data.ListTrie.Set.Eq + Data.ListTrie.Set.Ord + Data.ListTrie.Set.Enum + Data.ListTrie.Patricia.Map + Data.ListTrie.Patricia.Map.Eq + Data.ListTrie.Patricia.Map.Ord + Data.ListTrie.Patricia.Map.Enum + Data.ListTrie.Patricia.Set + Data.ListTrie.Patricia.Set.Eq + Data.ListTrie.Patricia.Set.Ord + Data.ListTrie.Patricia.Set.Enum + Other-Modules: Data.ListTrie.Base + Data.ListTrie.Base.Classes + Data.ListTrie.Base.Map.Internal + Data.ListTrie.Patricia.Base + Data.ListTrie.Util + + Include-Dirs: headers + +executable list-tries-tests + if !flag(testing) + buildable: False + + main-is: Main.hs + hs-source-dirs: ., tests + + Build-Depends: base >= 3 && < 4.8 + , containers >= 0.3 && < 0.6 + , dlist >= 0.4 && < 0.8 + , binary >= 0.5 && < 0.8 + + if flag(testing) + Build-Depends: template-haskell >= 2.3 && < 2.11 + , HUnit >= 1.2 && < 1.3 + , QuickCheck >= 2.1 && < 2.8 + , test-framework >= 0.2 && < 0.9 + , test-framework-hunit >= 0.2 && < 0.4 + , test-framework-quickcheck2 >= 0.2 && < 0.4 + , ChasingBottoms >= 1.2 && < 1.4 + + Other-Modules: Data.ListTrie.Base.Map + Data.ListTrie.Map + Data.ListTrie.Map.Eq + Data.ListTrie.Map.Ord + Data.ListTrie.Map.Enum + Data.ListTrie.Set + Data.ListTrie.Set.Eq + Data.ListTrie.Set.Ord + Data.ListTrie.Set.Enum + Data.ListTrie.Patricia.Map + Data.ListTrie.Patricia.Map.Eq + Data.ListTrie.Patricia.Map.Ord + Data.ListTrie.Patricia.Map.Enum + Data.ListTrie.Patricia.Set + Data.ListTrie.Patricia.Set.Eq + Data.ListTrie.Patricia.Set.Ord + Data.ListTrie.Patricia.Set.Enum + Data.ListTrie.Base + Data.ListTrie.Base.Classes + Data.ListTrie.Base.Map.Internal + Data.ListTrie.Patricia.Base + Data.ListTrie.Util + Tests.Base + Tests.Cases + Tests.Properties + Tests.Strictness + Tests.TH + + Include-Dirs: headers
revision 2
Name: list-tries Version: 0.6.0 -x-revision: 1 +x-revision: 2 Homepage: http://iki.fi/matti.niemenmaa/list-tries/ Synopsis: Tries and Patricia tries: finite sets and maps for list keys Category: Data, Data Structures default: False Library - Build-Depends: base >= 3 && < 4.8 + Build-Depends: base >= 4.8 && < 4.9 , containers >= 0.3 && < 0.6 , dlist >= 0.4 && < 0.8 , binary >= 0.5 && < 0.8 main-is: Main.hs hs-source-dirs: ., tests - Build-Depends: base >= 3 && < 4.8 + Build-Depends: base >= 4.8 && < 4.9 , containers >= 0.3 && < 0.6 , dlist >= 0.4 && < 0.8 , binary >= 0.5 && < 0.8