-
How can I generate/encode data with **zero** heap allocations?
Example use case: I want to generate data to write into a file, so I need to allocate a single structure, message and arena. I can pr…
-
```
I did some local hacking of thread_sanitizer.cc and it turns out we need to do
full-VTS comparison only in NewSegmentForWait().
In all other places we can just compare the current VTS with a TID…
-
## Objective
Make the `poktrolld` more conventionally by leveraging [AutoCLI](https://docs.cosmos.network/main/learn/advanced/autocli) where appropriate while maintaining test coverage and reducing…
-
```
I did some local hacking of thread_sanitizer.cc and it turns out we need to do
full-VTS comparison only in NewSegmentForWait().
In all other places we can just compare the current VTS with a TID…
-
A new section in Chapter 8 should be added about persistent arrays, which are now covered in lecture.
-
**Description**:
The following program is a naive implementation of [AOC 2019](https://adventofcode.com/2019) day 3, that finds (axis-aligned) line intersections using hash table keys as a bitmap:
…
-
Currently, paradigm generation is SLOW.
Quick facts: getting the details for wâpamêw took 5.44s; 4.53s (~83%) of that is paradigm generation! Problem: it uses an O(|P|²) algorithm where |P| is the …
-
In #303 we can see some users complain about the memory usage.
The memory footprint of entry indices largely depends on the average size of entries. File purge and compaction are based on log file …
-
@palday @kleinschmidt I have switched to a Julia noweb (.jnw) source file for `papers/LMMFormulation` and modified `papers/Makefile` to use the `texminted` doctype and `xelatex`.
In general it is b…
-
One of the issues with the jackpot is that the size of the Tasks is relative to the size of the jackpot. As in the the maximum cost of a Task is capped in relation to the size of the jackpot.
Each …