FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
python-docs-de/howto/sorting.po at sync-upstream-3.14 · python/python-docs-de · GitHub
python
python-docs-de
Repository navigation
Code
Issues
Pull requests
2
(2)
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
python-docs-de
/
howto
/
sorting.po
Copy path
More file actions
More file actions
Latest commit
History
History
History
631 lines (539 loc) · 19 KB
Breadcrumbs
python-docs-de
/
howto
/
sorting.po
Copy path
File metadata and controls
631 lines (539 loc) · 19 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
#
SOME DESCRIPTIVE TITLE.
#
Copyright (C) 2001 Python Software Foundation
#
This file is distributed under the same license as the Python package.
#
FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
#,
fuzzy
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.14\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2026-09-05 16:53+0200\n
"
"
PO-Revision-Date
:
2025-09-16 00:00+0000\n
"
"
Language-Team
:
German (https://app.transifex.com/python-doc/teams/5390/de/)\n
"
"
Language
:
de\n
"
"
MIME-Version
:
1.0\n
"
"
Content-Type
:
text/plain; charset=UTF-8\n
"
"
Content-Transfer-Encoding
:
8bit\n
"
"
Plural-Forms
:
nplurals=2; plural=(n != 1);\n
"
#:
../../howto/sorting.rst:4
msgid
"Sorting Techniques"
msgstr
""
#:
../../howto/sorting.rst:0
msgid
"Author"
msgstr
""
#:
../../howto/sorting.rst:6
msgid
"Andrew Dalke and Raymond Hettinger"
msgstr
""
#:
../../howto/sorting.rst:9
msgid
""
"Python lists have a built-in :meth:`list.sort` method that modifies the list "
"in-place. There is also a :func:`sorted` built-in function that builds a "
"new sorted list from an iterable."
msgstr
""
#:
../../howto/sorting.rst:13
msgid
""
"In this document, we explore the various techniques for sorting data using "
"Python."
msgstr
""
#:
../../howto/sorting.rst:17
msgid
"Sorting Basics"
msgstr
""
#:
../../howto/sorting.rst:19
msgid
""
"A simple ascending sort is very easy: just call the :func:`sorted` function. "
"It returns a new sorted list:"
msgstr
""
#:
../../howto/sorting.rst:22
msgid
""
">>> sorted([5, 2, 3, 1, 4])\n"
"[1, 2, 3, 4, 5]"
msgstr
""
#:
../../howto/sorting.rst:27
msgid
""
"You can also use the :meth:`list.sort` method. It modifies the list in-place "
"(and returns ``None`` to avoid confusion). Usually it's less convenient "
"than :func:`sorted` - but if you don't need the original list, it's slightly "
"more efficient."
msgstr
""
#:
../../howto/sorting.rst:32
msgid
""
">>> a = [5, 2, 3, 1, 4]\n"
">>> a.sort()\n"
">>> a\n"
"[1, 2, 3, 4, 5]"
msgstr
""
#:
../../howto/sorting.rst:39
msgid
""
"Another difference is that the :meth:`list.sort` method is only defined for "
"lists. In contrast, the :func:`sorted` function accepts any iterable."
msgstr
""
#:
../../howto/sorting.rst:42
msgid
""
">>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})\n"
"[1, 2, 3, 4, 5]"
msgstr
""
#:
../../howto/sorting.rst:48
msgid
"Key Functions"
msgstr
""
#:
../../howto/sorting.rst:50
msgid
""
"The :meth:`list.sort` method and the functions :func:`sorted`, :func:`min`, :"
"func:`max`, :func:`heapq.nsmallest`, and :func:`heapq.nlargest` have a *key* "
"parameter to specify a function (or other callable) to be called on each "
"list element prior to making comparisons."
msgstr
""
#:
../../howto/sorting.rst:56
msgid
""
"For example, here's a case-insensitive string comparison using :meth:`str."
"casefold`:"
msgstr
""
#:
../../howto/sorting.rst:59
msgid
""
">>> sorted(
\"
This is a test string from Andrew
\"
.split(), key=str.casefold)\n"
"['a', 'Andrew', 'from', 'is', 'string', 'test', 'This']"
msgstr
""
#:
../../howto/sorting.rst:64
msgid
""
"The value of the *key* parameter should be a function (or other callable) "
"that takes a single argument and returns a key to use for sorting purposes. "
"This technique is fast because the key function is called exactly once for "
"each input record."
msgstr
""
#:
../../howto/sorting.rst:69
msgid
""
"A common pattern is to sort complex objects using some of the object's "
"indices as keys. For example:"
msgstr
""
#:
../../howto/sorting.rst:72
msgid
""
">>> student_tuples = [\n"
"... ('john', 'A', 15),\n"
"... ('jane', 'B', 12),\n"
"... ('dave', 'B', 10),\n"
"... ]\n"
">>> sorted(student_tuples, key=lambda student: student[2]) # sort by age\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:82
msgid
""
"The same technique works for objects with named attributes. For example:"
msgstr
""
#:
../../howto/sorting.rst:84
msgid
""
">>> class Student:\n"
"... def __init__(self, name, grade, age):\n"
"... self.name = name\n"
"... self.grade = grade\n"
"... self.age = age\n"
"... def __repr__(self):\n"
"... return repr((self.name, self.grade, self.age))\n"
"\n"
">>> student_objects = [\n"
"... Student('john', 'A', 15),\n"
"... Student('jane', 'B', 12),\n"
"... Student('dave', 'B', 10),\n"
"... ]\n"
">>> sorted(student_objects, key=lambda student: student.age) # sort by "
"age\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:102
msgid
""
"Objects with named attributes can be made by a regular class as shown above, "
"or they can be instances of :class:`~dataclasses.dataclass` or a :term:"
"`named tuple`."
msgstr
""
#:
../../howto/sorting.rst:107
msgid
"Operator Module Functions and Partial Function Evaluation"
msgstr
""
#:
../../howto/sorting.rst:109
msgid
""
"The :term:`key function` patterns shown above are very common, so Python "
"provides convenience functions to make accessor functions easier and faster. "
"The :mod:`operator` module has :func:`~operator.itemgetter`, :func:"
"`~operator.attrgetter`, and a :func:`~operator.methodcaller` function."
msgstr
""
#:
../../howto/sorting.rst:114
msgid
"Using those functions, the above examples become simpler and faster:"
msgstr
""
#:
../../howto/sorting.rst:116
msgid
""
">>> from operator import itemgetter, attrgetter\n"
"\n"
">>> sorted(student_tuples, key=itemgetter(2))\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]\n"
"\n"
">>> sorted(student_objects, key=attrgetter('age'))\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:126
msgid
""
"The operator module functions allow multiple levels of sorting. For example, "
"to sort by *grade* then by *age*:"
msgstr
""
#:
../../howto/sorting.rst:129
msgid
""
">>> sorted(student_tuples, key=itemgetter(1,2))\n"
"[('john', 'A', 15), ('dave', 'B', 10), ('jane', 'B', 12)]\n"
"\n"
">>> sorted(student_objects, key=attrgetter('grade', 'age'))\n"
"[('john', 'A', 15), ('dave', 'B', 10), ('jane', 'B', 12)]"
msgstr
""
#:
../../howto/sorting.rst:137
msgid
""
"The :mod:`functools` module provides another helpful tool for making key-"
"functions. The :func:`~functools.partial` function can reduce the `arity "
"<https://en.wikipedia.org/wiki/Arity>`_ of a multi-argument function making "
"it suitable for use as a key-function."
msgstr
""
#:
../../howto/sorting.rst:142
msgid
""
">>> from functools import partial\n"
">>> from unicodedata import normalize\n"
"\n"
">>> names = 'Zoë Åbjørn Núñez Élana Zeke Abe Nubia Eloise'.split()\n"
"\n"
">>> sorted(names, key=partial(normalize, 'NFD'))\n"
"['Abe', 'Åbjørn', 'Eloise', 'Élana', 'Nubia', 'Núñez', 'Zeke', 'Zoë']\n"
"\n"
">>> sorted(names, key=partial(normalize, 'NFC'))\n"
"['Abe', 'Eloise', 'Nubia', 'Núñez', 'Zeke', 'Zoë', 'Åbjørn', 'Élana']"
msgstr
""
#:
../../howto/sorting.rst:156
msgid
"Ascending and Descending"
msgstr
""
#:
../../howto/sorting.rst:158
msgid
""
"Both :meth:`list.sort` and :func:`sorted` accept a *reverse* parameter with "
"a boolean value. This is used to flag descending sorts. For example, to get "
"the student data in reverse *age* order:"
msgstr
""
#:
../../howto/sorting.rst:162
msgid
""
">>> sorted(student_tuples, key=itemgetter(2), reverse=True)\n"
"[('john', 'A', 15), ('jane', 'B', 12), ('dave', 'B', 10)]\n"
"\n"
">>> sorted(student_objects, key=attrgetter('age'), reverse=True)\n"
"[('john', 'A', 15), ('jane', 'B', 12), ('dave', 'B', 10)]"
msgstr
""
#:
../../howto/sorting.rst:171
msgid
"Sort Stability and Complex Sorts"
msgstr
""
#:
../../howto/sorting.rst:173
msgid
""
"Sorts are guaranteed to be `stable <https://en.wikipedia.org/wiki/"
"Sorting_algorithm#Stability>`_
\\
. That means that when multiple records have "
"the same key, their original order is preserved."
msgstr
""
#:
../../howto/sorting.rst:177
msgid
""
">>> data = [('red', 1), ('blue', 1), ('red', 2), ('blue', 2)]\n"
">>> sorted(data, key=itemgetter(0))\n"
"[('blue', 1), ('blue', 2), ('red', 1), ('red', 2)]"
msgstr
""
#:
../../howto/sorting.rst:183
msgid
""
"Notice how the two records for *blue* retain their original order so that "
"``('blue', 1)`` is guaranteed to precede ``('blue', 2)``."
msgstr
""
#:
../../howto/sorting.rst:186
msgid
""
"This wonderful property lets you build complex sorts in a series of sorting "
"steps. For example, to sort the student data by descending *grade* and then "
"ascending *age*, do the *age* sort first and then sort again using *grade*:"
msgstr
""
#:
../../howto/sorting.rst:190
msgid
""
">>> s = sorted(student_objects, key=attrgetter('age')) # sort on "
"secondary key\n"
">>> sorted(s, key=attrgetter('grade'), reverse=True) # now sort on "
"primary key, descending\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:196
msgid
""
"This can be abstracted out into a wrapper function that can take a list and "
"tuples of field and order to sort them on multiple passes."
msgstr
""
#:
../../howto/sorting.rst:199
msgid
""
">>> def multisort(xs, specs):\n"
"... for key, reverse in reversed(specs):\n"
"... xs.sort(key=attrgetter(key), reverse=reverse)\n"
"... return xs\n"
"\n"
">>> multisort(list(student_objects), (('grade', True), ('age', False)))\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:209
msgid
""
"The `Timsort <https://en.wikipedia.org/wiki/Timsort>`_ algorithm used in "
"Python does multiple sorts efficiently because it can take advantage of any "
"ordering already present in a dataset."
msgstr
""
#:
../../howto/sorting.rst:214
msgid
"Decorate-Sort-Undecorate"
msgstr
""
#:
../../howto/sorting.rst:216
msgid
"This idiom is called Decorate-Sort-Undecorate after its three steps:"
msgstr
""
#:
../../howto/sorting.rst:218
msgid
""
"First, the initial list is decorated with new values that control the sort "
"order."
msgstr
""
#:
../../howto/sorting.rst:220
msgid
"Second, the decorated list is sorted."
msgstr
""
#:
../../howto/sorting.rst:222
msgid
""
"Finally, the decorations are removed, creating a list that contains only the "
"initial values in the new order."
msgstr
""
#:
../../howto/sorting.rst:225
msgid
""
"For example, to sort the student data by *grade* using the DSU approach:"
msgstr
""
#:
../../howto/sorting.rst:227
msgid
""
">>> decorated = [(student.grade, i, student) for i, student in "
"enumerate(student_objects)]\n"
">>> decorated.sort()\n"
">>> [student for grade, i, student in decorated] # undecorate\n"
"[('john', 'A', 15), ('jane', 'B', 12), ('dave', 'B', 10)]"
msgstr
""
#:
../../howto/sorting.rst:234
msgid
""
"This idiom works because tuples are compared lexicographically; the first "
"items are compared; if they are the same then the second items are compared, "
"and so on."
msgstr
""
#:
../../howto/sorting.rst:238
msgid
""
"It is not strictly necessary in all cases to include the index *i* in the "
"decorated list, but including it gives two benefits:"
msgstr
""
#:
../../howto/sorting.rst:241
msgid
""
"The sort is stable -- if two items have the same key, their order will be "
"preserved in the sorted list."
msgstr
""
#:
../../howto/sorting.rst:244
msgid
""
"The original items do not have to be comparable because the ordering of the "
"decorated tuples will be determined by at most the first two items. So for "
"example the original list could contain complex numbers which cannot be "
"sorted directly."
msgstr
""
#:
../../howto/sorting.rst:249
msgid
""
"Another name for this idiom is `Schwartzian transform <https://en.wikipedia."
"org/wiki/Schwartzian_transform>`_
\\
, after Randal L. Schwartz, who "
"popularized it among Perl programmers."
msgstr
""
#:
../../howto/sorting.rst:253
msgid
""
"Now that Python sorting provides key-functions, this technique is not often "
"needed."
msgstr
""
#:
../../howto/sorting.rst:256
msgid
"Comparison Functions"
msgstr
""
#:
../../howto/sorting.rst:258
msgid
""
"Unlike key functions that return an absolute value for sorting, a comparison "
"function computes the relative ordering for two inputs."
msgstr
""
#:
../../howto/sorting.rst:261
msgid
""
"For example, a `balance scale <https://upload.wikimedia.org/wikipedia/"
"commons/1/17/Balance_à_tabac_1850.JPG>`_ compares two samples giving a "
"relative ordering: lighter, equal, or heavier. Likewise, a comparison "
"function such as ``cmp(a, b)`` will return a negative value for less-than, "
"zero if the inputs are equal, or a positive value for greater-than."
msgstr
""
#:
../../howto/sorting.rst:268
msgid
""
"It is common to encounter comparison functions when translating algorithms "
"from other languages. Also, some libraries provide comparison functions as "
"part of their API. For example, :func:`locale.strcoll` is a comparison "
"function."
msgstr
""
#:
../../howto/sorting.rst:272
msgid
""
"To accommodate those situations, Python provides :class:`functools."
"cmp_to_key` to wrap the comparison function to make it usable as a key "
"function::"
msgstr
""
#:
../../howto/sorting.rst:276
msgid
"sorted(words, key=cmp_to_key(strcoll)) # locale-aware sort order"
msgstr
""
#:
../../howto/sorting.rst:279
msgid
"Strategies For Unorderable Types and Values"
msgstr
""
#:
../../howto/sorting.rst:281
msgid
""
"A number of type and value issues can arise when sorting. Here are some "
"strategies that can help:"
msgstr
""
#:
../../howto/sorting.rst:284
msgid
"Convert non-comparable input types to strings prior to sorting:"
msgstr
""
#:
../../howto/sorting.rst:286
msgid
""
">>> data = ['twelve', '11', 10]\n"
">>> sorted(map(str, data))\n"
"['10', '11', 'twelve']"
msgstr
""
#:
../../howto/sorting.rst:292
msgid
""
"This is needed because most cross-type comparisons raise a :exc:`TypeError`."
msgstr
""
#:
../../howto/sorting.rst:295
msgid
"Remove special values prior to sorting:"
msgstr
""
#:
../../howto/sorting.rst:297
msgid
""
">>> from math import isnan\n"
">>> from itertools import filterfalse\n"
">>> data = [3.3, float('nan'), 1.1, 2.2]\n"
">>> sorted(filterfalse(isnan, data))\n"
"[1.1, 2.2, 3.3]"
msgstr
""
#:
../../howto/sorting.rst:305
msgid
""
"This is needed because the `IEEE-754 standard <https://en.wikipedia.org/wiki/"
"IEEE_754>`_ specifies that,
\"
Every NaN shall compare unordered with "
"everything, including itself.
\"
"
msgstr
""
#:
../../howto/sorting.rst:309
msgid
"Likewise, ``None`` can be stripped from datasets as well:"
msgstr
""
#:
../../howto/sorting.rst:311
msgid
""
">>> data = [3.3, None, 1.1, 2.2]\n"
">>> sorted(x for x in data if x is not None)\n"
"[1.1, 2.2, 3.3]"
msgstr
""
#:
../../howto/sorting.rst:317
msgid
"This is needed because ``None`` is not comparable to other types."
msgstr
""
#:
../../howto/sorting.rst:319
msgid
"Convert mapping types into sorted item lists before sorting:"
msgstr
""
#:
../../howto/sorting.rst:321
msgid
""
">>> data = [{'a': 1}, {'b': 2}]\n"
">>> sorted(data, key=lambda d: sorted(d.items()))\n"
"[{'a': 1}, {'b': 2}]"
msgstr
""
#:
../../howto/sorting.rst:327
msgid
""
"This is needed because dict-to-dict comparisons raise a :exc:`TypeError`."
msgstr
""
#:
../../howto/sorting.rst:330
msgid
"Convert set types into sorted lists before sorting:"
msgstr
""
#:
../../howto/sorting.rst:332
msgid
""
">>> data = [{'a', 'b', 'c'}, {'b', 'c', 'd'}]\n"
">>> sorted(map(sorted, data))\n"
"[['a', 'b', 'c'], ['b', 'c', 'd']]"
msgstr
""
#:
../../howto/sorting.rst:338
msgid
""
"This is needed because the elements contained in set types do not have a "
"deterministic order. For example, ``list({'a', 'b'})`` may produce either "
"``['a', 'b']`` or ``['b', 'a']``."
msgstr
""
#:
../../howto/sorting.rst:343
msgid
"Odds and Ends"
msgstr
""
#:
../../howto/sorting.rst:345
msgid
""
"For locale aware sorting, use :func:`locale.strxfrm` for a key function or :"
"func:`locale.strcoll` for a comparison function. This is necessary because "
"
\"
alphabetical
\"
sort orderings can vary across cultures even if the "
"underlying alphabet is the same."
msgstr
""
#:
../../howto/sorting.rst:350
msgid
""
"The *reverse* parameter still maintains sort stability (so that records with "
"equal keys retain the original order). Interestingly, that effect can be "
"simulated without the parameter by using the builtin :func:`reversed` "
"function twice:"
msgstr
""
#:
../../howto/sorting.rst:355
msgid
""
">>> data = [('red', 1), ('blue', 1), ('red', 2), ('blue', 2)]\n"
">>> standard_way = sorted(data, key=itemgetter(0), reverse=True)\n"
">>> double_reversed = list(reversed(sorted(reversed(data), "
"key=itemgetter(0))))\n"
">>> assert standard_way == double_reversed\n"
">>> standard_way\n"
"[('red', 1), ('red', 2), ('blue', 1), ('blue', 2)]"
msgstr
""
#:
../../howto/sorting.rst:364
msgid
""
"The sort routines use ``<`` when making comparisons between two objects. So, "
"it is easy to add a standard sort order to a class by defining an :meth:"
"`~object.__lt__` method:"
msgstr
""
#:
../../howto/sorting.rst:368
msgid
""
">>> Student.__lt__ = lambda self, other: self.age < other.age\n"
">>> sorted(student_objects)\n"
"[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]"
msgstr
""
#:
../../howto/sorting.rst:374
msgid
""
"However, note that ``<`` can fall back to using :meth:`~object.__gt__` if :"
"meth:`~object.__lt__` is not implemented (see :func:`object.__lt__` for "
"details on the mechanics). To avoid surprises, :pep:`8` recommends that all "
"six comparison methods be implemented. The :deco:`~functools.total_ordering` "
"decorator is provided to make that task easier."
msgstr
""
#:
../../howto/sorting.rst:381
msgid
""
"Key functions need not depend directly on the objects being sorted. A key "
"function can also access external resources. For instance, if the student "
"grades are stored in a dictionary, they can be used to sort a separate list "
"of student names:"
msgstr
""
#:
../../howto/sorting.rst:386
msgid
""
">>> students = ['dave', 'john', 'jane']\n"
">>> newgrades = {'john': 'F', 'jane':'A', 'dave': 'C'}\n"
">>> sorted(students, key=newgrades.__getitem__)\n"
"['jane', 'dave', 'john']"
msgstr
""
#:
../../howto/sorting.rst:394
msgid
"Partial Sorts"
msgstr
""
#:
../../howto/sorting.rst:396
msgid
""
"Some applications require only some of the data to be ordered. The standard "
"library provides several tools that do less work than a full sort:"
msgstr
""
#:
../../howto/sorting.rst:399
msgid
""
":func:`min` and :func:`max` return the smallest and largest values, "
"respectively. These functions make a single pass over the input data and "
"require almost no auxiliary memory."
msgstr
""
#:
../../howto/sorting.rst:403
msgid
""
":func:`heapq.nsmallest` and :func:`heapq.nlargest` return the *n* smallest "
"and largest values, respectively. These functions make a single pass over "
"the data keeping only *n* elements in memory at a time. For values of *n* "
"that are small relative to the number of inputs, these functions make far "
"fewer comparisons than a full sort."
msgstr
""
#:
../../howto/sorting.rst:409
msgid
""
":func:`heapq.heappush` and :func:`heapq.heappop` create and maintain a "
"partially sorted arrangement of data that keeps the smallest element at "
"position ``0``. These functions are suitable for implementing priority "
"queues which are commonly used for task scheduling."
msgstr
""
Back
|
FazBrowse Home
|
New Git URL