/// Merge another bitfield into this bitfield.
///
/// As a result, this bitfield has all bits set that are set in either bitfield.
///
/// This function only allocates if this bitfield is shorter than the other
/// bitfield, in which case it is resized accordingly to accomodate for all
/// bits of the other bitfield.
Merge another bitfield into this bitfield.
As a result, this bitfield has all bits set that are set in either bitfield.

This function only allocates if this bitfield is shorter than the other
bitfield, in which case it is resized accordingly to accomodate for all
bits of the other bitfield.
Merge another bitfield into this bitfield . As a result this bitfield has all bits set that are set in either bitfield . This function only allocates if this bitfield is shorter than the other bitfield in which case it is resized accordingly to accomodate for all bits of the other bitfield .
pub fn merge(&mut self, other: &Self) -> &mut Self {
		if self.bits.len() < other.bits.len() {
			let new_len = other.bits.len();
			self.bits.resize(new_len, 0);
		}
		for (i, word) in other.bits.iter().enumerate() {
			self.bits[i] |= word;
		}
		self
	}
pub fn merge ( & mut self , other : & Self ) -> & mut Self { if self . bits . len ( ) < other . bits . len ( ) { let new_len = other . bits . len ( ) ; self . bits . resize ( new_len , 0 ) ; } for ( i , word ) in other . bits . iter ( ) . enumerate ( ) { self . bits [ i ] |= word ; } self }
Merge another bitfield into this bitfield.
Merge another bitfield into this bitfield .
&mut self
other
&Self