1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
name: pqueue
version: 1.5.0.0
category: Data Structures
author: Louis Wasserman
license: BSD3
license-file: LICENSE
stability: experimental
synopsis: Reliable, persistent, fast priority queues.
description: A fast, reliable priority queue implementation based on a binomial heap.
maintainer: Lennart Spitzner <hexagoxel@hexagoxel.de>,
Louis Wasserman <wasserman.louis@gmail.com>,
konsumlamm <konsumlamm@gmail.com>,
David Feuer <David.Feuer@gmail.com>
homepage: https://github.com/lspitzner/pqueue
bug-reports: https://github.com/lspitzner/pqueue/issues
build-type: Simple
cabal-version: >= 1.10
tested-with: GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4,
GHC == 8.10.7, GHC == 9.0.2, GHC == 9.2.7, GHC == 9.4.5, GHC == 9.6.2
extra-source-files:
CHANGELOG.md
README.md
source-repository head
type: git
location: https://github.com/lspitzner/pqueue.git
library
hs-source-dirs: src
default-language:
Haskell2010
build-depends:
{ base >= 4.8 && < 4.19
, deepseq >= 1.3 && < 1.5
, indexed-traversable >= 0.1 && < 0.2
}
exposed-modules:
Data.PQueue.Prio.Min
Data.PQueue.Prio.Max
Data.PQueue.Min
Data.PQueue.Max
other-modules:
Data.PQueue.Prio.Internals
Data.PQueue.Internals
BinomialQueue.Internals
BinomialQueue.Min
BinomialQueue.Max
Data.PQueue.Internals.Down
Data.PQueue.Internals.Foldable
Data.PQueue.Prio.Max.Internals
Nattish
if impl(ghc) {
default-extensions: DeriveDataTypeable
}
other-extensions:
BangPatterns
, CPP
ghc-options:
-- We currently need -fspec-constr to get GHC to compile conversions
-- from lists well. We could (and probably should) write those a
-- bit differently so we won't need it.
-fspec-constr
-fdicts-strict
-Wall
if impl(ghc >= 8.0)
ghc-options:
-fno-warn-unused-imports
test-suite test
hs-source-dirs: src, tests
default-language: Haskell2010
type: exitcode-stdio-1.0
main-is: PQueueTests.hs
build-depends:
{ base >= 4.8 && < 4.19
, deepseq >= 1.3 && < 1.5
, indexed-traversable >= 0.1 && < 0.2
, tasty
, tasty-quickcheck
}
other-modules:
Data.PQueue.Prio.Min
Data.PQueue.Prio.Max
Data.PQueue.Min
Data.PQueue.Max
Data.PQueue.Prio.Internals
Data.PQueue.Internals
BinomialQueue.Internals
BinomialQueue.Min
BinomialQueue.Max
Data.PQueue.Internals.Down
Data.PQueue.Internals.Foldable
Data.PQueue.Prio.Max.Internals
Nattish
Validity.BinomialQueue
Validity.PQueue.Min
Validity.PQueue.Prio.BinomialQueue
Validity.PQueue.Prio.Min
Validity.PQueue.Prio.Max
if impl(ghc) {
default-extensions: DeriveDataTypeable
}
ghc-options:
-Wall
-fno-warn-type-defaults
benchmark minqueue-benchmarks
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: benchmarks
main-is: BenchMinQueue.hs
other-modules:
KWay.MergeAlg
HeapSort
KWay.RandomIncreasing
ghc-options: -O2
build-depends:
base >= 4.8 && < 5
, pqueue
, deepseq >= 1.3 && < 1.5
, random >= 1.2 && < 1.3
, tasty-bench >= 0.3 && < 0.4
benchmark minpqueue-benchmarks
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: benchmarks
main-is: BenchMinPQueue.hs
other-modules:
KWay.PrioMergeAlg
PHeapSort
KWay.RandomIncreasing
ghc-options: -O2
build-depends:
base >= 4.8 && < 5
, pqueue
, deepseq >= 1.3 && < 1.5
, random >= 1.2 && < 1.3
, tasty-bench >= 0.3 && < 0.4
|
