From 8dc021925fa5bb9f5917e811b4bd5ca2b8015f01 Mon Sep 17 00:00:00 2001 From: Max Hilbrunner Date: Fri, 25 May 2018 16:55:56 +0200 Subject: [PATCH] [DOCS] Array sort (cherry picked from commit 9115d84913f30d35997cf3e2c26b86ebccd36f0e) --- doc/classes/Array.xml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/classes/Array.xml b/doc/classes/Array.xml index b355cb50029..a82f4efff31 100644 --- a/doc/classes/Array.xml +++ b/doc/classes/Array.xml @@ -274,7 +274,7 @@ - Sort the array using natural order and return reference to the array. + Sort the array using natural order. @@ -283,7 +283,7 @@ - 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):