hsm.core.OrderedSet

class OrderedSet

Bases: OrderedDict, MutableSet

Methods

add	Add an element.
clear
copy
discard	Remove an element.
fromkeys	Create a new ordered dictionary with keys from iterable and values set to value.
get	Return the value for key if key is in the dictionary, else default.
isdisjoint	Return True if two sets have a null intersection.
items
keys
move_to_end	Move an existing element to the end (or beginning if last is false).
pop	If the key is not found, return the default if given; otherwise, raise a KeyError.
popitem	Remove and return a (key, value) pair from the dictionary.
remove	Remove an element.
setdefault	Insert key with a value of default if key is not in the dictionary.
update	If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]
values

Attributes

difference
difference_update
intersection
intersection_update
issubset
issuperset
symmetric_difference
symmetric_difference_update
union

__getitem__()

x.__getitem__(y) <==> x[y]

__iter__()

Implement iter(self).

__len__()

Return len(self).

add(elem)

Add an element.

clear() → None.  Remove all items from od.

copy() → a shallow copy of od

discard(elem)

Remove an element. Do not raise an exception if absent.

fromkeys(value=None)

Create a new ordered dictionary with keys from iterable and values set to value.

get(key, default=None, /)

Return the value for key if key is in the dictionary, else default.

isdisjoint(other)

Return True if two sets have a null intersection.

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

move_to_end(key, last=True)

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

pop(key[, default]) → v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem(last=True)

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

remove(value)

Remove an element. If not a member, raise a KeyError.

setdefault(key, default=None)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update([E, ]**F) → None.  Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values() → an object providing a view on D's values