seq-set 0.0.2

A Set collection that maintains insertion order.
Documentation
  • Coverage
  • 60%
    9 out of 15 items documented0 out of 14 items with examples
  • Size
  • Source code size: 12.31 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 4.3 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 10s Average build duration of successful builds.
  • all releases: 9s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • piot/seq-set
    0 0 0
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • piot

SeqSet

SeqSet is a deterministic and ordered set implementation in Rust that preserves the insertion order of elements. It combines the efficiency of a HashSet for quick element lookups with the ordered iteration provided by a Vec. This makes SeqSet ideal for scenarios where the order of elements is important and predictable, such as maintaining consistent iteration sequences in compilers, serializers, or any application where order matters.

Features

  • Deterministic Ordering: Maintains the order of elements based on their insertion sequence, ensuring consistent iteration order across runs.

  • Efficient Lookups: Utilizes a HashSet internally for O(1) average-case element lookups, ensuring fast performance even with large datasets.

  • Comprehensive API: Provides methods for insertion, removal, retrieval, mutation, iteration, and more, mirroring the familiar HashSet interface.

Installation

Add seq-set to your Cargo.toml dependencies:

[dependencies]
seq-set = "0.0.1"