[Python-checkins] cpython (merge 3.3 -> default): Merge rephrasing with 3.3.
ezio.melotti
python-checkins at python.org
Sat Nov 17 11:07:02 CET 2012
http://hg.python.org/cpython/rev/02a9b1a82185
changeset: 80462:02a9b1a82185
parent: 80458:269498958b97
parent: 80461:8a5a68d988f9
user: Ezio Melotti <ezio.melotti at gmail.com>
date: Sat Nov 17 12:06:44 2012 +0200
summary:
Merge rephrasing with 3.3.
files:
Doc/tutorial/datastructures.rst | 6 +++---
1 files changed, 3 insertions(+), 3 deletions(-)
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -418,7 +418,7 @@
eliminating duplicate entries. Set objects also support mathematical operations
like union, intersection, difference, and symmetric difference.
-Curly braces or the :func:`set` function can be used to create sets. Note: To
+Curly braces or the :func:`set` function can be used to create sets. Note: to
create an empty set you have to use ``set()``, not ``{}``; the latter creates an
empty dictionary, a data structure that we discuss in the next section.
@@ -447,14 +447,14 @@
>>> a ^ b # letters in a or b but not both
{'r', 'd', 'b', 'm', 'z', 'l'}
-Like :ref:`for lists <tut-listcomps>`, there is a set comprehension syntax::
+Similarly to :ref:`list comprehensions <tut-listcomps>`, set comprehensions
+are also supported::
>>> a = {x for x in 'abracadabra' if x not in 'abc'}
>>> a
{'r', 'd'}
-
.. _tut-dictionaries:
Dictionaries
--
Repository URL: http://hg.python.org/cpython
More information about the Python-checkins
mailing list