Lines Matching defs:UVector
67 * <p>Since we don't have garbage collection, UVector was given the
78 * UVector needs a way to compare objects for equality. To do so, it
90 class U_COMMON_API UVector : public UObject {
91 // NOTE: UVector uses the UHashKey (union of void* and int32_t) as
110 UVector(UErrorCode &status);
112 UVector(int32_t initialCapacity, UErrorCode &status);
114 UVector(UObjectDeleter *d, UKeyComparator *c, UErrorCode &status);
116 UVector(UObjectDeleter *d, UKeyComparator *c, int32_t initialCapacity, UErrorCode &status);
118 virtual ~UVector();
124 void assign(const UVector& other, UTokenAssigner *assign, UErrorCode &ec);
131 UBool operator==(const UVector& other);
136 inline UBool operator!=(const UVector& other);
158 UBool equals(const UVector &other) const;
174 UBool containsAll(const UVector& other) const;
176 UBool removeAll(const UVector& other);
178 UBool retainAll(const UVector& other);
232 UBool containsNone(const UVector& other) const;
257 * UVector's USortComparator function is different from the
280 UVector(const UVector&);
283 UVector& operator=(const UVector&);
291 * is merely a paper thin layer around UVector. See the UVector
304 class U_COMMON_API UStack : public UVector {
316 // It's okay not to have a virtual destructor (in UVector)
358 // UVector inlines
360 inline int32_t UVector::size(void) const {
364 inline UBool UVector::isEmpty(void) const {
368 inline UBool UVector::contains(void* obj) const {
372 inline UBool UVector::contains(int32_t obj) const {
376 inline void* UVector::firstElement(void) const {
380 inline void* UVector::lastElement(void) const {
384 inline int32_t UVector::lastElementi(void) const {
388 inline void* UVector::operator[](int32_t index) const {
392 inline UBool UVector::operator!=(const UVector& other) {
