diff options
author | Jos Verlinde <josverl@microsoft.com> | 2021-07-12 17:47:49 +0200 |
---|---|---|
committer | Damien George <damien@micropython.org> | 2022-02-09 15:00:00 +1100 |
commit | a41abd94dcbb5c36cd3a66ae000fa02634472a6c (patch) | |
tree | 01d5204cb1f0d276d5d37fe0104f841ddb0d4d8e | |
parent | 30a022548fcd20bf956789185e1481edb0f0acfc (diff) | |
download | micropython-a41abd94dcbb5c36cd3a66ae000fa02634472a6c.tar.gz micropython-a41abd94dcbb5c36cd3a66ae000fa02634472a6c.zip |
docs/library/collections.rst: Use class for deque and OrderedDict.
-rw-r--r-- | docs/library/collections.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/library/collections.rst b/docs/library/collections.rst index 21f06fded7..6cf2c096ff 100644 --- a/docs/library/collections.rst +++ b/docs/library/collections.rst @@ -12,7 +12,7 @@ hold/accumulate various objects. Classes ------- -.. function:: deque(iterable, maxlen[, flags]) +.. class:: deque(iterable, maxlen[, flags]) 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 @@ -57,7 +57,7 @@ Classes print(t1.name) assert t2.name == t2[1] -.. function:: OrderedDict(...) +.. class:: OrderedDict(...) ``dict`` type subclass which remembers and preserves the order of keys added. When ordered dict is iterated over, keys/items are returned in |