[−][src]Struct hilbert::interleaver::Interleaver
Precompute some intermediate values and lookup tables that are needed
when interleaving a vector to form the bytes that will be built into a BigUint
Hilbert Index.
This structure maps each bit from each u32 dimension in the input to a corresponding bit and byte in the output.
Note: The goal of this class was to speed up the Hilbert transformation. Benchmarks show no detectable improvement.
Methods
impl Interleaver
[src]
pub fn new(dimensions: usize, bit_depth: usize) -> Self
[src]
pub fn interleave(&self, vector: &[u32]) -> Vec<u8>
[src]
Interleave the bits from the vector into and return an array of bytes in big-endian order. These bytes are suitable to be combined into a single BigUint.
Auto Trait Implementations
impl Send for Interleaver
impl Sync for Interleaver
impl Unpin for Interleaver
impl UnwindSafe for Interleaver
impl RefUnwindSafe for Interleaver
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From<T> for T
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,