The Tor Browser: intl/icu/source/common/hash.h@6474c204b198 (annotated)

intl/icu/source/common/hash.h@6474c204b198 (annotated)

intl/icu/source/common/hash.h

Wed, 31 Dec 2014 06:09:35 +0100

author: Michael Schloh von Bennewitz <michael@schloh.com>
date: Wed, 31 Dec 2014 06:09:35 +0100
changeset 0: 6474c204b198
permissions: -rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

 /*
 ******************************************************************************
 *   Copyright (C) 1997-2011, International Business Machines
 *   Corporation and others.  All Rights Reserved.
 ******************************************************************************
 *   Date        Name        Description
 *   03/28/00    aliu        Creation.
 ******************************************************************************
 */
 #ifndef HASH_H
 #define HASH_H
 #include "unicode/unistr.h"
 #include "unicode/uobject.h"
 #include "cmemory.h"
 #include "uhash.h"
 U_NAMESPACE_BEGIN
 /**
  * Hashtable is a thin C++ wrapper around UHashtable, a general-purpose void*
  * hashtable implemented in C.  Hashtable is designed to be idiomatic and
  * easy-to-use in C++.
  *
  * Hashtable is an INTERNAL CLASS.
  */
 class U_COMMON_API Hashtable : public UMemory {
     UHashtable* hash;
     UHashtable hashObj;
     inline void init(UHashFunction *keyHash, UKeyComparator *keyComp, UValueComparator *valueComp, UErrorCode& status);
 public:
     /**
      * Construct a hashtable
      * @param ignoreKeyCase If true, keys are case insensitive.
      * @param status Error code
     */
     Hashtable(UBool ignoreKeyCase, UErrorCode& status);
     /**
      * Construct a hashtable
      * @param keyComp Comparator for comparing the keys
      * @param valueComp Comparator for comparing the values
      * @param status Error code
     */
     Hashtable(UKeyComparator *keyComp, UValueComparator *valueComp, UErrorCode& status);
     /**
      * Construct a hashtable
      * @param status Error code
     */
     Hashtable(UErrorCode& status);
     /**
      * Construct a hashtable, _disregarding any error_.  Use this constructor
      * with caution.
      */
     Hashtable();
     /**
      * Non-virtual destructor; make this virtual if Hashtable is subclassed
      * in the future.
      */
     ~Hashtable();
     UObjectDeleter *setValueDeleter(UObjectDeleter *fn);
     int32_t count() const;
     void* put(const UnicodeString& key, void* value, UErrorCode& status);
     int32_t puti(const UnicodeString& key, int32_t value, UErrorCode& status);
     void* get(const UnicodeString& key) const;
     int32_t geti(const UnicodeString& key) const;
     void* remove(const UnicodeString& key);
     int32_t removei(const UnicodeString& key);
     void removeAll(void);
     const UHashElement* find(const UnicodeString& key) const;
     const UHashElement* nextElement(int32_t& pos) const;
     UKeyComparator* setKeyComparator(UKeyComparator*keyComp);
     UValueComparator* setValueComparator(UValueComparator* valueComp);
     UBool equals(const Hashtable& that) const;
 private:
     Hashtable(const Hashtable &other); // forbid copying of this class
     Hashtable &operator=(const Hashtable &other); // forbid copying of this class
 };
 /*********************************************************************
  * Implementation
  ********************************************************************/
 inline void Hashtable::init(UHashFunction *keyHash, UKeyComparator *keyComp,
                             UValueComparator *valueComp, UErrorCode& status) {
     if (U_FAILURE(status)) {
         return;
     }
     uhash_init(&hashObj, keyHash, keyComp, valueComp, &status);
     if (U_SUCCESS(status)) {
         hash = &hashObj;
         uhash_setKeyDeleter(hash, uprv_deleteUObject);
     }
 }
 inline Hashtable::Hashtable(UKeyComparator *keyComp, UValueComparator *valueComp,
                  UErrorCode& status) : hash(0) {
     init( uhash_hashUnicodeString, keyComp, valueComp, status);
 }
 inline Hashtable::Hashtable(UBool ignoreKeyCase, UErrorCode& status)
  : hash(0)
 {
     init(ignoreKeyCase ? uhash_hashCaselessUnicodeString
                         : uhash_hashUnicodeString,
             ignoreKeyCase ? uhash_compareCaselessUnicodeString
                         : uhash_compareUnicodeString,
             NULL,
             status);
 }
 inline Hashtable::Hashtable(UErrorCode& status)
  : hash(0)
 {
     init(uhash_hashUnicodeString, uhash_compareUnicodeString, NULL, status);
 }
 inline Hashtable::Hashtable()
  : hash(0)
 {
     UErrorCode status = U_ZERO_ERROR;
     init(uhash_hashUnicodeString, uhash_compareUnicodeString, NULL, status);
 }
 inline Hashtable::~Hashtable() {
     if (hash != NULL) {
         uhash_close(hash);
     }
 }
 inline UObjectDeleter *Hashtable::setValueDeleter(UObjectDeleter *fn) {
     return uhash_setValueDeleter(hash, fn);
 }
 inline int32_t Hashtable::count() const {
     return uhash_count(hash);
 }
 inline void* Hashtable::put(const UnicodeString& key, void* value, UErrorCode& status) {
     return uhash_put(hash, new UnicodeString(key), value, &status);
 }
 inline int32_t Hashtable::puti(const UnicodeString& key, int32_t value, UErrorCode& status) {
     return uhash_puti(hash, new UnicodeString(key), value, &status);
 }
 inline void* Hashtable::get(const UnicodeString& key) const {
     return uhash_get(hash, &key);
 }
 inline int32_t Hashtable::geti(const UnicodeString& key) const {
     return uhash_geti(hash, &key);
 }
 inline void* Hashtable::remove(const UnicodeString& key) {
     return uhash_remove(hash, &key);
 }
 inline int32_t Hashtable::removei(const UnicodeString& key) {
     return uhash_removei(hash, &key);
 }
 inline const UHashElement* Hashtable::find(const UnicodeString& key) const {
     return uhash_find(hash, &key);
 }
 inline const UHashElement* Hashtable::nextElement(int32_t& pos) const {
     return uhash_nextElement(hash, &pos);
 }
 inline void Hashtable::removeAll(void) {
     uhash_removeAll(hash);
 }
 inline UKeyComparator* Hashtable::setKeyComparator(UKeyComparator*keyComp){
     return uhash_setKeyComparator(hash, keyComp);
 }
 inline UValueComparator* Hashtable::setValueComparator(UValueComparator* valueComp){
     return uhash_setValueComparator(hash, valueComp);
 }
 inline UBool Hashtable::equals(const Hashtable& that)const{
    return uhash_equals(hash, that.hash);
 }
 U_NAMESPACE_END
 #endif

The Tor Browser / annotate

intl/icu/source/common/hash.h@6474c204b198 (annotated)

intl/icu/source/common/hash.h