A simple implementation of ordered sets as a proxy to Python's standard dict class.
Project description
(Proxy-) OrderedSet
A simple implementation of ordered sets as a proxy to Python's standard dict class.
The implementation is based on the idea to take a base
iterable and create a dict using dict.fromkeys(base)
. Keys
are unique, and in newer versions of Python, the order is kept; values are None
and ignored.
This package has no external dependencies. The OrderedSet class overwrites all set
methods.
Example
from orderedset import OrderedSet
s: OrderedSet[int] = OrderedSet([3, 1, 4, 1])
list(s) # yields [3, 1, 4]
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
proxyorderedset-0.3.1.tar.gz
(4.5 kB
view hashes)
Built Distribution
Close
Hashes for proxyorderedset-0.3.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3d0cc23f245a336deabf4343fcd4e2e6d14c4eed03b6501440646aa0edbad855 |
|
MD5 | cc8a7b3281114c5ec6a4b7f79f53fcad |
|
BLAKE2b-256 | 870d22f6e87e8d3713905b77131dd287e6cbfd3366f6ff394229dc6c58ab06f2 |