Ragnar Groot Koerkamp
Ragnar Groot Koerkamp
The code for keeping track of all contours is unnecessarily complex. It can be simplified a lot by simple allocating the vector of blocks up front and indexing it directly...
Currently `pa-vis` depends on `pa-heuristic` but that's weird; it would be nicer the other way around. Ideally: - we merge `pa-vis` and `pa-vis-types`; - add a small trait that heuristics...
There are some tricky and end-to-end tests scattered around the place but nothing structured. `pa-bench` automatically tests outcomes anyway. Probably best is to simply fuzz a few types of most...
It can happen that two `jobs` `A` and `B` with `A
Something similar to this: https://github.com/RagnarGrootKoerkamp/BAPCtools/blob/master/support/generators_yaml_schema.json Editors with yaml LSP can use this for autocompletion.
For small context (up to 496bp) it seems that `sort_by_cached_key` which reads and stores the context is up to 3 times faster than doing `sort_by` with the custom comparator having...
Edit: this only makes sense after #3 When using k=10, the `thread_counts` array has size $5\cdot 4^k$ bytes (per thread). This is: - `k=8`: `320KB` - `k=9`: `1.3MB` - `k=10`:...
At least on Archlinux, `/tmp` is a `tempfs` and hence in RAM, and limited in size to half the available memory. Solaris and Fedora also do this apparently. For me...
Since it models a vector, the default can just be empty without allocation. This is useful when having a datastructure that contains a CompactArray that will be initialized later.