2 ******************************************************************************
3 * Copyright (C) 1997-2011, International Business Machines
4 * Corporation and others. All Rights Reserved.
5 ******************************************************************************
6 * Date Name Description
7 * 03/28/00 aliu Creation.
8 ******************************************************************************
14 #include "unicode/unistr.h"
15 #include "unicode/uobject.h"
22 * Hashtable is a thin C++ wrapper around UHashtable, a general-purpose void*
23 * hashtable implemented in C. Hashtable is designed to be idiomatic and
26 * Hashtable is an INTERNAL CLASS.
28 class U_COMMON_API Hashtable
: public UMemory
{
32 inline void init(UHashFunction
*keyHash
, UKeyComparator
*keyComp
, UValueComparator
*valueComp
, UErrorCode
& status
);
36 * Construct a hashtable
37 * @param ignoreKeyCase If true, keys are case insensitive.
38 * @param status Error code
40 Hashtable(UBool ignoreKeyCase
, UErrorCode
& status
);
43 * Construct a hashtable
44 * @param keyComp Comparator for comparing the keys
45 * @param valueComp Comparator for comparing the values
46 * @param status Error code
48 Hashtable(UKeyComparator
*keyComp
, UValueComparator
*valueComp
, UErrorCode
& status
);
51 * Construct a hashtable
52 * @param status Error code
54 Hashtable(UErrorCode
& status
);
57 * Construct a hashtable, _disregarding any error_. Use this constructor
63 * Non-virtual destructor; make this virtual if Hashtable is subclassed
68 UObjectDeleter
*setValueDeleter(UObjectDeleter
*fn
);
70 int32_t count() const;
72 void* put(const UnicodeString
& key
, void* value
, UErrorCode
& status
);
74 int32_t puti(const UnicodeString
& key
, int32_t value
, UErrorCode
& status
);
76 void* get(const UnicodeString
& key
) const;
78 int32_t geti(const UnicodeString
& key
) const;
80 void* remove(const UnicodeString
& key
);
82 int32_t removei(const UnicodeString
& key
);
86 const UHashElement
* find(const UnicodeString
& key
) const;
88 const UHashElement
* nextElement(int32_t& pos
) const;
90 UKeyComparator
* setKeyComparator(UKeyComparator
*keyComp
);
92 UValueComparator
* setValueComparator(UValueComparator
* valueComp
);
94 UBool
equals(const Hashtable
& that
) const;
96 Hashtable(const Hashtable
&other
); // forbid copying of this class
97 Hashtable
&operator=(const Hashtable
&other
); // forbid copying of this class
100 /*********************************************************************
102 ********************************************************************/
104 inline void Hashtable::init(UHashFunction
*keyHash
, UKeyComparator
*keyComp
,
105 UValueComparator
*valueComp
, UErrorCode
& status
) {
106 if (U_FAILURE(status
)) {
109 uhash_init(&hashObj
, keyHash
, keyComp
, valueComp
, &status
);
110 if (U_SUCCESS(status
)) {
112 uhash_setKeyDeleter(hash
, uprv_deleteUObject
);
116 inline Hashtable::Hashtable(UKeyComparator
*keyComp
, UValueComparator
*valueComp
,
117 UErrorCode
& status
) : hash(0) {
118 init( uhash_hashUnicodeString
, keyComp
, valueComp
, status
);
120 inline Hashtable::Hashtable(UBool ignoreKeyCase
, UErrorCode
& status
)
123 init(ignoreKeyCase
? uhash_hashCaselessUnicodeString
124 : uhash_hashUnicodeString
,
125 ignoreKeyCase
? uhash_compareCaselessUnicodeString
126 : uhash_compareUnicodeString
,
131 inline Hashtable::Hashtable(UErrorCode
& status
)
134 init(uhash_hashUnicodeString
, uhash_compareUnicodeString
, NULL
, status
);
137 inline Hashtable::Hashtable()
140 UErrorCode status
= U_ZERO_ERROR
;
141 init(uhash_hashUnicodeString
, uhash_compareUnicodeString
, NULL
, status
);
144 inline Hashtable::~Hashtable() {
150 inline UObjectDeleter
*Hashtable::setValueDeleter(UObjectDeleter
*fn
) {
151 return uhash_setValueDeleter(hash
, fn
);
154 inline int32_t Hashtable::count() const {
155 return uhash_count(hash
);
158 inline void* Hashtable::put(const UnicodeString
& key
, void* value
, UErrorCode
& status
) {
159 return uhash_put(hash
, new UnicodeString(key
), value
, &status
);
162 inline int32_t Hashtable::puti(const UnicodeString
& key
, int32_t value
, UErrorCode
& status
) {
163 return uhash_puti(hash
, new UnicodeString(key
), value
, &status
);
166 inline void* Hashtable::get(const UnicodeString
& key
) const {
167 return uhash_get(hash
, &key
);
170 inline int32_t Hashtable::geti(const UnicodeString
& key
) const {
171 return uhash_geti(hash
, &key
);
174 inline void* Hashtable::remove(const UnicodeString
& key
) {
175 return uhash_remove(hash
, &key
);
178 inline int32_t Hashtable::removei(const UnicodeString
& key
) {
179 return uhash_removei(hash
, &key
);
182 inline const UHashElement
* Hashtable::find(const UnicodeString
& key
) const {
183 return uhash_find(hash
, &key
);
186 inline const UHashElement
* Hashtable::nextElement(int32_t& pos
) const {
187 return uhash_nextElement(hash
, &pos
);
190 inline void Hashtable::removeAll(void) {
191 uhash_removeAll(hash
);
194 inline UKeyComparator
* Hashtable::setKeyComparator(UKeyComparator
*keyComp
){
195 return uhash_setKeyComparator(hash
, keyComp
);
198 inline UValueComparator
* Hashtable::setValueComparator(UValueComparator
* valueComp
){
199 return uhash_setValueComparator(hash
, valueComp
);
202 inline UBool
Hashtable::equals(const Hashtable
& that
)const{
203 return uhash_equals(hash
, that
.hash
);