pub fn range_from(
		from: BitIdx<R>,
	) -> impl Iterator<Item = Self>
	+ DoubleEndedIterator
	+ ExactSizeIterator
	+ FusedIterator {
		(from.idx ..= Self::MAX.end)
			.map(|tail| unsafe { BitEnd::new_unchecked(tail) })
	}
/// Iterates over all tail indices at and after an inclusive starting point.
///
/// Because implementation details of the range type family, including the
/// [`RangeBounds`] trait, are not yet stable, and heterogeneous ranges are
/// not yet supported, this must be an opaque iterator rather than a direct
/// [`Range<BitEnd<R>>`].
///
/// # Parameters
///
/// - `from`: The inclusive low bound of the range. This will be the first
///   tail produced by the iterator.
///
/// # Returns
///
/// An opaque iterator that is equivalent to the range `from ..=
/// Self::MAX`.
///
/// [`RangeBounds`]: core::ops::RangeBounds
/// [`Range<BitEnd<R>>`]: core::ops::Range
Iterates over all tail indices at and after an inclusive starting point.
Because implementation details of the range type family, including the
[`RangeBounds`] trait, are not yet stable, and heterogeneous ranges are
not yet supported, this must be an opaque iterator rather than a direct
[`Range>`].
Iterates over all tail indices at and after an inclusive starting point . Because implementation details of the range type family including the [ ` RangeBounds ` ] trait are not yet stable and heterogeneous ranges are not yet supported this must be an opaque iterator rather than a direct [ ` Range > ` ] .
pub fn range_from(
		from: BitIdx<R>,
	) -> impl Iterator<Item = Self>
	+ DoubleEndedIterator
	+ ExactSizeIterator
	+ FusedIterator {
		(from.idx ..= Self::MAX.end)
			.map(|tail| unsafe { BitEnd::new_unchecked(tail) })
	}
pub fn range_from ( from : BitIdx < R > , ) -> impl Iterator < Item = Self > + DoubleEndedIterator + ExactSizeIterator + FusedIterator { ( from . idx ..= Self :: MAX . end ) . map ( | tail | unsafe { BitEnd :: new_unchecked ( tail ) } ) }
Iterates over all tail indices at and after an inclusive starting point.
Iterates over all tail indices at and after an inclusive starting point .
from
BitIdx<R>
An opaque iterator that is equivalent to the range `from
Self::MAX`.

[`RangeBounds`]: core::ops::RangeBounds
[`Range>`]: core::ops::Range
An opaque iterator that is equivalent to the range ` from Self :: MAX ` . [ ` RangeBounds ` ] : core :: ops :: RangeBounds [ ` Range > ` ] : core :: ops :: Range
from
BitIdx<R>
The inclusive low bound of the range. This will be the first
tail produced by the iterator.
The inclusive low bound of the range . This will be the first tail produced by the iterator .