[ Web Proxy ]
URL:
Viewing:
https://github-redirect.dependabot.com/python/python-docs-pl/blob/3.8/howto/sorting.po
[Back]
[Original]
python-docs-pl/howto/sorting.po at 3.8 python/python-docs-pl GitHub
Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
python
python-docs-pl
Repository navigation
Code
Issues
4
(4)
Pull requests
2
(2)
Actions
Security and quality
Insights
More
items
Files
Expand file tree
3.8
Breadcrumbs
python-docs-pl
/
howto
/
sorting.po
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
283 lines (229 loc) 8.8 KB
3.8
Breadcrumbs
python-docs-pl
/
howto
/
sorting.po
Copy path
Top
File metadata and controls
Code
Blame
283 lines (229 loc) 8.8 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
#
SOME DESCRIPTIVE TITLE.
#
Copyright (C) 2001-2021, Python Software Foundation
#
This file is distributed under the same license as the Python package.
#
FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
#
Translators:
#
Maciej Olko <maciej.olko@gmail.com>, 2020
#
Seweryn Pirkowski <seweryn.piorkowski@gmail.com>, 2020
#
Krzysztof Abramowicz, 2022
#
#,
fuzzy
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.8\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2021-01-01 16:06+0000\n
"
"
PO-Revision-Date
:
2020-05-30 11:55+0000\n
"
"
Last-Translator
:
Krzysztof Abramowicz, 2022\n
"
"
Language-Team
:
Polish (https://www.transifex.com/python-doc/teams/5390/pl/)\n
"
"
MIME-Version
:
1.0\n
"
"
Content-Type
:
text/plain; charset=UTF-8\n
"
"
Content-Transfer-Encoding
:
8bit\n
"
"
Language
:
pl\n
"
"
Plural-Forms
:
nplurals=4; plural=(n==1 ? 0 : (n%10>=2 && n%10<=4) &&
"
"
(n%100<12 || n%100>14) ? 1 : n!=1 && (n%10>=0 && n%10<=1) || (n%10>=5 &&
"
"
n%10<=9) || (n%100>=12 && n%100<=14) ? 2 : 3);\n
"
msgid
"Sorting HOW TO"
msgstr
""
msgid
"Author"
msgstr
"Autor"
msgid
"Andrew Dalke and Raymond Hettinger"
msgstr
""
msgid
"Release"
msgstr
"Wydanie"
msgid
"0.1"
msgstr
""
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
""
msgid
""
"In this document, we explore the various techniques for sorting data using "
"Python."
msgstr
""
msgid
"Sorting Basics"
msgstr
"Podstawy sortowania"
msgid
""
"A simple ascending sort is very easy: just call the :func:`sorted` function. "
"It returns a new sorted list::"
msgstr
""
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
""
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
""
msgid
"Key Functions"
msgstr
""
msgid
""
"Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify "
"a function to be called on each list element prior to making comparisons."
msgstr
""
msgid
"For example, here's a case-insensitive string comparison:"
msgstr
""
msgid
""
"The value of the *key* parameter should be a function 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
""
msgid
""
"A common pattern is to sort complex objects using some of the object's "
"indices as keys. For example:"
msgstr
""
msgid
""
"The same technique works for objects with named attributes. For example:"
msgstr
""
msgid
"Operator Module Functions"
msgstr
""
msgid
""
"The 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
""
msgid
"Using those functions, the above examples become simpler and faster:"
msgstr
""
msgid
""
"The operator module functions allow multiple levels of sorting. For example, "
"to sort by *grade* then by *age*:"
msgstr
""
msgid
"Ascending and Descending"
msgstr
""
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
""
msgid
"Sort Stability and Complex Sorts"
msgstr
""
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
""
msgid
""
"Notice how the two records for *blue* retain their original order so that "
"``('blue', 1)`` is guaranteed to precede ``('blue', 2)``."
msgstr
""
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
""
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
""
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
""
msgid
"The Old Way Using Decorate-Sort-Undecorate"
msgstr
""
msgid
"This idiom is called Decorate-Sort-Undecorate after its three steps:"
msgstr
""
msgid
""
"First, the initial list is decorated with new values that control the sort "
"order."
msgstr
""
msgid
"Second, the decorated list is sorted."
msgstr
"Po drugie, decorated list jest posortowana"
msgid
""
"Finally, the decorations are removed, creating a list that contains only the "
"initial values in the new order."
msgstr
""
"Podsumowujc, dekoratory s usunite, stworzona lista zawiera tylko wartoci "
"pocztkowe, ktrych kolejno jest posortowana."
msgid
""
"For example, to sort the student data by *grade* using the DSU approach:"
msgstr
""
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
""
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
""
msgid
""
"The sort is stable -- if two items have the same key, their order will be "
"preserved in the sorted list."
msgstr
""
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
""
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
""
msgid
""
"Now that Python sorting provides key-functions, this technique is not often "
"needed."
msgstr
""
msgid
"The Old Way Using the *cmp* Parameter"
msgstr
""
msgid
""
"Many constructs given in this HOWTO assume Python 2.4 or later. Before that, "
"there was no :func:`sorted` builtin and :meth:`list.sort` took no keyword "
"arguments. Instead, all of the Py2.x versions supported a *cmp* parameter to "
"handle user specified comparison functions."
msgstr
""
msgid
""
"In Py3.0, the *cmp* parameter was removed entirely (as part of a larger "
"effort to simplify and unify the language, eliminating the conflict between "
"rich comparisons and the :meth:`__cmp__` magic method)."
msgstr
""
msgid
""
"In Py2.x, sort allowed an optional function which can be called for doing "
"the comparisons. That function should take two arguments to be compared and "
"then return a negative value for less-than, return zero if they are equal, "
"or return a positive value for greater-than. For example, we can do:"
msgstr
""
msgid
"Or you can reverse the order of comparison with:"
msgstr
"Lub moesz odwrci kolejno porwnania za pomoc:"
msgid
""
"When porting code from Python 2.x to 3.x, the situation can arise when you "
"have the user supplying a comparison function and you need to convert that "
"to a key function. The following wrapper makes that easy to do::"
msgstr
""
msgid
"To convert to a key function, just wrap the old comparison function:"
msgstr
""
msgid
""
"In Python 3.2, the :func:`functools.cmp_to_key` function was added to the :"
"mod:`functools` module in the standard library."
msgstr
""
msgid
"Odd and Ends"
msgstr
""
msgid
""
"For locale aware sorting, use :func:`locale.strxfrm` for a key function or :"
"func:`locale.strcoll` for a comparison function."
msgstr
""
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
""
msgid
""
"The sort routines are guaranteed to use :meth:`__lt__` when making "
"comparisons between two objects. So, it is easy to add a standard sort order "
"to a class by defining an :meth:`__lt__` method::"
msgstr
""
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
""
Footer
© 2026 GitHub, Inc.
Footer navigation
Terms
Privacy
Security
Status
Community
Docs
Contact
Manage cookies
Do not share my personal information
You cant perform that action at this time.
Web Proxy Viewer |
New URL
|
Original Page