Replies: 1 comment
-
The implementations of the core operators are based on the pure Python implementation of the heapq module (which is the fallback to the C implementation) and should have similar performance on common operations with some overhead of keeping the position dictionary updated. I've never done a formal benchmark but would welcome a PR with a benchmarking script. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
@nvictus Do you have a runtime comparison of this library with
heapq
? Unlikeheapq
, which does not support changing the priority of items already in the priority queue, whilepqdict
does. Given that heapq only supportspush
,pop
,pushpop
, and poppush (heapreplace
) operations, how doespqdict
compare in terms of performance on these operations?Beta Was this translation helpful? Give feedback.
All reactions