summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMax Hilbrunner <mhilbrunner@users.noreply.github.com>2018-05-25 16:55:56 +0200
committerGitHub <noreply@github.com>2018-05-25 16:55:56 +0200
commit9115d84913f30d35997cf3e2c26b86ebccd36f0e (patch)
treea8ef679694d98d30618b4275029c6e0549f2aafb
parent47cfdfe2ee14418439afaf08644a194e8cf4193a (diff)
[DOCS] Array sort
-rw-r--r--doc/classes/Array.xml4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/classes/Array.xml b/doc/classes/Array.xml
index 5f85751c13..35c120cd6a 100644
--- a/doc/classes/Array.xml
+++ b/doc/classes/Array.xml
@@ -282,7 +282,7 @@
</method>
<method name="sort">
<description>
- Sort the array using natural order and return reference to the array.
+ Sort the array using natural order.
</description>
</method>
<method name="sort_custom">
@@ -291,7 +291,7 @@
<argument index="1" name="func" type="String">
</argument>
<description>
- Sort the array using a custom method and return reference to the array. The arguments are an object that holds the method and the name of such method. The custom method receives two arguments (a pair of elements from the array) and must return true if the first argument is less than the second, and return false otherwise. Note: you cannot randomize the return value as the heapsort algorithm expects a deterministic result. Doing so will result in unexpected behavior.
+ Sort the array using a custom method. The arguments are an object that holds the method and the name of such method. The custom method receives two arguments (a pair of elements from the array) and must return true if the first argument is less than the second, and return false otherwise. Note: you cannot randomize the return value as the heapsort algorithm expects a deterministic result. Doing so will result in unexpected behavior.
[codeblock]
class MyCustomSorter:
static func sort(a, b):