From eefd4e033334a2a1d3929d0f7978469e5b5c4e56 Mon Sep 17 00:00:00 2001 From: Rahul Kumaresan Date: Mon, 18 May 2020 07:02:34 +0530 Subject: bpo-39705 : sorted() tutorial example under looping techniques improved (GH-18999) --- Doc/tutorial/datastructures.rst | 15 +++++++++++++++ .../2020-03-14-18-37-06.bpo-39705.nQVqig.rst | 2 ++ 2 files changed, 17 insertions(+) create mode 100644 Misc/NEWS.d/next/Documentation/2020-03-14-18-37-06.bpo-39705.nQVqig.rst diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index 0edb73a..ff4c797 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -614,6 +614,21 @@ To loop over a sequence in sorted order, use the :func:`sorted` function which returns a new sorted list while leaving the source unaltered. :: >>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana'] + >>> for i in sorted(basket): + ... print(i) + ... + apple + apple + banana + orange + orange + pear + +Using :func:`set` on a sequence eliminates duplicate elements. The use of +:func:`sorted` in combination with :func:`set` over a sequence is an idiomatic +way to loop over unique elements of the sequence in sorted order. :: + + >>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana'] >>> for f in sorted(set(basket)): ... print(f) ... diff --git a/Misc/NEWS.d/next/Documentation/2020-03-14-18-37-06.bpo-39705.nQVqig.rst b/Misc/NEWS.d/next/Documentation/2020-03-14-18-37-06.bpo-39705.nQVqig.rst new file mode 100644 index 0000000..3454b92 --- /dev/null +++ b/Misc/NEWS.d/next/Documentation/2020-03-14-18-37-06.bpo-39705.nQVqig.rst @@ -0,0 +1,2 @@ +Tutorial example for sorted() in the Loop Techniques section is given a better explanation. +Also a new example is included to explain sorted()'s basic behavior. \ No newline at end of file -- cgit v0.12