Struct LinearLayout 

pub struct LinearLayout<B: Bound> { /* private fields */ }

A storage layout using a one-dimensional array.

Trait Implementations

impl<B: Clone + Bound> Clone for LinearLayout<B>

fn clone(&self) -> LinearLayout<B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<B: Debug + Bound> Debug for LinearLayout<B>

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

Formats the value using the given formatter.

impl<B: Hash + Bound> Hash for LinearLayout<B>

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<B: Bound> Layout<B> for LinearLayout<B>

fn new(num_variables: usize, default: B) -> Self

Initializes the storage for num_variables clock variables using init as initial bound for all differences.

fn set(&mut self, left: impl AnyClock, right: impl AnyClock, bound: B)

Sets the bound for the clock difference left - right.

fn get(&self, left: impl AnyClock, right: impl AnyClock) -> &B

Retrieves the bound for the clock difference left - right.

impl<B: PartialEq + Bound> PartialEq for LinearLayout<B>

fn eq(&self, other: &LinearLayout<B>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<B: Eq + Bound> Eq for LinearLayout<B>

impl<B: Bound> StructuralPartialEq for LinearLayout<B>