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.4.tar.gz
(6.9 kB
view hashes)
Built Distribution
Close
Hashes for proxyorderedset-0.3.4-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8f3f85775fdfdb7a6e4618fc1b677151b0eb1e34383ad587b87b906eccbe2f0c |
|
MD5 | 3e2514393d629f40f2c56d7d8402b002 |
|
BLAKE2b-256 | 21602e8ac3bbd9321b8e3bea32eb3ab63547c69ee5988d5426cb90c3e053bac5 |