pub(crate) fn tail(&self) -> BitEnd<T::Mem> {
		let (head, len) = (self.head(), self.len());
		let (_, tail) = head.span(len);
		tail
	}
/// Computes the tail index for the first dead bit after the live bits.
///
/// # Parameters
///
/// - `&self`
///
/// # Returns
///
/// A `BitEnd` that is the index of the first dead bit after the last live
/// bit in the last element. This will almost always be in the range `1 ..=
/// T::Mem::BITS`.
///
/// It will be zero only when `self` is empty.
Computes the tail index for the first dead bit after the live bits.
Computes the tail index for the first dead bit after the live bits .
pub(crate) fn tail(&self) -> BitEnd<T::Mem> {
		let (head, len) = (self.head(), self.len());
		let (_, tail) = head.span(len);
		tail
	}
pub ( crate ) fn tail ( & self ) -> BitEnd < T :: Mem > { let ( head , len ) = ( self . head ( ) , self . len ( ) ) ; let ( _ , tail ) = head . span ( len ) ; tail }
Computes the tail index for the first dead bit after the live bits.
Computes the tail index for the first dead bit after the live bits .
&self
A `BitEnd` that is the index of the first dead bit after the last live
bit in the last element. This will almost always be in the range `1
T::Mem::BITS`.

It will be zero only when `self` is empty.
A ` BitEnd ` that is the index of the first dead bit after the last live bit in the last element . This will almost always be in the range ` 1 T :: Mem :: BITS ` . It will be zero only when ` self ` is empty .
&self
None