orderly-set
Orderly set
Install
orderly-set on PyPI
pip
pip install orderly-setuv
uv add orderly-setpoetry
poetry add orderly-setPackage facts
| License | not declared (permissive) |
| Python support | supports the current Python release (>=3.8) |
| Install friction | low — pure-Python wheel |
| Runtime dependencies | none |
| Maintenance | aging — 399 days since the last release |
| Last repo commit | |
| First released | |
| Popularity | one of the top 1,000 most-downloaded packages on PyPI (30-day window, as of 2026-08-13) |
| Known vulnerabilities | none known (OSV.dev, checked 2026-08-13) |
Evidence: orderly_set-5.5.0-py3-none-any.whl
About orderly-set
from the package's own PyPI description — quoted content, verbatim
Orderly Set 5.5.0
Orderly Set is a package containing multiple implementations of Ordered Set.
OrderlySet
This implementation keeps the order in all set operations except set difference operations. As a result, it can do set difference operations much faster than other implementations. Still 2X slower than of Python's built-in set.
StableSet
A StableSet is a mutable set that remembers its insertion order. Featuring: Fast O(1) insertion, deletion, iteration and membership testing. But slow O(N) Index Lookup.
StableSetEq
Same as StableSet but the order of items doesn't matter for equality comparisons.
OrderedSet
An OrderedSet is a mutable data structure that is a hybrid of a list and a set. It remembers its insertion order so that every entry has an index that can be looked up. Featuring: O(1) Index lookup, insertion, iteration and membership testing. But slow O(N) Deletion.
SortedSet
SortedSet is basically set but when printed, turned into string, or iterated over, returns the items in alphabetical order.
Installation
pip install orderly-set
Usage examples
An OrderedSet is created and used like a set:
>>> from orderly_set import...
Read as markdown · JSON record · Source repository · Homepage
AI interpretation — verify before relying
AI-generated interpretation of the package facts above; every digit, version, license, or vulnerability id it cites is grounded in the facts already shown on this page
Orderly Set provides multiple ordered set implementations—OrderedSet, StableSet, OrderlySet, and SortedSet—each optimizing different trade-offs between insertion order preservation, index lookup speed, and set operation performance.
Low friction: pure Python wheel with zero runtime dependencies and no compiled components. Repository shows recent activity (last commit 2025-07-10) but maintenance status is aging—399 days since the latest release.
Licensed under MIT (permissive), allowing unrestricted use, modification, and distribution in both open and proprietary projects with minimal obligations.
Usage
pip install orderly-set
from orderly_set import OrderedSet
letters = OrderedSet('abracadabra')
print(letters.index('r')) # 2
print(letters[2]) # 'r'
Requires Python 3.8 or later; supports PyPy.
Verdict: Orderly Set is a stable, dependency-free library offering multiple ordered set variants with different performance profiles. It carries no known vulnerabilities and permissive licensing, but the aging maintenance status (399 days since last release) and small repository footprint (4 stars) suggest limited active development—suitable for projects needing specific ordered-set trade-offs but not for those requiring frequent updates.
Needs verification
- Whether the package is actively maintained or in maintenance-only mode despite recent repository commits
- Real-world usage patterns and adoption beyond the top-1000 tier classification
Similar packages
permissive · top 1,000 on PyPI
pyroaringpermissive · top 1,000 on PyPI
sortedcontainerspermissive · top 1,000 on PyPI
jsonrefpermissive · top 1,000 on PyPI
cleopermissive · top 1,000 on PyPI
pathablepermissive · top 1,000 on PyPI
multidictpermissive · top 100 on PyPI
cryptographypermissive · top 100 on PyPI
more-itertoolspermissive · top 1,000 on PyPI
regexpermissive · top 100 on PyPI