[Python-checkins] dict insertion order is guaranteed since 3.7 (GH-10431)

[Miss Islington (bot)]

https://github.com/python/cpython/commit/317dbb443341a0c99baa5a509b40cb57ddab8a34
commit: 317dbb443341a0c99baa5a509b40cb57ddab8a34
branch: 3.7
author: Miss Islington (bot) <31488909+miss-islington at users.noreply.github.com>
committer: GitHub <noreply at github.com>
date: 2018-11-11T09:02:11-08:00
summary:

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

(cherry picked from commit 76e8fd7b7ee0b3d18e7df960a2f7d5c3fad5f15d)

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

files:
M Doc/library/collections.rst

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 495cfc2c234f..016e56c4bd0b 100644
--- 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.