hio.help.decking
keri.help.decking module
Support for Deck class
Module Contents
Classes
Extends deque to support deque access convenience methods .push and .pull |
- class hio.help.decking.Deck(iterable=None, maxlen=None)[source]
Bases:
collections.dequeExtends deque to support deque access convenience methods .push and .pull to remove confusion about which side of the deque to use (left or right).
Extends deque with .push an .pull methods to support a different pattern for access. .push does not allow a value of None to be added to the Deck. This enables retrieval with .pull(emptive=True) which returns None when empty instead of raising IndexError. This allows use of the walrus operator on a pull to both assign and check for empty. For example:
deck.extend([False, “”, []]) # falsy elements but not None stuff = [] while (x := deck.pull(emptive=True)) is not None:
stuff.append(x)
assert stuff == [False, “”, []] assert not deck
Local methods: .push(x) = add x if x is not None to the right side of deque (like append) .pull(x) = remove and return element from left side of deque (like popleft)
Inherited methods from deque: .append(x) = add x to right side of deque .appendleft(x) = add x to left side of deque .clear() = clear all items from deque leaving it a length 0 .count(x) = count the number of deque elements equal to x. .extend(iterable) = append elements of iterable to right side .extendleft(iterable) = append elemets of iterable to left side
(this reverses iterable)
- .pop() = remove and return element from right side
if empty then raise IndexError
- .popleft() = remove and return element from left side
if empty then raise IndexError
- .remove(x) = remove first occurence of x left to right
if not found raise ValueError
.rotate(n) = rotate n steps to right if neg rotate to left
Built in methods supported: len(d) reversed(d) copy.copy(d) copy.deepcopy(d) subscripts d[0] d[-1]
Attributes: .maxlen = maximum size of Deck or None if unbounded