diff options
Diffstat (limited to 'thirdparty/icu4c/common/uarrsort.cpp')
| -rw-r--r-- | thirdparty/icu4c/common/uarrsort.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/thirdparty/icu4c/common/uarrsort.cpp b/thirdparty/icu4c/common/uarrsort.cpp index c17dbb2e2b..17b6964ffe 100644 --- a/thirdparty/icu4c/common/uarrsort.cpp +++ b/thirdparty/icu4c/common/uarrsort.cpp @@ -75,7 +75,7 @@ U_CAPI int32_t U_EXPORT2 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, UComparator *cmp, const void *context) { int32_t start=0; - UBool found=FALSE; + UBool found=false; /* Binary search until we get down to a tiny sub-array. */ while((limit-start)>=MIN_QSORT) { @@ -90,10 +90,10 @@ uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize * However, if there are many equal items, then it should be * faster to continue with the binary search. * It seems likely that we either have all unique items - * (where found will never become TRUE in the insertion sort) + * (where found will never become true in the insertion sort) * or potentially many duplicates. */ - found=TRUE; + found=true; start=i+1; } else if(diff<0) { limit=i; @@ -106,7 +106,7 @@ uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize while(start<limit) { int32_t diff=cmp(context, item, array+start*itemSize); if(diff==0) { - found=TRUE; + found=true; } else if(diff<0) { break; } |