about summary refs log tree commit diff
path: root/compiler/rustc_index/src/interval.rs
AgeCommit message (Collapse)AuthorLines
2023-01-05Fix `uninlined_format_args` for some compiler cratesnils-4/+1
Convert all the crates that have had their diagnostic migration completed (except save_analysis because that will be deleted soon and apfloat because of the licensing problem).
2022-06-08fix the impl error in `insert_all`SparrowLii-1/+3
2022-06-08add `check_invariants` methodSparrowLii-7/+33
2022-06-08optimize `superset` method of `IntervalSet`SparrowLii-4/+21
2022-05-10optimize `insert_range` method of `IntervalSet`SparrowLii-48/+45
2022-02-19Adopt let else in more placesest31-12/+6
2021-12-30Introduce IntervalSetMark Rousskov-0/+269
This is a compact, fast storage for variable-sized sets, typically consisting of larger ranges. It is less efficient than a bitset if ranges are both small and the domain size is small, but will still perform acceptably. With enormous domain sizes and large ranges, the interval set performs much better, as it can be much more densely packed in memory than the uncompressed bit set alternative.