}
/**
- * Sort the vector, assuming it contains ints.
+ * Sort the vector, assuming it constains ints.
* (A more general sort would take a comparison function, but it's
* not clear whether UVector's UElementComparator or
* UComparator from uprv_sortAray would be more appropriate.)
#include "uvectr32.h"
#include "cmemory.h"
#include "putilimp.h"
-#include "uarrsort.h"
U_NAMESPACE_BEGIN
}
-/**
- * Sort the vector, assuming it contains ints.
- */
-void UVector32::sorti(UErrorCode &ec) {
- if (U_SUCCESS(ec)) {
- uprv_sortArray(elements, count, sizeof(int32_t),
- uprv_int32Comparator, nullptr, false, &ec);
- }
-}
+
+
U_NAMESPACE_END
*/
void sortedInsert(int32_t elem, UErrorCode& ec);
- /**
- * Sort the contents of the int32_t vector.
- */
- void sorti(UErrorCode &ec);
-
/**
* Returns a pointer to the internal array holding the vector.
*/