10 Commits

Author	SHA1	Message	Date
Mark Rousskov	03afb61b53	Optimize live point computation ... 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-11-03 11:24:59 -04:00
Will Crichton	c7357270b8	Formatting	2021-08-26 13:23:24 -07:00
Will Crichton	8d9e4f98e1	Fix failing test	2021-08-26 13:09:39 -07:00
Will Crichton	2166c6db43	Add comments and unit tests for new SparseBitMatrix methods	2021-08-26 12:46:59 -07:00
Will Crichton	7e148b0cef	Compile failure	2021-08-26 12:26:08 -07:00
Will Crichton	e854027c12	Compilation failure in tests	2021-08-26 11:46:57 -07:00
Will Crichton	d73a169f93	Fix sparse intersect bug, add more sparse / dense tests	2021-08-26 11:39:13 -07:00
Will Crichton	1c1603e0b5	Add unit tests for BitSet intersect/subtract	2021-08-25 23:15:21 -07:00
kadmin	6e6608d8b5	Add additional benchmarks to bit_set	2021-02-02 23:31:30 +00:00
mark	9e5f7d5631	mv compiler to compiler/	2020-08-30 18:45:07 +03:00