python-docs-tr/howto/sorting.po at 3.10 · python/python-docs-tr

334 lines (279 loc) · 9.61 KB
# Python Documentation Turkish Translation
# Copyright (C) 2001-2023, Python Software Foundation
# This file is distributed under the same license as the Python package.
"Project-Id-Version: Python 3.10\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2022-12-05 18:31+0300\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: \n"
"Language-Team: TURKISH <python.docs.tr@gmail.com>\n"
"Language: tr\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
#: howto/sorting.rst:4
msgid "Sorting HOW TO"
#: howto/sorting.rst:0
msgid "Author"
#: howto/sorting.rst:6
msgid "Andrew Dalke and Raymond Hettinger"
#: howto/sorting.rst:0
msgid "Release"
#: howto/sorting.rst:7
msgid "0.1"
#: howto/sorting.rst:10
"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."
#: howto/sorting.rst:14
"In this document, we explore the various techniques for sorting data using "
#: howto/sorting.rst:18
msgid "Sorting Basics"
#: howto/sorting.rst:20
"A simple ascending sort is very easy: just call the :func:`sorted` function. "
"It returns a new sorted list:"
#: howto/sorting.rst:28
"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."
#: howto/sorting.rst:40
"Another difference is that the :meth:`list.sort` method is only defined for "
"lists. In contrast, the :func:`sorted` function accepts any iterable."
#: howto/sorting.rst:49
msgid "Key Functions"
#: howto/sorting.rst:51
"Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify "
"a function (or other callable) to be called on each list element prior to "
"making comparisons."
#: howto/sorting.rst:55
msgid "For example, here's a case-insensitive string comparison:"
#: howto/sorting.rst:62
"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."
#: howto/sorting.rst:67
"A common pattern is to sort complex objects using some of the object's "
"indices as keys. For example:"
#: howto/sorting.rst:80
"The same technique works for objects with named attributes. For example:"
#: howto/sorting.rst:101
msgid "Operator Module Functions"
#: howto/sorting.rst:103
"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."
#: howto/sorting.rst:108
msgid "Using those functions, the above examples become simpler and faster:"
#: howto/sorting.rst:120
"The operator module functions allow multiple levels of sorting. For example, "
"to sort by *grade* then by *age*:"
#: howto/sorting.rst:132
msgid "Ascending and Descending"
#: howto/sorting.rst:134
"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:"
#: howto/sorting.rst:147
msgid "Sort Stability and Complex Sorts"
#: howto/sorting.rst:149
"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."
#: howto/sorting.rst:159
"Notice how the two records for *blue* retain their original order so that "
"``('blue', 1)`` is guaranteed to precede ``('blue', 2)``."
#: howto/sorting.rst:162
"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*:"
#: howto/sorting.rst:172
"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."
#: howto/sorting.rst:185
"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."
#: howto/sorting.rst:190
msgid "The Old Way Using Decorate-Sort-Undecorate"
#: howto/sorting.rst:192
msgid "This idiom is called Decorate-Sort-Undecorate after its three steps:"
#: howto/sorting.rst:194
"First, the initial list is decorated with new values that control the sort "
#: howto/sorting.rst:196
msgid "Second, the decorated list is sorted."
#: howto/sorting.rst:198
"Finally, the decorations are removed, creating a list that contains only the "
"initial values in the new order."
#: howto/sorting.rst:201
"For example, to sort the student data by *grade* using the DSU approach:"
#: howto/sorting.rst:208
"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."
#: howto/sorting.rst:212
"It is not strictly necessary in all cases to include the index *i* in the "
"decorated list, but including it gives two benefits:"
#: howto/sorting.rst:215
"The sort is stable -- if two items have the same key, their order will be "
"preserved in the sorted list."
#: howto/sorting.rst:218
"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."
#: howto/sorting.rst:223
"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."
#: howto/sorting.rst:227
"Now that Python sorting provides key-functions, this technique is not often "
#: howto/sorting.rst:231
msgid "The Old Way Using the *cmp* Parameter"
#: howto/sorting.rst:233
"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."
#: howto/sorting.rst:238
"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)."
#: howto/sorting.rst:242
"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:"
#: howto/sorting.rst:254
msgid "Or you can reverse the order of comparison with:"
#: howto/sorting.rst:263
"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:"
#: howto/sorting.rst:294
msgid "To convert to a key function, just wrap the old comparison function:"
#: howto/sorting.rst:305
"In Python 3.2, the :func:`functools.cmp_to_key` function was added to the :"
"mod:`functools` module in the standard library."
#: howto/sorting.rst:309
msgid "Odd and Ends"
#: howto/sorting.rst:311
"For locale aware sorting, use :func:`locale.strxfrm` for a key function or :"
"func:`locale.strcoll` for a comparison function."
#: howto/sorting.rst:314
"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:"
#: howto/sorting.rst:328
"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:"
"`__lt__` method:"
#: howto/sorting.rst:338
"However, note that ``<`` can fall back to using :meth:`__gt__` if :meth:"
"`__lt__` is not implemented (see :func:`object.__lt__`)."
#: howto/sorting.rst:341
"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:"
Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Uh oh!

FilesExpand file tree

sorting.po

Latest commit

History

sorting.po

File metadata and controls
