Struct Strip 

pub struct Strip<Id> { /* private fields */ }

An ordered set of tabs, one of them active.

Id is whatever names a tab to its owner — a counter, a path, a layout member. Identity is PartialEq, so an id that compares equal to one already in the strip is the same tab.

A strip with tabs in it always has one in front: Self::active is None only while Self::is_empty.

Implementations

impl<Id: Clone + PartialEq> Strip<Id>

pub fn new() -> Self

pub fn tabs(&self) -> &[Id]

The tabs, left to right.

pub fn active(&self) -> Option<&Id>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains(&self, id: &Id) -> bool

pub fn index_of(&self, id: &Id) -> Option<usize>

pub fn open(&mut self, id: Id)

Bring id to the front, adding it at the end of the strip if it is not already there. An id that is there keeps its place.

pub fn activate(&mut self, id: &Id) -> bool

Bring an existing tab to the front. false, and nothing moves, when it is not in the strip.

pub fn close(&mut self, id: &Id) -> bool

Take a tab out. false when it was not in the strip.

Closing the tab in front hands the front to its right-hand neighbour, or to the new last tab when it had none. Closing any other tab leaves the front where it is.

pub fn cycle(&mut self, step: isize)

Step the front step tabs along, wrapping at both ends. An empty strip does not move.

pub fn reorder(&mut self, from: usize, to: usize)

Move the tab at from so that it sits at to. Out-of-range ends are ignored rather than clamped: a drag that left the strip did not mean the last slot.

The front is held by identity, so reordering never changes which tab is in front.

pub fn carry( &mut self, id: &Id, travel: f32, width: impl Fn(&Id) -> Option<f32>, ) -> (Vec<Id>, f32)

Carry id travel pixels along the strip from its slot, positive to the right, passing every neighbour whose centre its own centre crosses.

Returns the tabs passed, in the order passed, and the travel left over past the new slot. width measures a tab; a tab it cannot measure is not passed, and neither is anything beyond it.

Trait Implementations

impl<Id: Clone> Clone for Strip<Id>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Id: Debug> Debug for Strip<Id>

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

Formats the value using the given formatter.

impl<Id> Default for Strip<Id>

fn default() -> Self

Returns the “default value” for a type.

impl<Id: Eq> Eq for Strip<Id>

impl<Id: Clone + PartialEq> FromIterator<Id> for Strip<Id>

fn from_iter<T: IntoIterator<Item = Id>>(iter: T) -> Self

The first of the run is the one in front.

impl<Id: PartialEq> PartialEq for Strip<Id>

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

Equality operator ==.

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

Inequality operator !=.

impl<Id: PartialEq> StructuralPartialEq for Strip<Id>