issues
search
lspitzner
/
pqueue
Haskell priority queue package
Other
15
stars
13
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Test GHC 9.4
#87
konsumlamm
closed
1 year ago
0
Allow base < 4.18
#86
alexbiehl
closed
1 year ago
1
Add instances for `indexed-traversable`
#85
konsumlamm
closed
2 years ago
0
Implement more methods for `Down`
#84
konsumlamm
closed
2 years ago
0
Use `Ord a` constraints instead of passing around `<=` functions
#83
konsumlamm
closed
2 years ago
0
Release 1.4.2.0
#82
konsumlamm
closed
2 years ago
0
Update tests
#81
konsumlamm
closed
2 years ago
2
Instances for `indexed-traversable`
#80
konsumlamm
closed
2 years ago
4
Expose `Data.PQueue.Prio.Max.foldlU'`
#79
konsumlamm
closed
2 years ago
2
Two equal priority queues with keys can compare as unequal
#78
konsumlamm
opened
2 years ago
28
`Data.PQueue.Max.map` is the wrong `map`
#77
konsumlamm
closed
2 years ago
0
Fix `Data.PQueue.Max.map` to work on `MaxQueue`s
#76
konsumlamm
closed
2 years ago
0
Use MathJax format for complexity annotations
#75
konsumlamm
closed
2 years ago
0
Update GHC versions
#74
konsumlamm
closed
2 years ago
0
Update `maintainer`
#73
konsumlamm
closed
2 years ago
0
Add larger heapsorts
#72
treeowl
closed
2 years ago
0
Use `tasty-bench` instead of `gauge`
#71
konsumlamm
closed
2 years ago
0
Enable optimizations
#70
konsumlamm
opened
2 years ago
1
Small updates
#69
konsumlamm
closed
2 years ago
2
Remove redundant `Control.Applicative.Identity`
#68
konsumlamm
closed
2 years ago
2
Followup to #59
#67
konsumlamm
closed
2 years ago
1
Add applicative adjust and update
#66
treeowl
closed
2 years ago
0
Add k-way merge and heapsort benchmarks
#65
treeowl
closed
2 years ago
6
Start working on bare queues
#64
treeowl
closed
2 years ago
10
adjustMinA
#63
treeowl
closed
2 years ago
0
Get rid of eqExtract and cmpExtract?
#62
treeowl
opened
2 years ago
0
Add unordered mapMWithKey
#61
treeowl
opened
2 years ago
0
Add strict mapping functions
#60
treeowl
opened
2 years ago
1
Streamline and expand folds
#59
treeowl
closed
2 years ago
2
Enhance parallel building
#58
treeowl
closed
2 years ago
0
Define stimes
#57
treeowl
closed
2 years ago
0
Switch to Data.Ord.Down
#56
treeowl
opened
2 years ago
2
Make sure we're not building unnecessarily large dictionaries
#55
treeowl
opened
2 years ago
9
Implement stimes
#54
treeowl
closed
2 years ago
1
Remove all orphan instances
#53
treeowl
closed
2 years ago
3
Remove orphan instances
#52
treeowl
closed
2 years ago
0
Fix Data instances
#51
treeowl
closed
2 years ago
0
Data instances are unsafe/wrong
#50
treeowl
closed
1 year ago
5
Test all queue types and functions
#49
treeowl
closed
2 years ago
0
Add benchmarks
#48
treeowl
opened
2 years ago
9
Fix warnings & implement missing method
#47
konsumlamm
closed
2 years ago
0
Foldable traversable
#46
treeowl
closed
2 years ago
2
Improve RULES situation
#45
treeowl
closed
2 years ago
1
Add GitHub CI
#44
konsumlamm
closed
2 years ago
2
Bumped base upper bound
#43
jchia
closed
2 years ago
2
Allow base-4.16
#42
jchia
closed
2 years ago
0
Active maintainer
#41
konsumlamm
closed
2 years ago
12
Bump base upper bound to <4.16
#40
mitchellwrosen
closed
2 years ago
2
Remove unnecessary imports
#39
konsumlamm
closed
2 years ago
2
Add real-time versions?
#38
treeowl
opened
3 years ago
6
Previous
Next