fn append(&mut self, elmts: Vec<u64>, index: u32) -> io::Result<()> {
		for elmt in elmts {
			match self.removed_tmp.binary_search(&(elmt, index)) {
				Ok(_) => continue,
				Err(idx) => {
					self.removed_tmp.insert(idx, (elmt, index));
				}
			}
		}
		Ok(())
	}
/// Append a set of new positions to the remove log. Both adds those
/// positions the ordered in-memory set and to the file.
Append a set of new positions to the remove log. Both adds those
positions the ordered in-memory set and to the file.
Append a set of new positions to the remove log . Both adds those positions the ordered in - memory set and to the file .
fn append(&mut self, elmts: Vec<u64>, index: u32) -> io::Result<()> {
		for elmt in elmts {
			match self.removed_tmp.binary_search(&(elmt, index)) {
				Ok(_) => continue,
				Err(idx) => {
					self.removed_tmp.insert(idx, (elmt, index));
				}
			}
		}
		Ok(())
	}
fn append ( & mut self , elmts : Vec < u64 > , index : u32 ) -> io :: Result < ( ) > { for elmt in elmts { match self . removed_tmp . binary_search ( & ( elmt , index ) ) { Ok ( _ ) => continue , Err ( idx ) => { self . removed_tmp . insert ( idx , ( elmt , index ) ) ; } } } Ok ( ( ) ) }
Append a set of new positions to the remove log.
Append a set of new positions to the remove log .
&mut self
elmts
Vec<u64>
index
u32