Enum BitOrder

pub enum BitOrder

Order in which bits are read from a byte

The base-conversion encoding is always little-endian. This means that the least significant byte is always first. However, we can still choose whether, within a byte, this is the most significant or the least significant bit that is first. If the terminology is confusing, testing on an asymmetrical example should be enough to choose the correct value.

Examples

In the following example, we can see that a base with the MostSignificantFirst bit-order has the most significant bit first in the encoded output. In particular, the output is in the same order as the bits in the byte. The opposite happens with the LeastSignificantFirst bit-order. The least significant bit is first and the output is in the reverse order.

use data_encoding::{BitOrder, Specification};
let mut spec = Specification::new();
spec.symbols.push_str("01");
spec.bit_order = BitOrder::MostSignificantFirst;  // default
let msb = spec.encoding().unwrap();
spec.bit_order = BitOrder::LeastSignificantFirst;
let lsb = spec.encoding().unwrap();
assert_eq!(msb.encode(&[0b01010011]), "01010011");
assert_eq!(lsb.encode(&[0b01010011]), "11001010");

Variants

MostSignificantFirst

Most significant bit first

This is the most common and most intuitive bit-order. In particular, this is the bit-order used by RFC4648 and thus the usual hexadecimal, base64, base32, base64url, and base32hex encodings. This is the default bit-order when specifying a base.

LeastSignificantFirst

Least significant bit first

Examples

DNSCurve base32 uses least significant bit first:

use data_encoding::BASE32_DNSCURVE;
assert_eq!(BASE32_DNSCURVE.encode(&[0x64, 0x88]), "4321");
assert_eq!(BASE32_DNSCURVE.decode(b"4321").unwrap(), vec![0x64, 0x88]);

Trait Implementations

impl Clone for BitOrder

fn clone(&self) -> BitOrder

impl Copy for BitOrder

impl Debug for BitOrder

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Eq for BitOrder

impl PartialEq for BitOrder

fn eq(&self, other: &BitOrder) -> bool

impl StructuralPartialEq for BitOrder

Auto Trait Implementations

impl Freeze for BitOrder

impl RefUnwindSafe for BitOrder

impl Send for BitOrder

impl Sync for BitOrder

impl Unpin for BitOrder

impl UnsafeUnpin for BitOrder

impl UnwindSafe for BitOrder

Blanket Implementations

impl<T> Any for BitOrder where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for BitOrder where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for BitOrder where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for BitOrder where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<T> From<T> for BitOrder

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> ToOwned for BitOrder where T: Clone,

type Owned = T;
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)

impl<T, U> Into<U> for BitOrder where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom<U> for BitOrder where U: Into<T>,

type Error = Infallible;
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for BitOrder where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error;
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>