This is the documentation for the latest development branch of MicroPython and may refer to features that are not available in released versions.

If you are looking for the documentation for a specific release, use the drop-down menu on the left and select the desired version.

collections – Collection and container types.

Collection and container types.

This module implements a subset of the corresponding CPython module, as described below. For more information, refer to the original CPython documentation: collections.

This module implements advanced collection and container types to hold/accumulate various objects.

Classes

`OrderedDict`	`dict` type subclass which remembers and preserves the order of keys
`deque`	Deques (double-ended queues) are a list-like container that support O(1)

Functions

namedtuple(→ stdlib.collections.namedtuple)

This is factory function to create a new namedtuple type with a specific

Module Contents

class collections.OrderedDict(*args, **kwargs)

Bases: stdlib.collections.OrderedDict

dict type subclass which remembers and preserves the order of keys added. When ordered dict is iterated over, keys/items are returned in the order they were added:

from collections import OrderedDict

# To make benefit of ordered keys, OrderedDict should be initialized
# from sequence of (key, value) pairs.
d = OrderedDict([("z", 1), ("a", 2)])
# More items can be added as usual
d["w"] = 5
d["b"] = 3
for k, v in d.items():
    print(k, v)

Output:

z 1
a 2
w 5
b 3

class collections.deque(iterable, maxlen, flags: Any | None = None)

Bases: stdlib.collections.deque

Deques (double-ended queues) are a list-like container that support O(1) appends and pops from either side of the deque. New deques are created using the following arguments:

iterable is an iterable used to populate the deque when it is created. It can be an empty tuple or list to create a deque that is initially empty.

maxlen must be specified and the deque will be bounded to this maximum length. Once the deque is full, any new items added will discard items from the opposite end.

The optional flags can be 1 to check for overflow when adding items.

Deque objects support bool, len, iteration and subscript load and store. They also have the following methods:

append(x) → Incomplete: Add x to the right side of the deque. Raises IndexError if overflow checking is enabled and there is no more room in the queue.

appendleft(x) → Incomplete: Add x to the left side of the deque. Raises IndexError if overflow checking is enabled and there is no more room in the queue.

extend(iterable) → Incomplete: Extend the deque by appending all the items from iterable to the right of the deque. Raises IndexError if overflow checking is enabled and there is no more room in the deque.

pop() → Incomplete: Remove and return an item from the right side of the deque. Raises IndexError if no items are present.

popleft() → Incomplete: Remove and return an item from the left side of the deque. Raises IndexError if no items are present.

collections.namedtuple(name, fields) → stdlib.collections.namedtuple

This is factory function to create a new namedtuple type with a specific name and set of fields. A namedtuple is a subclass of tuple which allows to access its fields not just by numeric index, but also with an attribute access syntax using symbolic field names. Fields is a sequence of strings specifying field names. For compatibility with CPython it can also be a a string with space-separated field named (but this is less efficient). Example of use:

from collections import namedtuple

MyTuple = namedtuple("MyTuple", ("id", "name"))
t1 = MyTuple(1, "foo")
t2 = MyTuple(2, "bar")
print(t1.name)
assert t2.name == t2[1]