OSet
OSet is a term used in computer science to denote an ordered set, a data structure that combines the uniqueness guarantee of a set with the preservation of element order. An OSet stores each element at most once and yields elements in a defined sequence when iterated, typically reflecting the order in which elements were added. This makes it useful for deduplication tasks where the original ordering must be kept.
Core properties and operations commonly attributed to OSets include: add, remove, and membership tests, with iteration
Typical use cases include removing duplicates while maintaining input order, maintaining a sequence of unique identifiers,
Notes: the term OSet appears in multiple languages and libraries to denote an ordered set, but there