Struct M256 

pub struct M256(/* private fields */);

A 256-bit block of bits.

Word 0 holds the lowest bits.

Implementations

impl M256

pub const fn from_words(words: [u64; 4]) -> Self

A block from its words, lowest bits first.

pub const fn to_words(self) -> [u64; 4]

The words of the block, lowest bits first.

Trait Implementations

impl Clone for M256

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for M256

impl Debug for M256

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

Formats the value using the given formatter.

impl Default for M256

fn default() -> Self

Returns the “default value” for a type.

impl Divisible<M128> for M256

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Divisible<M256> for M512

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Divisible<u8> for M256

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Divisible<u16> for M256

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Divisible<u32> for M256

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Divisible<u64> for M256

const RATIO: usize

How many narrow blocks fit in one wide block.

fn parts(&self) -> &[Narrow]

The narrow blocks this one is made of, lowest bits first.

fn parts_mut(&mut self) -> &mut [Narrow]

The narrow blocks this one is made of, lowest bits first.

fn split_slice(slice: &[Self]) -> &[Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

fn split_slice_mut(slice: &mut [Self]) -> &mut [Narrow]

A run of wide blocks read as one run of narrow ones, lowest bits first.

const CHECK_LAYOUT: () = _

What every reinterpretation above rests on, rejected at compile time if it fails.

impl Eq for M256

impl Hash for M256

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for M256

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

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for M256

impl Underlier for M256

const WORDS: usize = 4

How many words make up the block.

const ZERO: Self

Every bit clear.

const ONES: Self

Every bit set.

type Word = u64

The word the block is addressed in.

fn words(&self) -> &[Self::Word]

The words of the block, lowest bits first.

fn words_mut(&mut self) -> &mut [Self::Word]

The words of the block, lowest bits first.

fn from_words_fn(f: impl FnMut(usize) -> Self::Word) -> Self

Build a block word by word, lowest bits first.

fn random<R: Rng + ?Sized>(rng: &mut R) -> Self

A block whose bits are uniformly random and independent.

const BITS: usize = _

Bits in the whole block.

fn zip( self, other: Self, op: impl Fn(Self::Word, Self::Word) -> Self::Word, ) -> Self

Combine two blocks word by word.