dict insertion order is guaranteed since 3.7 (GH-10431)

(cherry picked from commit 76e8fd7b7ee0b3d18e7df960a2f7d5c3fad5f15d)

Co-authored-by: Andrés Delfino <adelfino@gmail.com>

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 495cfc2c234f75624f51e67ce792093d4be70908..016e56c4bd0b09802d85a877d3bdf6b0ccaf7637 100644 (file)
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -225,7 +225,7 @@ For example::
 .. class:: Counter([iterable-or-mapping])
 
     A :class:`Counter` is a :class:`dict` subclass for counting hashable objects.
-    It is an unordered collection where elements are stored as dictionary keys
+    It is a collection where elements are stored as dictionary keys
     and their counts are stored as dictionary values.  Counts are allowed to be
     any integer value including zero or negative counts.  The :class:`Counter`
     class is similar to bags or multisets in other languages.