Lines Matching refs:UVector
50 * <p>Since we don't have garbage collection, UVector was given the
61 * UVector needs a way to compare objects for equality. To do so, it
73 class U_COMMON_API UVector : public UObject {
74 // NOTE: UVector uses the UHashKey (union of void* and int32_t) as
93 UVector(UErrorCode &status);
95 UVector(int32_t initialCapacity, UErrorCode &status);
97 UVector(UObjectDeleter *d, UElementsAreEqual *c, UErrorCode &status);
99 UVector(UObjectDeleter *d, UElementsAreEqual *c, int32_t initialCapacity, UErrorCode &status);
101 virtual ~UVector();
107 void assign(const UVector& other, UElementAssigner *assign, UErrorCode &ec);
114 UBool operator==(const UVector& other);
119 inline UBool operator!=(const UVector& other);
141 UBool equals(const UVector &other) const;
157 UBool containsAll(const UVector& other) const;
159 UBool removeAll(const UVector& other);
161 UBool retainAll(const UVector& other);
215 UBool containsNone(const UVector& other) const;
240 * UVector's UElementComparator function is different from the
248 * than UVector::sort() because an additional user parameter can be passed to
271 UVector(const UVector&);
274 UVector& operator=(const UVector&);
282 * is merely a paper thin layer around UVector. See the UVector
295 class U_COMMON_API UStack : public UVector {
307 // It's okay not to have a virtual destructor (in UVector)
349 // UVector inlines
351 inline int32_t UVector::size(void) const {
355 inline UBool UVector::isEmpty(void) const {
359 inline UBool UVector::contains(void* obj) const {
363 inline UBool UVector::contains(int32_t obj) const {
367 inline void* UVector::firstElement(void) const {
371 inline void* UVector::lastElement(void) const {
375 inline int32_t UVector::lastElementi(void) const {
379 inline void* UVector::operator[](int32_t index) const {
383 inline UBool UVector::operator!=(const UVector& other) {
