You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In adding a comparison function that returns a signed integer, you can write more efficient and more complex functions for testing equality and even sorting of elements in the arraylist.
This would allow f.eks for arraylist_sort() that is a wrapper for qsort or another sort function that would then just use the cmp function from the arraylist.
This also makes it easier to find the correct item in the arraylist if thou so wish.
The text was updated successfully, but these errors were encountered:
In adding a comparison function that returns a signed integer, you can write more efficient and more complex functions for testing equality and even sorting of elements in the arraylist.
This would allow f.eks for arraylist_sort() that is a wrapper for qsort or another sort function that would then just use the cmp function from the arraylist.
This also makes it easier to find the correct item in the arraylist if thou so wish.
The text was updated successfully, but these errors were encountered: