diff options
| author | Dylan MacKenzie <ecstaticmorse@gmail.com> | 2019-06-21 12:39:01 -0700 |
|---|---|---|
| committer | Dylan MacKenzie <ecstaticmorse@gmail.com> | 2019-06-22 10:18:19 -0700 |
| commit | c8cbd4fc784e5d432c02b0dc14a592f112dab59f (patch) | |
| tree | 5300621f90fc24eb556c5d4b8d5b79401cf61012 /src/librustc_data_structures | |
| parent | c054186ec70ae2393330886cb8dc506aab21750c (diff) | |
| download | rust-c8cbd4fc784e5d432c02b0dc14a592f112dab59f.tar.gz rust-c8cbd4fc784e5d432c02b0dc14a592f112dab59f.zip | |
Merge `BitSetOperator` and `InitialFlow` into one trait.
Since the value of `InitialFlow` defines the semantics of the `join` operation, there's no reason to have seperate traits for each. We can add a default impl of `join` which branches based on `BOTTOM_VALUE`. This should get optimized away.
Diffstat (limited to 'src/librustc_data_structures')
| -rw-r--r-- | src/librustc_data_structures/bit_set.rs | 5 |
1 files changed, 0 insertions, 5 deletions
diff --git a/src/librustc_data_structures/bit_set.rs b/src/librustc_data_structures/bit_set.rs index 7a11ca07007..f4a60b4d2c1 100644 --- a/src/librustc_data_structures/bit_set.rs +++ b/src/librustc_data_structures/bit_set.rs @@ -273,11 +273,6 @@ impl<'a, T: Idx> Iterator for BitIter<'a, T> { } } -pub trait BitSetOperator { - /// Combine one bitset into another. - fn join<T: Idx>(&self, inout_set: &mut BitSet<T>, in_set: &BitSet<T>) -> bool; -} - #[inline] fn bitwise<Op>(out_vec: &mut [Word], in_vec: &[Word], op: Op) -> bool where Op: Fn(Word, Word) -> Word |