pub fn range(
		self,
		upto: BitEnd<R>,
	) -> impl Iterator<Item = Self>
	+ DoubleEndedIterator
	+ ExactSizeIterator
	+ FusedIterator {
		let (from, upto) = (self.into_inner(), upto.into_inner());
		debug_assert!(from <= upto, "Ranges must run from low to high");
		(from .. upto).map(|val| unsafe { Self::new_unchecked(val) })
	}
/// 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 heterogeneous 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`.
///
/// [`RangeBounds`]: core::ops::RangeBounds
/// [`Range<BitIdx<R>>`]: core::ops::Range
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 heterogeneous ranges are
not supported, this must be an opaque iterator rather than a direct
[`Range>`].
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 heterogeneous ranges are not supported this must be an opaque iterator rather than a direct [ ` Range > ` ] .
pub fn range(
		self,
		upto: BitEnd<R>,
	) -> impl Iterator<Item = Self>
	+ DoubleEndedIterator
	+ ExactSizeIterator
	+ FusedIterator {
		let (from, upto) = (self.into_inner(), upto.into_inner());
		debug_assert!(from <= upto, "Ranges must run from low to high");
		(from .. upto).map(|val| unsafe { Self::new_unchecked(val) })
	}
pub fn range ( self , upto : BitEnd < R > , ) -> impl Iterator < Item = Self > + DoubleEndedIterator + ExactSizeIterator + FusedIterator { let ( from , upto ) = ( self . into_inner ( ) , upto . into_inner ( ) ) ; debug_assert ! ( from upto " " ) ; ( from .. upto ) . map ( | val | unsafe { Self :: new_unchecked ( val ) } ) }
Iterates over all indices between an inclusive start and exclusive end
point.
Iterates over all indices between an inclusive start and exclusive end point .
self
upto
BitEnd<R>
An opaque iterator that is equivalent to the range `from .. upto`.
An opaque iterator that is equivalent to the range ` from .. upto ` .
self
upto
BitEnd<R>
The exclusive high bound of the range. The iterator will halt
before yielding an index of this value.
The exclusive high bound of the range . The iterator will halt before yielding an index of this value .
from
The inclusive low bound of the range. This will be the first
index produced by the iterator.
The inclusive low bound of the range . This will be the first index produced by the iterator .
requirements
`from` must be no greater than `upto`.

[`RangeBounds`]: core::ops::RangeBounds
[`Range>`]: core::ops::Range
` from ` must be no greater than ` upto ` . [ ` RangeBounds ` ] : core :: ops :: RangeBounds [ ` Range > ` ] : core :: ops :: Range