| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2021-11-03 | Optimize live point computation | Mark Rousskov | -0/+95 | |
| This is just replicating the previous algorithm, but taking advantage of the bitset structures to optimize into tighter and better optimized loops. Particularly advantageous on enormous MIR blocks, which are relatively rare in practice. | ||||
| 2021-08-26 | Formatting | Will Crichton | -6/+6 | |
| 2021-08-26 | Fix failing test | Will Crichton | -7/+7 | |
| 2021-08-26 | Add comments and unit tests for new SparseBitMatrix methods | Will Crichton | -0/+66 | |
| 2021-08-26 | Compile failure | Will Crichton | -1/+1 | |
| 2021-08-26 | Compilation failure in tests | Will Crichton | -6/+6 | |
| 2021-08-26 | Fix sparse intersect bug, add more sparse / dense tests | Will Crichton | -1/+12 | |
| 2021-08-25 | Add unit tests for BitSet intersect/subtract | Will Crichton | -1/+12 | |
| 2021-02-02 | Add additional benchmarks to bit_set | kadmin | -0/+34 | |
| 2020-08-30 | mv compiler to compiler/ | mark | -0/+366 | |
