#[repr(transparent)]pub struct BitIdx<R> where
R: BitRegister, { /* private fields */ }
Expand description
A semantic index counter within a register element R
.
This type is a counter in the ring 0 .. R::BITS
, and serves to mark a semantic
index within some register element. It is a virtual index, and is the stored
value used in pointer encodings to track region start information.
It is translated to an electrical index through the BitOrder
trait. This
virtual index is the only counter that can be used for address computation, and
once lowered to an electrical index through BitOrder::at
, the electrical
address can only be used for instruction selection.
Type Parameters
R
: The register element that this index governs.
Validity
Values of this type are required to be in the range 0 .. R::BITS
. Any
value not less than R::BITS
makes the program invalid, and will likely cause
either a crash or incorrect memory access.
Construction
This type can never be constructed outside of the bitvec
crate. It is passed
in to BitOrder
implementations, which may use it to construct electrical
position, selection, or mask values from it. All values of this type constructed
by bitvec
are known to be correct in their region; no other construction
site can be trusted.
Implementations
Wraps a counter value as a known-good index into an R
register.
Parameters
value
: The counter value to mark as an index. This must be not less thanSelf::ZERO
and not more thanSelf::LAST
.
Returns
This returns value
, marked as either a valid or invalid index by
whether or not it is within the valid range 0 .. R::BITS
.
Wraps a counter value as an assumed-good index into an R
register.
Parameters
value
: The counter value to mark as an index. This must be not less thanSelf::ZERO
and not more thanSelf::LAST
.
Returns
This returns value
, marked as a valid index.
Safety
If the value
is outside the valid range, then the program is
incorrect. Debug builds will panic; release builds do not inspect the
value
.
Casts to a new index type.
This will always succeed if self.value()
is a valid index in the S
register; it will return an error if the self
index is too wide for
S
.
Increments an index counter, wrapping at the back edge of the register.
Parameters
self
: The index to increment.
Returns
.0
: The next index afterself
..1
: Indicates that the new index is in the next register.
Decrements an index counter, wrapping at the front edge of the register.
Parameters
self
: The index to decrement.
Returns
.0
: The previous index beforeself
..1
: Indicates that the new index is in the previous register.
Computes the bit position corresponding to self
under some ordering.
This forwards to O::at::<R>
, which is the only public, safe,
constructor for a position counter.
Computes the bit selector corresponding to self
under an ordering.
This forwards to O::select::<R>
, which is the only public, safe,
constructor for a bit selector.
Computes the bit selector for self
as an accessor mask.
This is a type-cast over Self::select
.
pub fn range(
self,
upto: BitTail<R>
) -> impl Iterator<Item = Self> + DoubleEndedIterator + ExactSizeIterator + FusedIterator
pub fn range(
self,
upto: BitTail<R>
) -> impl Iterator<Item = Self> + DoubleEndedIterator + ExactSizeIterator + FusedIterator
Iterates over all indices between an inclusive start and exclusive end point.
Because implementation details of the range type family, including the
RangeBounds
trait, are not yet stable, and heterogenous ranges are
not supported, this must be an opaque iterator rather than a direct
Range<BitIdx<R>>
.
Parameters
from
: The inclusive low bound of the range. This will be the first index produced by the iterator.upto
: The exclusive high bound of the range. The iterator will halt before yielding an index of this value.
Returns
An opaque iterator that is equivalent to the range from .. upto
.
Requirements
from
must be no greater than upto
.
pub fn range_all(
) -> impl Iterator<Item = Self> + DoubleEndedIterator + ExactSizeIterator + FusedIterator
pub fn range_all(
) -> impl Iterator<Item = Self> + DoubleEndedIterator + ExactSizeIterator + FusedIterator
Iterates over all possible index values.
Computes the jump distance for some number of bits away from a starting index.
This computes the number of elements by which to adjust a base pointer, and then the bit index of the destination bit in the new referent register element.
Parameters
self
: An index within some element, from which the offset is computed.by
: The distance by which to jump. Negative values move lower in the index and element-pointer space; positive values move higher.
Returns
.0
: The number of elementsR
by which to adjust a base pointer. This value can be passed directly intoptr::offset
..1
: The index of the destination bit within the destination element.
Computes the span information for a region beginning at self
for len
bits.
The span information is the number of elements in the region that hold live bits, and the position of the tail marker after the live bits.
This forwards to BitTail::span
, as the computation is identical for
the two types. Beginning a span at any Idx
is equivalent to beginning
it at the tail of a previous span.
Parameters
self
: The start bit of the span.len
: The number of bits in the span.
Returns
.0
: The number of elements, starting in the element that containsself
, that contain live bits of the span..1
: The tail counter of the span’s end point.
Trait Implementations
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Auto Trait Implementations
impl<R> RefUnwindSafe for BitIdx<R> where
R: RefUnwindSafe,
impl<R> UnwindSafe for BitIdx<R> where
R: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Causes self
to use its Binary
implementation when Debug
-formatted.
Causes self
to use its Display
implementation when
Debug
-formatted. Read more
Causes self
to use its LowerExp
implementation when
Debug
-formatted. Read more
Causes self
to use its LowerHex
implementation when
Debug
-formatted. Read more
Causes self
to use its Octal
implementation when Debug
-formatted.
Causes self
to use its Pointer
implementation when
Debug
-formatted. Read more
Causes self
to use its UpperExp
implementation when
Debug
-formatted. Read more
Causes self
to use its UpperHex
implementation when
Debug
-formatted. Read more
Pipes by value. This is generally the method you want to use. Read more
Borrows self
and passes that borrow into the pipe function. Read more
Mutably borrows self
and passes that borrow into the pipe function. Read more
Borrows self
, then passes self.borrow()
into the pipe function. Read more
Mutably borrows self
, then passes self.borrow_mut()
into the pipe
function. Read more
Borrows self
, then passes self.as_ref()
into the pipe function.
Mutably borrows self
, then passes self.as_mut()
into the pipe
function. Read more
Borrows self
, then passes self.deref()
into the pipe function.
fn pipe_as_ref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: AsRef<T>,
T: 'a,
R: 'a,
fn pipe_as_ref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: AsRef<T>,
T: 'a,
R: 'a,
Pipes a trait borrow into a function that cannot normally be called in suffix position. Read more
fn pipe_borrow<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Borrow<T>,
T: 'a,
R: 'a,
fn pipe_borrow<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Borrow<T>,
T: 'a,
R: 'a,
Pipes a trait borrow into a function that cannot normally be called in suffix position. Read more
fn pipe_deref<'a, R>(&'a self, func: impl FnOnce(&'a Self::Target) -> R) -> R where
Self: Deref,
R: 'a,
fn pipe_deref<'a, R>(&'a self, func: impl FnOnce(&'a Self::Target) -> R) -> R where
Self: Deref,
R: 'a,
Pipes a dereference into a function that cannot normally be called in suffix position. Read more
Pipes a reference into a function that cannot ordinarily be called in suffix position. Read more
Immutable access to the Borrow<B>
of a value. Read more
Mutable access to the BorrowMut<B>
of a value. Read more
Immutable access to the AsRef<R>
view of a value. Read more
Mutable access to the AsMut<R>
view of a value. Read more
Immutable access to the Deref::Target
of a value. Read more
Mutable access to the Deref::Target
of a value. Read more
Calls .tap()
only in debug builds, and is erased in release builds.
Calls .tap_mut()
only in debug builds, and is erased in release
builds. Read more
Calls .tap_borrow()
only in debug builds, and is erased in release
builds. Read more
Calls .tap_borrow_mut()
only in debug builds, and is erased in release
builds. Read more
Calls .tap_ref()
only in debug builds, and is erased in release
builds. Read more
Calls .tap_ref_mut()
only in debug builds, and is erased in release
builds. Read more
Calls .tap_deref()
only in debug builds, and is erased in release
builds. Read more
Provides immutable access to the reference for inspection.
Calls tap_ref
in debug builds, and does nothing in release builds.
Provides mutable access to the reference for modification.
Calls tap_ref_mut
in debug builds, and does nothing in release builds.
Provides immutable access to the borrow for inspection. Read more
Calls tap_borrow
in debug builds, and does nothing in release builds.
fn tap_borrow_mut<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
fn tap_borrow_mut<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
Provides mutable access to the borrow for modification.
Immutably dereferences self
for inspection.
fn tap_deref_dbg<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
fn tap_deref_dbg<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
Calls tap_deref
in debug builds, and does nothing in release builds.
fn tap_deref_mut<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
fn tap_deref_mut<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
Mutably dereferences self
for modification.