diff options
| author | Nicholas Nethercote <nnethercote@mozilla.com> | 2018-09-13 14:19:01 +1000 |
|---|---|---|
| committer | Nicholas Nethercote <nnethercote@mozilla.com> | 2018-09-13 19:36:03 +1000 |
| commit | b697409f10e70558ef72d39eee4a5f7af60cf16b (patch) | |
| tree | 320172bde65674b3cbe4f25cff748c923d5b4b7d /src/test/incremental/thinlto | |
| parent | 755fcae75e9634e6a11651f46d17d7b1310f821b (diff) | |
| download | rust-b697409f10e70558ef72d39eee4a5f7af60cf16b.tar.gz rust-b697409f10e70558ef72d39eee4a5f7af60cf16b.zip | |
Remove bitslice.rs.
This requires the following changes. - It moves parts of bitslice.rs into bitvec.rs: `bitwise()`, `BitwiseOperator`, `bits_to_string()`. - It changes `IdxSet` to just be a wrapper around `BitArray`. - It changes `BitArray` and `BitVec` to use `usize` words instead of `u128` words. (`BitSlice` and `IdxSet` already use `usize`.) Local profiling showed `usize` was better. - It moves some operations from `IdxSet` into `BitArray`: `new_filled()`, `clear()`, `set_up_to()`, `trim_to()` (renamed `clear_above()`), `words()` and `words_mut()`, `encode()` and `decode(). The `IdxSet` operations now just call the `BitArray` operations. - It replaces `BitArray`'s iterator implementation with `IdxSet`'s, because the latter is more concise. It also removes the buggy `size_hint` function from `BitArray`'s iterator, which counted the number of *words* rather than the number of *bits*. `IdxSet`'s iterator is now just a thin wrapper around `BitArray`'s iterator. - It moves some unit tests from `indexed_set.rs` to `bitvec.rs`.
Diffstat (limited to 'src/test/incremental/thinlto')
0 files changed, 0 insertions, 0 deletions
