-
It doesn't seem to be heap or cpu bottleneck. So what is the actual bottleneck, is it IO cost, due to lookups? If so we need a metric for it.
Or is it skew? because in some scenarios, the workload …
-
The `skew_heap_node` constructor taking an rvalue reference [makes a copy](https://github.com/boostorg/heap/blob/19fda03545e1b85b3a2d3a94b9a3930ec64335d4/include/boost/heap/skew_heap.hpp#L92-L93) inst…
-
### Is your feature request related to a problem? Please describe
This will the single issue where we can track all star tree related test cases, edge cases, potential bugs etc as we develop the feat…
-
Heap snapshot serializer assumes that pointers form a continous region inside the object, but this is not the case with unboxed fields.
This causes a skew between field names and outgoing referenc…
-
I'm really not sure it's worth the trouble, but we could improve the amortized times to worst-case using scheduling. Okasaki's scheme uses a separate schedule, which doesn't seem terribly compact, and…
-
Applications that heavily use NIO, like some Netty-based ones, sometimes benefit from more direct memory as the overall memory available to the JVM increases. This is because direct memory does not ha…
-
Currently the code only supports [making a copy](https://github.com/boostorg/heap/blob/19fda03545e1b85b3a2d3a94b9a3930ec64335d4/include/boost/heap/detail/stable_heap.hpp#L164-L168) of the comparison o…
-
The `MutablePriorityQueue` concept currently [requires](https://github.com/boostorg/heap/blob/19fda03545e1b85b3a2d3a94b9a3930ec64335d4/include/boost/heap/heap_concepts.hpp#L87) that `value_type` be de…
-
FillRect seems much faster than equivalent Path2D. A few ideas to try:
- Can we fake a circle with a radial gradient to transparency? Can we fake a stroke this way?
- Can we draw triangles with sk…
-
Currently objects of variant type are always allocated on the heap and referred to by a (skewed) pointer the form `0bPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP11`. When the variant's payload is `()` (unit), which…