rust/compiler/rustc_index/src/lib.rs

#![feature(allow_internal_unstable)]
#![feature(bench_black_box)]
#![feature(extend_one)]
#![feature(min_specialization)]
#![feature(step_trait)]
#![feature(test)]
#![feature(let_else)]

pub mod bit_set;
pub mod interval;
pub mod vec;
move index_vec into rustc_index 2019-09-26 03:09:51 +08:00			`#![feature(allow_internal_unstable)]`
move core::hint::black_box under its own feature gate 2021-04-15 11:19:24 +02:00			`#![feature(bench_black_box)]`
Add Extend::{extend_one,extend_reserve} This adds new optional methods on `Extend`: `extend_one` add a single element to the collection, and `extend_reserve` pre-allocates space for the predicted number of incoming elements. These are used in `Iterator` for `partition` and `unzip` as they shuffle elements one-at-a-time into their respective collections. 2020-05-12 20:09:55 -07:00			`#![feature(extend_one)]`
Swap out unboxed_closures feature gate for min_specialization For some reason unboxed_closures supresses the feature gate for min_specialization when implementing TrustedStep. min_specialization is the true feature that is used. 2021-08-29 19:42:41 +02:00			`#![feature(min_specialization)]`
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-01 10:04:01 -04:00			`#![feature(step_trait)]`
remove bit_set re-export from rustc_data_structures 2019-09-26 05:30:10 +00:00			`#![feature(test)]`
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-01 10:04:01 -04:00			`#![feature(let_else)]`
move index_vec into rustc_index 2019-09-26 03:09:51 +08:00
move bit_set into rustc_index 2019-09-26 03:26:16 +00:00			`pub mod bit_set;`
Introduce IntervalSet 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. 2021-11-05 14:50:29 -04:00			`pub mod interval;`
Format the world 2019-12-22 17:42:04 -05:00			`pub mod vec;`