diff options
| author | Andreas Haas | 2017-10-10 20:31:48 +0200 |
|---|---|---|
| committer | GitHub | 2017-10-10 20:31:48 +0200 |
| commit | 1d8a546a07a7d7a47d788b5f4156bd54ce48211c (patch) | |
| tree | f6bb80833d23fb3d52669f7fbcdfaa8d971db5cf /doc/classes | |
| parent | 547cc8b7abba1543bf211163cfc8bcb102c158c0 (diff) | |
| parent | 2f173a67abebd14805d6f7c44db2e8b5c4b5cf83 (diff) | |
| download | godot-1d8a546a07a7d7a47d788b5f4156bd54ce48211c.tar.gz godot-1d8a546a07a7d7a47d788b5f4156bd54ce48211c.tar.zst godot-1d8a546a07a7d7a47d788b5f4156bd54ce48211c.zip | |
Diffstat (limited to 'doc/classes')
| -rw-r--r-- | doc/classes/Array.xml | 12 |
1 files changed, 9 insertions, 3 deletions
diff --git a/doc/classes/Array.xml b/doc/classes/Array.xml index 47100f23b..2cfbaffe0 100644 --- a/doc/classes/Array.xml +++ b/doc/classes/Array.xml @@ -178,8 +178,10 @@ </description> </method> <method name="invert"> + <return type="Array"> + </return> <description> - 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. </description> </method> <method name="pop_back"> @@ -239,17 +241,21 @@ </description> </method> <method name="sort"> + <return type="Array"> + </return> <description> - Sort the array using natural order. + Sort the array using natural order and return reference to the array. </description> </method> <method name="sort_custom"> + <return type="Array"> + </return> <argument index="0" name="obj" type="Object"> </argument> <argument index="1" name="func" type="String"> </argument> <description> - 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. </description> </method> </methods> |