A MutableSet that remembers its order, so that every entry has an index.
An OrderedSet is a custom MutableSet that remembers its order, so that every entry has an index that can be looked up.
Based on a recipe originally posted to ActiveState Recipes by Raymond Hettiger, and released under the MIT license:
This module's changes are as follows:
Changed the content from a doubly-linked list to a regular Python list. The ActiveState version has O(N) lookups by index and O(1) deletion; this version has O(1) lookups by index and O(N) deletion, which seems more useful in most cases.
add()returns the index of the added item
index()just returns the index of an item
__setstate__so it can be pickled
index()can be passed lists or arrays, looking up all the elements in them to perform NumPy-like "fancy indexing"
The class implements the abstract base classes
Tested on Python 2.7, 3.3, 3.4, 3.5, PyPy, and PyPy3.
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size ordered-set-3.0.0.tar.gz (7.2 kB)||File type Source||Python version None||Upload date||Hashes View|