FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
python-docs-ko/howto/sorting.po at 3.6 · python/python-docs-ko · GitHub
python
python-docs-ko
Repository navigation
Code
Issues
377
(377)
Pull requests
1
(1)
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
python-docs-ko
/
howto
/
sorting.po
Copy path
More file actions
More file actions
Latest commit
History
History
History
326 lines (272 loc) · 9.65 KB
Breadcrumbs
python-docs-ko
/
howto
/
sorting.po
Copy path
File metadata and controls
326 lines (272 loc) · 9.65 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
#
SOME DESCRIPTIVE TITLE.
#
Copyright (C) 2001-2017, Python Software Foundation
#
This file is distributed under the same license as the Python package.
#
FIRST AUTHOR <EMAIL@ADDRESS>, 2017.
#
#,
fuzzy
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.6\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2017-11-26 18:49+0900\n
"
"
PO-Revision-Date
:
YEAR-MO-DA HO:MI+ZONE\n
"
"
Last-Translator
:
FULL NAME <EMAIL@ADDRESS>\n
"
"
Language-Team
:
LANGUAGE <LL@li.org>\n
"
"
MIME-Version
:
1.0\n
"
"
Content-Type
:
text/plain; charset=utf-8\n
"
"
Content-Transfer-Encoding
:
8bit\n
"
"
Generated-By
:
Babel 2.5.1\n
"
#:
../Doc/howto/sorting.rst:4
msgid
"Sorting HOW TO"
msgstr
""
#:
../Doc/howto/sorting.rst
msgid
"Author"
msgstr
""
#:
../Doc/howto/sorting.rst:6
msgid
"Andrew Dalke and Raymond Hettinger"
msgstr
""
#:
../Doc/howto/sorting.rst
msgid
"Release"
msgstr
""
#:
../Doc/howto/sorting.rst:7
msgid
"0.1"
msgstr
""
#:
../Doc/howto/sorting.rst:10
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
""
#:
../Doc/howto/sorting.rst:14
msgid
""
"In this document, we explore the various techniques for sorting data "
"using Python."
msgstr
""
#:
../Doc/howto/sorting.rst:18
msgid
"Sorting Basics"
msgstr
""
#:
../Doc/howto/sorting.rst:20
msgid
""
"A simple ascending sort is very easy: just call the :func:`sorted` "
"function. It returns a new sorted list::"
msgstr
""
#:
../Doc/howto/sorting.rst:26
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
""
#:
../Doc/howto/sorting.rst:36
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
""
#:
../Doc/howto/sorting.rst:43
msgid
"Key Functions"
msgstr
""
#:
../Doc/howto/sorting.rst:45
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
""
#:
../Doc/howto/sorting.rst:48
msgid
"For example, here's a case-insensitive string comparison:"
msgstr
""
#:
../Doc/howto/sorting.rst:53
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
""
#:
../Doc/howto/sorting.rst:57
msgid
""
"A common pattern is to sort complex objects using some of the object's "
"indices as keys. For example:"
msgstr
""
#:
../Doc/howto/sorting.rst:68
msgid
"The same technique works for objects with named attributes. For example:"
msgstr
""
#:
../Doc/howto/sorting.rst:87
msgid
"Operator Module Functions"
msgstr
""
#:
../Doc/howto/sorting.rst:89
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
""
#:
../Doc/howto/sorting.rst:94
msgid
"Using those functions, the above examples become simpler and faster:"
msgstr
""
#:
../Doc/howto/sorting.rst:104
msgid
""
"The operator module functions allow multiple levels of sorting. For "
"example, to sort by *grade* then by *age*:"
msgstr
""
#:
../Doc/howto/sorting.rst:114
msgid
"Ascending and Descending"
msgstr
""
#:
../Doc/howto/sorting.rst:116
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
""
#:
../Doc/howto/sorting.rst:127
msgid
"Sort Stability and Complex Sorts"
msgstr
""
#:
../Doc/howto/sorting.rst:129
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
""
#:
../Doc/howto/sorting.rst:137
msgid
""
"Notice how the two records for *blue* retain their original order so that"
" ``('blue', 1)`` is guaranteed to precede ``('blue', 2)``."
msgstr
""
#:
../Doc/howto/sorting.rst:140
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
""
#:
../Doc/howto/sorting.rst:148
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
""
#:
../Doc/howto/sorting.rst:153
msgid
"The Old Way Using Decorate-Sort-Undecorate"
msgstr
""
#:
../Doc/howto/sorting.rst:155
msgid
"This idiom is called Decorate-Sort-Undecorate after its three steps:"
msgstr
""
#:
../Doc/howto/sorting.rst:157
msgid
""
"First, the initial list is decorated with new values that control the "
"sort order."
msgstr
""
#:
../Doc/howto/sorting.rst:159
msgid
"Second, the decorated list is sorted."
msgstr
""
#:
../Doc/howto/sorting.rst:161
msgid
""
"Finally, the decorations are removed, creating a list that contains only "
"the initial values in the new order."
msgstr
""
#:
../Doc/howto/sorting.rst:164
msgid
"For example, to sort the student data by *grade* using the DSU approach:"
msgstr
""
#:
../Doc/howto/sorting.rst:171
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
""
#:
../Doc/howto/sorting.rst:175
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
""
#:
../Doc/howto/sorting.rst:178
msgid
""
"The sort is stable -- if two items have the same key, their order will be"
" preserved in the sorted list."
msgstr
""
#:
../Doc/howto/sorting.rst:181
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
""
#:
../Doc/howto/sorting.rst:186
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
""
#:
../Doc/howto/sorting.rst:190
msgid
""
"Now that Python sorting provides key-functions, this technique is not "
"often needed."
msgstr
""
#:
../Doc/howto/sorting.rst:194
msgid
"The Old Way Using the *cmp* Parameter"
msgstr
""
#:
../Doc/howto/sorting.rst:196
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
""
#:
../Doc/howto/sorting.rst:201
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
""
#:
../Doc/howto/sorting.rst:205
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
""
#:
../Doc/howto/sorting.rst:215
msgid
"Or you can reverse the order of comparison with:"
msgstr
""
#:
../Doc/howto/sorting.rst:222
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
""
#:
../Doc/howto/sorting.rst:245
msgid
"To convert to a key function, just wrap the old comparison function:"
msgstr
""
#:
../Doc/howto/sorting.rst:256
msgid
""
"In Python 3.2, the :func:`functools.cmp_to_key` function was added to the"
" :mod:`functools` module in the standard library."
msgstr
""
#:
../Doc/howto/sorting.rst:260
msgid
"Odd and Ends"
msgstr
""
#:
../Doc/howto/sorting.rst:262
msgid
""
"For locale aware sorting, use :func:`locale.strxfrm` for a key function "
"or :func:`locale.strcoll` for a comparison function."
msgstr
""
#:
../Doc/howto/sorting.rst:265
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
""
#:
../Doc/howto/sorting.rst:277
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
""
#:
../Doc/howto/sorting.rst:285
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
""
Back
|
FazBrowse Home
|
New Git URL