Implementation Note: The sorting algorithm is a parallel sort-merge that breaks the Other value and all Float.NaN values are considered equal. This method uses the total order imposed by the methodįpareTo(): -0.0f is treated as less than valueĠ.0f and Float.NaN is considered greater than any Value compares neither less than, greater than, nor equal to any value,Įven itself. Values: -0.0f = 0.0f is true and a Float.NaN The < relation does not provide a total order on all float Sorts the specified array into ascending numerical order.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |