Skip to content

std::collections::ordered_set

Status: experimental

Sorted set of i64 with binary-search lookups. Re-bind shape on every mutator.

API details and source

The implementation source contains the complete declarations and implementation notes. The table below lists canonical Gossamer call signatures; every item name links directly to its implementation file.

Item Canonical signature or declaration Description
contains fn contains(xs: OrderedSet<i64>, value: i64) -> bool Membership test.
insert fn insert(xs: OrderedSet<i64>, value: i64) -> OrderedSet<i64> Insert (sorted, no duplicates).
len fn len(xs: OrderedSet<i64>) -> i64 Element count.
remove fn remove(xs: OrderedSet<i64>, value: i64) -> OrderedSet<i64> Remove a value.