From ced2f2d9f938908e5f96016bfa703a5f8fe80d8f Mon Sep 17 00:00:00 2001
From: Georg Brandl <georg@python.org>
Date: Fri, 21 May 2010 20:47:30 +0000
Subject: [PATCH] Recorded merge of revisions 81410 via svnmerge from
 svn+ssh://svn.python.org/python/branches/py3k

........
  r81410 | georg.brandl | 2010-05-21 22:45:12 +0200 (Fr, 21 Mai 2010) | 1 line

  Remove redundant example.
........
---
 Doc/tutorial/datastructures.rst | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index b562558d94..32e4a73361 100644
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -377,10 +377,7 @@ empty dictionary, a data structure that we discuss in the next section.
 
 Here is a brief demonstration::
 
-   >>> basket = {'apple', 'orange', 'apple', 'pear', 'orange', 'banana'}
-   >>> print(basket)
-   {'orange', 'banana', 'pear', 'apple'}
-   >>> fruit = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']
+   >>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']
    >>> fruit = set(basket)               # create a set without duplicates
    >>> fruit
    {'orange', 'pear', 'apple', 'banana'}
-- 
2.40.0