-
Currently nanopb relies on `realloc()` to efficiently increase size of allocated arrays, without extra copying.
For some allocators this assumption is incorrect. Most notably newlib-nano implements…
-
The StardewUI Framework uses _a lot_ of reflection, and caches very aggressively, so it is highly responsive once it gets going, but opening the very first view for the very first time can be a little…
-
Currently BaseX implements XQuery sequences as lightweight array lists, which is fast for simple use cases, but breaks down completely when sequences are used as immutable lists because of the copying…
-
I am working on a streaming system where I need to calculate the statistics of a metric like percentiles and medians. While the data I am getting is a stream, I want to query the percentiles at certai…
-
### Brief Intro
Queue Optimized - dequeue is not O(1)
### More Details
```
if array.count > 50 && percentage > 0.25 {
array.removeFirst(head)
head = 0
}
```
If the condi…
-
The new fulfillment context introduced in #30533 could be more efficient in a number of ways in terms of pruning the work it has to do. First, it currently considers obligations to be formed in a tree…
-
Mostly leaving this as a note. LinkedHashMap and LinkedHashSet are, as implemented in the Java standard library, pretty cool structures. Map entries contain a doubly linked list to next and previous e…
-
gasnet-ibv-large (dynamic registration with firehose) comm performance lags behind gasnet-ibv-fast (static registration). Performance really lags for bulk comm (e.g. 1GB transfers) and we see a large …
-
Change how reads pairs are sorted through by reading SAM file reference by reference and using a positions window gliding on each reference.
One major problem: How to store read pairs on which we a…
-
# Ackermann's function is not primitive recursive, I
[https://lawrencecpaulson.github.io/2022/08/31/Ackermann-not-PR-I.html](https://lawrencecpaulson.github.io/2022/08/31/Ackermann-not-PR-I.html)