pub fn lookup_peeked_data<'l>(&'l self, bit_count :u8, peeked_data :u32)
			-> PeekedDataLookupResult<'l> {
		if bit_count > 8 {
			panic!("Bit count {} larger than allowed 8", bit_count);
		}
		use self::UnrolledLookupEntry::*;
		use self::PeekedDataLookupResult::*;
		return match self.unrolled_entries[peeked_data as usize] {
			// If cnt_to_remove is bigger than bit_count the result is inconclusive.
			// Return in this case.
			HasEntry(cnt_to_remove, payload) if cnt_to_remove <= bit_count
				=> PayloadFound(cnt_to_remove, payload),
			InconclusiveWithHint(hint)
				=> Iter(8, VorbisHuffmanIter { desc_prog : &self.desc_prog, pos : hint }),
			_
				=> Iter(0, VorbisHuffmanIter { desc_prog : &self.desc_prog, pos : 0 }),
		};
	}
/// Resolves a given number of peeked bits.
///
/// Returns whether the data given is enough to uniquely identify a
/// tree element, or whether only an iterator that's progressed by
/// a given amount can be returned. Also, info is returned about how
/// far the reader can be advanced.
Resolves a given number of peeked bits.
Returns whether the data given is enough to uniquely identify a
tree element, or whether only an iterator that's progressed by
a given amount can be returned. Also, info is returned about how
far the reader can be advanced.
Resolves a given number of peeked bits . Returns whether the data given is enough to uniquely identify a tree element or whether only an iterator that ' s progressed by a given amount can be returned . Also info is returned about how far the reader can be advanced .
pub fn lookup_peeked_data<'l>(&'l self, bit_count :u8, peeked_data :u32)
			-> PeekedDataLookupResult<'l> {
		if bit_count > 8 {
			panic!("Bit count {} larger than allowed 8", bit_count);
		}
		use self::UnrolledLookupEntry::*;
		use self::PeekedDataLookupResult::*;
		return match self.unrolled_entries[peeked_data as usize] {
			// If cnt_to_remove is bigger than bit_count the result is inconclusive.
			// Return in this case.
			HasEntry(cnt_to_remove, payload) if cnt_to_remove <= bit_count
				=> PayloadFound(cnt_to_remove, payload),
			InconclusiveWithHint(hint)
				=> Iter(8, VorbisHuffmanIter { desc_prog : &self.desc_prog, pos : hint }),
			_
				=> Iter(0, VorbisHuffmanIter { desc_prog : &self.desc_prog, pos : 0 }),
		};
	}
pub fn lookup_peeked_data < ' l > ( & ' l self , bit_count : u8 , peeked_data : u32 ) -> PeekedDataLookupResult < ' l > { if bit_count > 8 { panic ! ( " " bit_count ) ; } use self :: UnrolledLookupEntry :: * ; use self :: PeekedDataLookupResult :: * ; return match self . unrolled_entries [ peeked_data as usize ] { // If cnt_to_remove is bigger than bit_count the result is inconclusive. // Return in this case. HasEntry ( cnt_to_remove , payload ) if cnt_to_remove <= bit_count => PayloadFound ( cnt_to_remove , payload ) , InconclusiveWithHint ( hint ) => Iter ( 8 , VorbisHuffmanIter { desc_prog : & self . desc_prog , pos : hint } ) , _ => Iter ( 0 , VorbisHuffmanIter { desc_prog : & self . desc_prog , pos : 0 } ) , } ; }
Resolves a given number of peeked bits.
Resolves a given number of peeked bits .
&'l self
bit_count
u8
peeked_data
u32
&'l self
bit_count
u8
peeked_data
u32