ArraySort(): Fix bound checking bug.

Closes #31.
This commit is contained in:
Jordan Bancino 2024-05-18 10:50:18 -04:00
parent 5d87da31cd
commit 346b912a06
Signed by: jordan
SSH key fingerprint: SHA256:lRUOrki6+e1vo47tj4BoyALNvOhW/yGXq08lqmaNvkw
2 changed files with 5 additions and 2 deletions

View file

@ -19,6 +19,8 @@ are not even initialized to a default value.
specific circumstances. specific circumstances.
- Added `JsonMerge()` to the JSON API to merge two JSON objects together. - Added `JsonMerge()` to the JSON API to merge two JSON objects together.
- Make `HttpRouter` decode path parts before matching them on regular expressions. - Make `HttpRouter` decode path parts before matching them on regular expressions.
- Fixed a bug in `ArraySort()` that would crash programs if the passed array has no
elements.
## v0.4.0 ## v0.4.0
@ -30,4 +32,4 @@ project with its own independent releases. This allows it to develop at a much m
rapid pace than Telodendria. rapid pace than Telodendria.
Changes in future releases will be reported here. Since this is the first release, Changes in future releases will be reported here. Since this is the first release,
there are no changes to show. there are no changes to show.

View file

@ -267,8 +267,9 @@ ArrayQuickSort(Array * array, size_t low, size_t high, int (*compare) (void *, v
void void
ArraySort(Array * array, int (*compare) (void *, void *)) ArraySort(Array * array, int (*compare) (void *, void *))
{ {
if (!array) if (!ArraySize(array))
{ {
// If a NULL ptr was given, or the array has no elements, do nothing.
return; return;
} }
ArrayQuickSort(array, 0, array->size - 1, compare); ArrayQuickSort(array, 0, array->size - 1, compare);