mirror of
https://github.com/unicode-org/icu.git
synced 2025-04-13 08:53:20 +00:00
ICU-13194 rbbi work, revert unneeded changes to UVector.
X-SVN-Rev: 41185
This commit is contained in:
parent
05f261001b
commit
4d0381063f
3 changed files with 3 additions and 16 deletions
|
@ -518,7 +518,7 @@ sortiComparator(const void * /*context */, const void *left, const void *right)
|
|||
}
|
||||
|
||||
/**
|
||||
* 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.)
|
||||
|
|
|
@ -13,7 +13,6 @@
|
|||
#include "uvectr32.h"
|
||||
#include "cmemory.h"
|
||||
#include "putilimp.h"
|
||||
#include "uarrsort.h"
|
||||
|
||||
U_NAMESPACE_BEGIN
|
||||
|
||||
|
@ -329,15 +328,8 @@ void UVector32::sortedInsert(int32_t tok, UErrorCode& ec) {
|
|||
}
|
||||
|
||||
|
||||
/**
|
||||
* 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
|
||||
|
||||
|
|
|
@ -160,11 +160,6 @@ public:
|
|||
*/
|
||||
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.
|
||||
*/
|
||||
|
|
Loading…
Add table
Reference in a new issue