update to 0.2.7.3
This commit is contained in:
Jens Petersen
parent
9786dbc4e7
commit
3b157065a2
|
|
@ -1,3 +1,4 @@
|
|||
/psqueues-0.2.4.0.tar.gz
|
||||
/psqueues-0.2.7.0.tar.gz
|
||||
/psqueues-0.2.7.2.tar.gz
|
||||
/psqueues-0.2.7.3.tar.gz
|
||||
|
|
|
|||
|
|
@ -1,14 +1,14 @@
|
|||
# generated by cabal-rpm-2.0.9
|
||||
# generated by cabal-rpm-2.0.12
|
||||
# https://docs.fedoraproject.org/en-US/packaging-guidelines/Haskell/
|
||||
|
||||
%global pkg_name psqueues
|
||||
%global pkgver %{pkg_name}-%{version}
|
||||
|
||||
%bcond_with tests
|
||||
%bcond_without tests
|
||||
|
||||
Name: ghc-%{pkg_name}
|
||||
Version: 0.2.7.2
|
||||
Release: 9%{?dist}
|
||||
Version: 0.2.7.3
|
||||
Release: 1%{?dist}
|
||||
Summary: Pure priority search queues
|
||||
|
||||
License: BSD
|
||||
|
|
@ -130,6 +130,9 @@ cp -bp %{SOURCE1} %{pkg_name}.cabal
|
|||
|
||||
|
||||
%changelog
|
||||
* Tue Jun 07 2022 Jens Petersen <petersen@redhat.com> - 0.2.7.3-1
|
||||
- https://hackage.haskell.org/package/psqueues-0.2.7.3/changelog
|
||||
|
||||
* Thu Jan 20 2022 Fedora Release Engineering <releng@fedoraproject.org> - 0.2.7.2-9
|
||||
- Rebuilt for https://fedoraproject.org/wiki/Fedora_36_Mass_Rebuild
|
||||
|
||||
|
|
|
|||
|
|
@ -1,158 +1,159 @@
|
|||
Name: psqueues
|
||||
Version: 0.2.7.2
|
||||
x-revision: 1
|
||||
License: BSD3
|
||||
License-file: LICENSE
|
||||
Maintainer: Jasper Van der Jeugt <jaspervdj@gmail.com>
|
||||
Bug-reports: https://github.com/jaspervdj/psqueues/issues
|
||||
Synopsis: Pure priority search queues
|
||||
Category: Data Structures
|
||||
Build-type: Simple
|
||||
Cabal-version: >=1.8
|
||||
|
||||
Description:
|
||||
The psqueues package provides
|
||||
<http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in
|
||||
three different flavors.
|
||||
.
|
||||
* @OrdPSQ k p v@, which uses the @Ord k@ instance to provide fast insertion,
|
||||
deletion and lookup. This implementation is based on Ralf Hinze's
|
||||
<http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>.
|
||||
Hence, it is similar to the
|
||||
<http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is
|
||||
considerably faster and provides a slightly different API.
|
||||
.
|
||||
* @IntPSQ p v@ is a far more efficient implementation. It fixes the key type
|
||||
to @Int@ and uses a <http://en.wikipedia.org/wiki/Radix_tree radix tree>
|
||||
(like @IntMap@) with an additional min-heap property.
|
||||
.
|
||||
* @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it
|
||||
simply uses the keys' hashes as indices in the @IntPSQ@. If there are any
|
||||
hash collisions, it uses an @OrdPSQ@ to resolve those. The performance of
|
||||
this implementation is comparable to that of @IntPSQ@, but it is more widely
|
||||
applicable since the keys are not restricted to @Int@, but rather to any
|
||||
@Hashable@ datatype.
|
||||
.
|
||||
Each of the three implementations provides the same API, so they can be used
|
||||
interchangeably. The benchmarks show how they perform relative to one
|
||||
another, and also compared to the other Priority Search Queue
|
||||
implementations on Hackage:
|
||||
<http://hackage.haskell.org/package/PSQueue PSQueue>
|
||||
and
|
||||
<http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>.
|
||||
.
|
||||
<<http://i.imgur.com/KmbDKR6.png>>
|
||||
.
|
||||
<<http://i.imgur.com/ClT181D.png>>
|
||||
.
|
||||
Typical applications of Priority Search Queues include:
|
||||
.
|
||||
* Caches, and more specifically LRU Caches;
|
||||
.
|
||||
* Schedulers;
|
||||
.
|
||||
* Pathfinding algorithms, such as Dijkstra's and A*.
|
||||
|
||||
Extra-source-files:
|
||||
CHANGELOG
|
||||
|
||||
Source-repository head
|
||||
type: git
|
||||
location: http://github.com/jaspervdj/psqueues.git
|
||||
|
||||
Library
|
||||
Ghc-options: -O2 -Wall
|
||||
Hs-source-dirs: src
|
||||
other-extensions: CPP, Safe, Trustworthy
|
||||
|
||||
Build-depends:
|
||||
base >= 4.2 && < 5
|
||||
, deepseq >= 1.2 && < 1.5
|
||||
, hashable >= 1.1.2.3 && < 1.4
|
||||
|
||||
if impl(ghc>=6.10)
|
||||
Build-depends: ghc-prim
|
||||
|
||||
Exposed-modules:
|
||||
Data.HashPSQ
|
||||
Data.IntPSQ
|
||||
Data.OrdPSQ
|
||||
Other-modules:
|
||||
Data.BitUtil
|
||||
Data.HashPSQ.Internal
|
||||
Data.IntPSQ.Internal
|
||||
Data.OrdPSQ.Internal
|
||||
|
||||
Benchmark psqueues-benchmarks
|
||||
Type: exitcode-stdio-1.0
|
||||
Hs-source-dirs: src benchmarks
|
||||
Main-is: Main.hs
|
||||
Ghc-options: -Wall
|
||||
|
||||
Other-modules:
|
||||
BenchmarkTypes
|
||||
Data.BitUtil
|
||||
Data.FingerTree.PSQueue.Benchmark
|
||||
Data.HashPSQ
|
||||
Data.HashPSQ.Benchmark
|
||||
Data.HashPSQ.Internal
|
||||
Data.IntPSQ
|
||||
Data.IntPSQ.Benchmark
|
||||
Data.IntPSQ.Internal
|
||||
Data.OrdPSQ
|
||||
Data.OrdPSQ.Benchmark
|
||||
Data.OrdPSQ.Internal
|
||||
Data.PSQueue.Benchmark
|
||||
|
||||
Build-depends:
|
||||
containers >= 0.5
|
||||
, unordered-containers >= 0.2.4
|
||||
, criterion >= 0.8
|
||||
, mtl >= 2.1
|
||||
, fingertree-psqueue >= 0.3
|
||||
, PSQueue >= 1.1
|
||||
, random >= 1.0
|
||||
|
||||
, base
|
||||
, deepseq
|
||||
, ghc-prim
|
||||
, hashable
|
||||
, psqueues
|
||||
|
||||
Test-suite psqueues-tests
|
||||
Cpp-options: -DTESTING -DSTRICT
|
||||
Ghc-options: -Wall
|
||||
Hs-source-dirs: src tests
|
||||
Main-is: Main.hs
|
||||
Type: exitcode-stdio-1.0
|
||||
|
||||
Other-modules:
|
||||
Data.BitUtil
|
||||
Data.HashPSQ
|
||||
Data.HashPSQ.Internal
|
||||
Data.HashPSQ.Tests
|
||||
Data.IntPSQ
|
||||
Data.IntPSQ.Internal
|
||||
Data.IntPSQ.Tests
|
||||
Data.OrdPSQ
|
||||
Data.OrdPSQ.Internal
|
||||
Data.OrdPSQ.Tests
|
||||
Data.PSQ.Class
|
||||
Data.PSQ.Class.Gen
|
||||
Data.PSQ.Class.Tests
|
||||
Data.PSQ.Class.Util
|
||||
|
||||
Build-depends:
|
||||
HUnit >= 1.2 && < 1.7
|
||||
, QuickCheck >= 2.7 && < 2.14
|
||||
, tasty >= 1.2 && < 1.3
|
||||
, tasty-hunit >= 0.9 && < 0.11
|
||||
, tasty-quickcheck >= 0.8 && < 0.11
|
||||
|
||||
, base
|
||||
, array
|
||||
, deepseq
|
||||
, ghc-prim
|
||||
, hashable
|
||||
, psqueues
|
||||
, tagged
|
||||
Name: psqueues
|
||||
Version: 0.2.7.3
|
||||
License: BSD3
|
||||
License-file: LICENSE
|
||||
Maintainer: Jasper Van der Jeugt <jaspervdj@gmail.com>
|
||||
Bug-reports: https://github.com/jaspervdj/psqueues/issues
|
||||
Synopsis: Pure priority search queues
|
||||
Category: Data Structures
|
||||
Build-type: Simple
|
||||
Cabal-version: >=1.10
|
||||
|
||||
Description:
|
||||
The psqueues package provides
|
||||
<http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in
|
||||
three different flavors.
|
||||
.
|
||||
* @OrdPSQ k p v@, which uses the @Ord k@ instance to provide fast insertion,
|
||||
deletion and lookup. This implementation is based on Ralf Hinze's
|
||||
<http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>.
|
||||
Hence, it is similar to the
|
||||
<http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is
|
||||
considerably faster and provides a slightly different API.
|
||||
.
|
||||
* @IntPSQ p v@ is a far more efficient implementation. It fixes the key type
|
||||
to @Int@ and uses a <http://en.wikipedia.org/wiki/Radix_tree radix tree>
|
||||
(like @IntMap@) with an additional min-heap property.
|
||||
.
|
||||
* @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it
|
||||
simply uses the keys' hashes as indices in the @IntPSQ@. If there are any
|
||||
hash collisions, it uses an @OrdPSQ@ to resolve those. The performance of
|
||||
this implementation is comparable to that of @IntPSQ@, but it is more widely
|
||||
applicable since the keys are not restricted to @Int@, but rather to any
|
||||
@Hashable@ datatype.
|
||||
.
|
||||
Each of the three implementations provides the same API, so they can be used
|
||||
interchangeably. The benchmarks show how they perform relative to one
|
||||
another, and also compared to the other Priority Search Queue
|
||||
implementations on Hackage:
|
||||
<http://hackage.haskell.org/package/PSQueue PSQueue>
|
||||
and
|
||||
<http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>.
|
||||
.
|
||||
<<http://i.imgur.com/KmbDKR6.png>>
|
||||
.
|
||||
<<http://i.imgur.com/ClT181D.png>>
|
||||
.
|
||||
Typical applications of Priority Search Queues include:
|
||||
.
|
||||
* Caches, and more specifically LRU Caches;
|
||||
.
|
||||
* Schedulers;
|
||||
.
|
||||
* Pathfinding algorithms, such as Dijkstra's and A*.
|
||||
|
||||
Extra-source-files:
|
||||
CHANGELOG
|
||||
|
||||
Source-repository head
|
||||
type: git
|
||||
location: http://github.com/jaspervdj/psqueues.git
|
||||
|
||||
Library
|
||||
Default-language: Haskell2010
|
||||
Ghc-options: -O2 -Wall
|
||||
Hs-source-dirs: src
|
||||
|
||||
Build-depends:
|
||||
base >= 4.2 && < 5
|
||||
, deepseq >= 1.2 && < 1.5
|
||||
, hashable >= 1.1.2.3 && < 1.5
|
||||
|
||||
if impl(ghc>=6.10)
|
||||
Build-depends: ghc-prim
|
||||
|
||||
Exposed-modules:
|
||||
Data.HashPSQ
|
||||
Data.IntPSQ
|
||||
Data.OrdPSQ
|
||||
Other-modules:
|
||||
Data.BitUtil
|
||||
Data.HashPSQ.Internal
|
||||
Data.IntPSQ.Internal
|
||||
Data.OrdPSQ.Internal
|
||||
|
||||
Benchmark psqueues-benchmarks
|
||||
Default-language: Haskell2010
|
||||
Ghc-options: -Wall
|
||||
Hs-source-dirs: src benchmarks
|
||||
Main-is: Main.hs
|
||||
Type: exitcode-stdio-1.0
|
||||
|
||||
Other-modules:
|
||||
BenchmarkTypes
|
||||
Data.BitUtil
|
||||
Data.FingerTree.PSQueue.Benchmark
|
||||
Data.HashPSQ
|
||||
Data.HashPSQ.Benchmark
|
||||
Data.HashPSQ.Internal
|
||||
Data.IntPSQ
|
||||
Data.IntPSQ.Benchmark
|
||||
Data.IntPSQ.Internal
|
||||
Data.OrdPSQ
|
||||
Data.OrdPSQ.Benchmark
|
||||
Data.OrdPSQ.Internal
|
||||
Data.PSQueue.Benchmark
|
||||
|
||||
Build-depends:
|
||||
containers >= 0.5
|
||||
, unordered-containers >= 0.2.4
|
||||
, criterion >= 0.8
|
||||
, mtl >= 2.1
|
||||
, fingertree-psqueue >= 0.3
|
||||
, PSQueue >= 1.1
|
||||
, random >= 1.0
|
||||
|
||||
, base
|
||||
, deepseq
|
||||
, ghc-prim
|
||||
, hashable
|
||||
, psqueues
|
||||
|
||||
Test-suite psqueues-tests
|
||||
Cpp-options: -DTESTING -DSTRICT
|
||||
Default-language: Haskell2010
|
||||
Ghc-options: -Wall
|
||||
Hs-source-dirs: src tests
|
||||
Main-is: Main.hs
|
||||
Type: exitcode-stdio-1.0
|
||||
|
||||
Other-modules:
|
||||
Data.BitUtil
|
||||
Data.HashPSQ
|
||||
Data.HashPSQ.Internal
|
||||
Data.HashPSQ.Tests
|
||||
Data.IntPSQ
|
||||
Data.IntPSQ.Internal
|
||||
Data.IntPSQ.Tests
|
||||
Data.OrdPSQ
|
||||
Data.OrdPSQ.Internal
|
||||
Data.OrdPSQ.Tests
|
||||
Data.PSQ.Class
|
||||
Data.PSQ.Class.Gen
|
||||
Data.PSQ.Class.Tests
|
||||
Data.PSQ.Class.Util
|
||||
|
||||
Build-depends:
|
||||
HUnit >= 1.2 && < 1.7
|
||||
, QuickCheck >= 2.7 && < 2.15
|
||||
, tasty >= 1.2 && < 1.5
|
||||
, tasty-hunit >= 0.9 && < 0.11
|
||||
, tasty-quickcheck >= 0.8 && < 0.11
|
||||
|
||||
, base
|
||||
, array
|
||||
, deepseq
|
||||
, ghc-prim
|
||||
, hashable
|
||||
, psqueues
|
||||
, tagged
|
||||
2
sources
2
sources
|
|
@ -1 +1 @@
|
|||
SHA512 (psqueues-0.2.7.2.tar.gz) = cc70bc22568d24b8618d43be7a2261ab7b55005e7e68a49a4d09b323e03954c05fe8d4de2c344760cdfef26b04bc6937bc331f7e310e1bc9b6b512068eed3be3
|
||||
SHA512 (psqueues-0.2.7.3.tar.gz) = 7a089a68f8b99f93780cc05e1b3454c266077f47a453f139bbe368cdca889e8b7098aa2770c86fcb32eddcb15837a7d60c70da946ad5a234a72bf01fff017fff
|
||||
|
|
|
|||
Loading…
Reference in New Issue