From 9ab59343f4f5ae36d5a32e3ae943ad6671aa4df9 Mon Sep 17 00:00:00 2001 From: Ralph Minderhoud Date: Fri, 8 Dec 2017 16:14:01 -0600 Subject: [PATCH] Added example for Array sort_custom function --- doc/classes/Array.xml | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/doc/classes/Array.xml b/doc/classes/Array.xml index a7f9a6e09c1..9445a1732ef 100644 --- a/doc/classes/Array.xml +++ b/doc/classes/Array.xml @@ -284,6 +284,16 @@ 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. + [codeblock] + class MyCustomSorter: + static func sort(a, b): + if a[0] < b[0]: + return true + return false + + var my_items = [[5, "Potato"], [9, "Rice"], [4, "Tomato"]] + my_items.sort_custom(MyCustomSorter, "sort") + [/codeblock]