Struct OrderedNames 

pub struct OrderedNames { /* private fields */ }

A set of entity NAMES that remembers the order they were ADDED in — the selection’s pick order.

The selection used to be a plain HashSet, so which of two picked faces came out first was the hash seed’s choice and differed between processes. That is not cosmetic: an assembly Distance takes element 0 as its BASE face, whose outward normal gives the value its sign and the arrow its direction, so the same two picks could seed opposite constraints in two runs. Every reader of the selection — EngineState::selection_json, the context bar’s feature offers, the constraint seeder — now sees the picks in the order they were made.

insert appends, and a name already in the set keeps its place; remove keeps the rest in order. Toggling a name off and on therefore moves it to the END, which is where a re-pick belongs. Membership rides in a HashSet beside the order, because contains is called for every face and every edge of every solid, every frame, by the emphasis colour feed.

Implementations

impl OrderedNames

pub fn insert(&mut self, name: String) -> bool

Add name at the END. Returns whether it was not already there (the HashSet::insert contract), and an already-present name does NOT move.

pub fn remove(&mut self, name: &str) -> bool

Drop name, keeping the order of everything else. Returns whether it was there (the HashSet::remove contract).

pub fn contains(&self, name: &str) -> bool

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, String>

The names in PICK ORDER, oldest first.

Trait Implementations

impl Clone for OrderedNames

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OrderedNames

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

Formats the value using the given formatter.

impl Default for OrderedNames

fn default() -> Self

Returns the “default value” for a type.

impl Eq for OrderedNames

impl Extend<String> for OrderedNames

fn extend<I: IntoIterator<Item = String>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<String> for OrderedNames

fn from_iter<I: IntoIterator<Item = String>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a OrderedNames

type Item = &'a String

The type of the elements being iterated over.

type IntoIter = Iter<'a, String>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for OrderedNames

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OrderedNames