From 75b544886bc43aa2aeb49522d9f640af116f97ab Mon Sep 17 00:00:00 2001 From: Raymond Hettinger Date: Thu, 11 Jun 2009 22:08:48 +0000 Subject: [PATCH] Add example of how to do key lookups with bisect(). --- Doc/library/bisect.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index 9364ed82877..eb32354bd31 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -94,8 +94,8 @@ Instead, it is better to search a list of precomputed keys to find the index of the record in question:: >>> data = [('red', 5), ('blue', 1), ('yellow', 8), ('black', 0)] - >>> data.sort(key=lambda r: r[1]) # precomputed list of keys - >>> keys = [r[1] for r in data] + >>> data.sort(key=lambda r: r[1]) + >>> keys = [r[1] for r in data] # precomputed list of keys >>> data[bisect_left(keys, 0)] ('black', 0) >>> data[bisect_left(keys, 1)]