Lines Matching refs:hash
122 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) UPRV_BLOCK_MACRO_BEGIN { \ argument
123 if (hash->keyDeleter != NULL && keypointer != NULL) { \
124 (*hash->keyDeleter)(keypointer); \
126 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
127 (*hash->valueDeleter)(valuepointer); \
144 _uhash_setElement(UHashtable *hash, UHashElement* e, in _uhash_setElement() argument
149 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement()
151 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement()
153 if (hash->valueDeleter != NULL) { in _uhash_setElement()
156 (*hash->valueDeleter)(oldValue.pointer); in _uhash_setElement()
184 _uhash_internalRemoveElement(UHashtable *hash, UHashElement* e) { in _uhash_internalRemoveElement() argument
187 --hash->count; in _uhash_internalRemoveElement()
189 return _uhash_setElement(hash, e, HASH_DELETED, empty, empty, 0); in _uhash_internalRemoveElement()
193 _uhash_internalSetResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) { in _uhash_internalSetResizePolicy() argument
194 U_ASSERT(hash != NULL); in _uhash_internalSetResizePolicy()
197 hash->lowWaterRatio = RESIZE_POLICY_RATIO_TABLE[policy * 2]; in _uhash_internalSetResizePolicy()
198 hash->highWaterRatio = RESIZE_POLICY_RATIO_TABLE[policy * 2 + 1]; in _uhash_internalSetResizePolicy()
211 _uhash_allocate(UHashtable *hash, in _uhash_allocate() argument
222 hash->primeIndex = static_cast<int8_t>(primeIndex); in _uhash_allocate()
223 hash->length = PRIMES[primeIndex]; in _uhash_allocate()
225 p = hash->elements = (UHashElement*) in _uhash_allocate()
226 uprv_malloc(sizeof(UHashElement) * hash->length); in _uhash_allocate()
228 if (hash->elements == NULL) { in _uhash_allocate()
236 limit = p + hash->length; in _uhash_allocate()
244 hash->count = 0; in _uhash_allocate()
245 hash->lowWaterMark = (int32_t)(hash->length * hash->lowWaterRatio); in _uhash_allocate()
246 hash->highWaterMark = (int32_t)(hash->length * hash->highWaterRatio); in _uhash_allocate()
334 _uhash_find(const UHashtable *hash, UHashTok key, in _uhash_find() argument
341 UHashElement *elements = hash->elements; in _uhash_find()
344 startIndex = theIndex = (hashcode ^ 0x4000000) % hash->length; in _uhash_find()
349 if ((*hash->keyComparator)(key, elements[theIndex].key)) { in _uhash_find()
367 jump = (hashcode % (hash->length - 1)) + 1; in _uhash_find()
369 theIndex = (theIndex + jump) % hash->length; in _uhash_find()
395 _uhash_rehash(UHashtable *hash, UErrorCode *status) { in _uhash_rehash() argument
397 UHashElement *old = hash->elements; in _uhash_rehash()
398 int32_t oldLength = hash->length; in _uhash_rehash()
399 int32_t newPrimeIndex = hash->primeIndex; in _uhash_rehash()
402 if (hash->count > hash->highWaterMark) { in _uhash_rehash()
406 } else if (hash->count < hash->lowWaterMark) { in _uhash_rehash()
414 _uhash_allocate(hash, newPrimeIndex, status); in _uhash_rehash()
417 hash->elements = old; in _uhash_rehash()
418 hash->length = oldLength; in _uhash_rehash()
424 UHashElement *e = _uhash_find(hash, old[i].key, old[i].hashcode); in _uhash_rehash()
430 ++hash->count; in _uhash_rehash()
438 _uhash_remove(UHashtable *hash, in _uhash_remove() argument
448 UHashElement* e = _uhash_find(hash, key, hash->keyHasher(key)); in _uhash_remove()
453 result = _uhash_internalRemoveElement(hash, e); in _uhash_remove()
454 if (hash->count < hash->lowWaterMark) { in _uhash_remove()
456 _uhash_rehash(hash, &status); in _uhash_remove()
463 _uhash_put(UHashtable *hash, in _uhash_put() argument
481 U_ASSERT(hash != NULL); in _uhash_put()
487 return _uhash_remove(hash, key); in _uhash_put()
489 if (hash->count > hash->highWaterMark) { in _uhash_put()
490 _uhash_rehash(hash, status); in _uhash_put()
496 hashcode = (*hash->keyHasher)(key); in _uhash_put()
497 e = _uhash_find(hash, key, hashcode); in _uhash_put()
508 ++hash->count; in _uhash_put()
509 if (hash->count == hash->length) { in _uhash_put()
511 --hash->count; in _uhash_put()
521 return _uhash_setElement(hash, e, hashcode & 0x7FFFFFFF, key, value, hint); in _uhash_put()
528 HASH_DELETE_KEY_VALUE(hash, key.pointer, value.pointer); in _uhash_put()
590 uhash_close(UHashtable *hash) { in uhash_close() argument
591 if (hash == NULL) { in uhash_close()
594 if (hash->elements != NULL) { in uhash_close()
595 if (hash->keyDeleter != NULL || hash->valueDeleter != NULL) { in uhash_close()
598 while ((e = (UHashElement*) uhash_nextElement(hash, &pos)) != NULL) { in uhash_close()
599 HASH_DELETE_KEY_VALUE(hash, e->key.pointer, e->value.pointer); in uhash_close()
602 uprv_free(hash->elements); in uhash_close()
603 hash->elements = NULL; in uhash_close()
605 if (hash->allocated) { in uhash_close()
606 uprv_free(hash); in uhash_close()
611 uhash_setKeyHasher(UHashtable *hash, UHashFunction *fn) { in uhash_setKeyHasher() argument
612 UHashFunction *result = hash->keyHasher; in uhash_setKeyHasher()
613 hash->keyHasher = fn; in uhash_setKeyHasher()
618 uhash_setKeyComparator(UHashtable *hash, UKeyComparator *fn) { in uhash_setKeyComparator() argument
619 UKeyComparator *result = hash->keyComparator; in uhash_setKeyComparator()
620 hash->keyComparator = fn; in uhash_setKeyComparator()
624 uhash_setValueComparator(UHashtable *hash, UValueComparator *fn){ in uhash_setValueComparator() argument
625 UValueComparator *result = hash->valueComparator; in uhash_setValueComparator()
626 hash->valueComparator = fn; in uhash_setValueComparator()
631 uhash_setKeyDeleter(UHashtable *hash, UObjectDeleter *fn) { in uhash_setKeyDeleter() argument
632 UObjectDeleter *result = hash->keyDeleter; in uhash_setKeyDeleter()
633 hash->keyDeleter = fn; in uhash_setKeyDeleter()
638 uhash_setValueDeleter(UHashtable *hash, UObjectDeleter *fn) { in uhash_setValueDeleter() argument
639 UObjectDeleter *result = hash->valueDeleter; in uhash_setValueDeleter()
640 hash->valueDeleter = fn; in uhash_setValueDeleter()
645 uhash_setResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) { in uhash_setResizePolicy() argument
647 _uhash_internalSetResizePolicy(hash, policy); in uhash_setResizePolicy()
648 hash->lowWaterMark = (int32_t)(hash->length * hash->lowWaterRatio); in uhash_setResizePolicy()
649 hash->highWaterMark = (int32_t)(hash->length * hash->highWaterRatio); in uhash_setResizePolicy()
650 _uhash_rehash(hash, &status); in uhash_setResizePolicy()
654 uhash_count(const UHashtable *hash) { in uhash_count() argument
655 return hash->count; in uhash_count()
659 uhash_get(const UHashtable *hash, in uhash_get() argument
663 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.pointer; in uhash_get()
667 uhash_iget(const UHashtable *hash, in uhash_iget() argument
671 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.pointer; in uhash_iget()
675 uhash_geti(const UHashtable *hash, in uhash_geti() argument
679 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.integer; in uhash_geti()
683 uhash_igeti(const UHashtable *hash, in uhash_igeti() argument
687 return _uhash_find(hash, keyholder, hash->keyHasher(keyholder))->value.integer; in uhash_igeti()
691 uhash_put(UHashtable *hash, in uhash_put() argument
698 return _uhash_put(hash, keyholder, valueholder, in uhash_put()
704 uhash_iput(UHashtable *hash, in uhash_iput() argument
711 return _uhash_put(hash, keyholder, valueholder, in uhash_iput()
717 uhash_puti(UHashtable *hash, in uhash_puti() argument
724 return _uhash_put(hash, keyholder, valueholder, in uhash_puti()
731 uhash_iputi(UHashtable *hash, in uhash_iputi() argument
738 return _uhash_put(hash, keyholder, valueholder, in uhash_iputi()
744 uhash_remove(UHashtable *hash, in uhash_remove() argument
748 return _uhash_remove(hash, keyholder).pointer; in uhash_remove()
752 uhash_iremove(UHashtable *hash, in uhash_iremove() argument
756 return _uhash_remove(hash, keyholder).pointer; in uhash_iremove()
760 uhash_removei(UHashtable *hash, in uhash_removei() argument
764 return _uhash_remove(hash, keyholder).integer; in uhash_removei()
768 uhash_iremovei(UHashtable *hash, in uhash_iremovei() argument
772 return _uhash_remove(hash, keyholder).integer; in uhash_iremovei()
776 uhash_removeAll(UHashtable *hash) { in uhash_removeAll() argument
779 U_ASSERT(hash != NULL); in uhash_removeAll()
780 if (hash->count != 0) { in uhash_removeAll()
781 while ((e = uhash_nextElement(hash, &pos)) != NULL) { in uhash_removeAll()
782 uhash_removeElement(hash, e); in uhash_removeAll()
785 U_ASSERT(hash->count == 0); in uhash_removeAll()
789 uhash_find(const UHashtable *hash, const void* key) { in uhash_find() argument
793 e = _uhash_find(hash, keyholder, hash->keyHasher(keyholder)); in uhash_find()
798 uhash_nextElement(const UHashtable *hash, int32_t *pos) { in uhash_nextElement() argument
803 U_ASSERT(hash != NULL); in uhash_nextElement()
804 for (i = *pos + 1; i < hash->length; ++i) { in uhash_nextElement()
805 if (!IS_EMPTY_OR_DELETED(hash->elements[i].hashcode)) { in uhash_nextElement()
807 return &(hash->elements[i]); in uhash_nextElement()
816 uhash_removeElement(UHashtable *hash, const UHashElement* e) { in uhash_removeElement() argument
817 U_ASSERT(hash != NULL); in uhash_removeElement()
821 return _uhash_internalRemoveElement(hash, nce).pointer; in uhash_removeElement()