From 471ed00ae9ccccd2c040b79df04092f0b255f8d7 Mon Sep 17 00:00:00 2001 From: Georg Brandl Date: Fri, 21 May 2010 20:45:12 +0000 Subject: 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 b562558..32e4a73 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'} -- cgit v0.12