From 2f173a67abebd14805d6f7c44db2e8b5c4b5cf83 Mon Sep 17 00:00:00 2001 From: Marius Guggenmos Date: Sat, 7 Oct 2017 17:49:23 +0200 Subject: Array::sort, sort_custom and invert now return reference to Array to allow chaining of operations --- doc/classes/Array.xml | 12 +++++++++--- 1 file changed, 9 insertions(+), 3 deletions(-) (limited to 'doc') diff --git a/doc/classes/Array.xml b/doc/classes/Array.xml index 9542c83eaf..cc5f371087 100644 --- a/doc/classes/Array.xml +++ b/doc/classes/Array.xml @@ -177,8 +177,10 @@ + + - Reverse the order of the elements in the array (so first element will now be the last). + Reverse the order of the elements in the array (so first element will now be the last) and return reference to the array. @@ -238,17 +240,21 @@ + + - Sort the array using natural order. + Sort the array using natural order and return reference to the array. + + - 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. + 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. -- cgit v1.2.3