# SOME DESCRIPTIVE TITLE.
# Copyright (C) 1999-2020, The Alibaba Group Holding Ltd.
# This file is distributed under the same license as the mars package.
# FIRST AUTHOR <EMAIL@ADDRESS>, 2020.
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: mars 0.5.0a2\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2020-06-16 16:57+0800\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.7.0\n"

#: ../../source/reference/tensor/generated/mars.tensor.sort.rst:2
msgid "mars.tensor.sort"
msgstr ""

#: mars.tensor.sort:1 of
msgid "Return a sorted copy of a tensor."
msgstr ""

#: mars.tensor.sort of
msgid "Parameters"
msgstr ""

#: mars.tensor.sort:3 of
msgid "Tensor to be sorted."
msgstr ""

#: mars.tensor.sort:5 of
msgid ""
"Axis along which to sort. If None, the tensor is flattened before "
"sorting. The default is -1, which sorts along the last axis."
msgstr ""

#: mars.tensor.sort:8 of
msgid ""
"Sorting algorithm. The default is 'quicksort'. Note that both 'stable' "
"and 'mergesort' use timsort or radix sort under the covers and, in "
"general, the actual implementation will vary with data type. The "
"'mergesort' option is retained for backwards compatibility. Note that "
"this argument would not take effect if `a` has more than 1 chunk on the "
"sorting axis."
msgstr ""

#: mars.tensor.sort:15 of
msgid ""
"Parallel sorting algorithm, for the details, refer to: "
"http://csweb.cs.wfu.edu/bigiron/LittleFE-"
"PSRS/build/html/PSRSalgorithm.html"
msgstr ""

#: mars.tensor.sort:18 of
msgid "Sorting algorithms during PSRS algorithm."
msgstr ""

#: mars.tensor.sort:20 of
msgid ""
"When `a` is a tensor with fields defined, this argument specifies which "
"fields to compare first, second, etc.  A single field can be specified as"
" a string, and not all fields need be specified, but unspecified fields "
"will still be used, in the order in which they come up in the dtype, to "
"break ties."
msgstr ""

#: mars.tensor.sort:26 of
msgid "Return indices as well if True."
msgstr ""

#: mars.tensor.sort of
msgid "Returns"
msgstr ""

#: mars.tensor.sort:29 of
msgid "**sorted_tensor** -- Tensor of the same type and shape as `a`."
msgstr ""

#: mars.tensor.sort of
msgid "Return type"
msgstr ""

#: mars.tensor.sort:35 of
msgid ":func:`Tensor.sort`"
msgstr ""

#: mars.tensor.sort:35 of
msgid "Method to sort a tensor in-place."
msgstr ""

#: mars.tensor.sort:38 of
msgid ":func:`argsort`"
msgstr ""

#: mars.tensor.sort:38 of
msgid "Indirect sort."
msgstr ""

#: mars.tensor.sort:41 of
msgid ":func:`lexsort`"
msgstr ""

#: mars.tensor.sort:41 of
msgid "Indirect stable sort on multiple keys."
msgstr ""

#: mars.tensor.sort:44 of
msgid ":func:`searchsorted`"
msgstr ""

#: mars.tensor.sort:44 of
msgid "Find elements in a sorted tensor."
msgstr ""

#: mars.tensor.sort:46 of
msgid ":func:`partition`"
msgstr ""

#: mars.tensor.sort:47 of
msgid "Partial sort."
msgstr ""

#: mars.tensor.sort:50 of
msgid "Notes"
msgstr ""

#: mars.tensor.sort:51 of
msgid ""
"The various sorting algorithms are characterized by their average speed, "
"worst case performance, work space size, and whether they are stable. A "
"stable sort keeps items with the same key in the same relative order. The"
" four algorithms implemented in NumPy have the following properties:"
msgstr ""

#: mars.tensor.sort:58 of
msgid "kind"
msgstr ""

#: mars.tensor.sort:58 of
msgid "speed"
msgstr ""

#: mars.tensor.sort:58 of
msgid "worst case"
msgstr ""

#: mars.tensor.sort:58 of
msgid "work space"
msgstr ""

#: mars.tensor.sort:58 of
msgid "stable"
msgstr ""

#: mars.tensor.sort:60 of
msgid "'quicksort'"
msgstr ""

#: mars.tensor.sort:60 of
msgid "1"
msgstr ""

#: mars.tensor.sort:60 of
msgid "O(n^2)"
msgstr ""

#: mars.tensor.sort:60 mars.tensor.sort:61 of
msgid "0"
msgstr ""

#: mars.tensor.sort:60 mars.tensor.sort:61 of
msgid "no"
msgstr ""

#: mars.tensor.sort:61 of
msgid "'heapsort'"
msgstr ""

#: mars.tensor.sort:61 of
msgid "3"
msgstr ""

#: mars.tensor.sort:61 mars.tensor.sort:62 mars.tensor.sort:63 of
msgid "O(n*log(n))"
msgstr ""

#: mars.tensor.sort:62 of
msgid "'mergesort'"
msgstr ""

#: mars.tensor.sort:62 mars.tensor.sort:63 of
msgid "2"
msgstr ""

#: mars.tensor.sort:62 mars.tensor.sort:63 of
msgid "~n/2"
msgstr ""

#: mars.tensor.sort:62 mars.tensor.sort:63 of
msgid "yes"
msgstr ""

#: mars.tensor.sort:63 of
msgid "'timsort'"
msgstr ""

#: mars.tensor.sort:66 of
msgid ""
"The datatype determines which of 'mergesort' or 'timsort' is actually "
"used, even if 'mergesort' is specified. User selection at a finer scale "
"is not currently available."
msgstr ""

#: mars.tensor.sort:70 of
msgid ""
"All the sort algorithms make temporary copies of the data when sorting "
"along any but the last axis.  Consequently, sorting along the last axis "
"is faster and uses less space than sorting along any other axis."
msgstr ""

#: mars.tensor.sort:75 of
msgid ""
"The sort order for complex numbers is lexicographic. If both the real and"
" imaginary parts are non-nan then the order is determined by the real "
"parts except when they are equal, in which case the order is determined "
"by the imaginary parts."
msgstr ""

#: mars.tensor.sort:80 of
msgid ""
"quicksort has been changed to an introsort which will switch heapsort "
"when it does not make enough progress. This makes its worst case "
"O(n*log(n))."
msgstr ""

#: mars.tensor.sort:84 of
msgid ""
"'stable' automatically choses the best stable sorting algorithm for the "
"data type being sorted. It, along with 'mergesort' is currently mapped to"
" timsort or radix sort depending on the data type. API forward "
"compatibility currently limits the ability to select the implementation "
"and it is hardwired for the different data types."
msgstr ""

#: mars.tensor.sort:91 of
msgid ""
"Timsort is added for better performance on already or nearly sorted data."
" On random data timsort is almost identical to mergesort. It is now used "
"for stable sort while quicksort is still the default sort if none is "
"chosen. For details of timsort, refer to `CPython listsort.txt "
"<https://github.com/python/cpython/blob/3.7/Objects/listsort.txt>`_. "
"'mergesort' and 'stable' are mapped to radix sort for integer data types."
" Radix sort is an O(n) sort instead of O(n log n)."
msgstr ""

#: mars.tensor.sort:100 of
msgid "Examples"
msgstr ""

#: mars.tensor.sort:112 of
msgid ""
"Use the `order` keyword to specify a field to use when sorting a "
"structured array:"
msgstr ""

#: mars.tensor.sort:124 of
msgid "Sort by age, then height if ages are equal:"
msgstr ""

