version 1.8, 2001/06/16 17:30:37
|
version 1.28, 2008/11/12 21:27:05
|
|
|
//%///////////////////////////////////////////////////////////////////////////// |
//%2006//////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001 The Open group, BMC Software, Tivoli Systems, IBM |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
|
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; Symantec Corporation; The Open Group. |
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a copy | // Permission is hereby granted, free of charge, to any person obtaining a copy |
// of this software and associated documentation files (the "Software"), to | // of this software and associated documentation files (the "Software"), to |
|
|
// | // |
//============================================================================== | //============================================================================== |
// | // |
// Author: Mike Brasher (mbrasher@bmc.com) |
|
// |
|
// Modified By: |
|
// |
|
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
#ifndef Pegasus_HashTable_h | #ifndef Pegasus_HashTable_h |
|
|
| |
#include <Pegasus/Common/Config.h> | #include <Pegasus/Common/Config.h> |
#include <Pegasus/Common/String.h> | #include <Pegasus/Common/String.h> |
|
#include <Pegasus/Common/CIMObjectPath.h> |
|
#include <Pegasus/Common/Linkage.h> |
| |
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
|
|
static Uint32 hash(Uint32 x) { return x + 13; } | static Uint32 hash(Uint32 x) { return x + 13; } |
}; | }; |
| |
|
PEGASUS_TEMPLATE_SPECIALIZATION struct HashFunc <CIMObjectPath> |
|
{ |
|
static Uint32 hash (const CIMObjectPath & path) |
|
{ |
|
return path.makeHashCode (); |
|
} |
|
}; |
|
|
|
// |
|
// Computes a hash code for a string without regard to case. For example, it |
|
// yields the same hash code for "AB", "ab", "Ab", and "aB". |
|
// |
|
struct PEGASUS_COMMON_LINKAGE HashLowerCaseFunc |
|
{ |
|
static Uint32 hash(const String& str); |
|
}; |
|
|
/* This is a function object used by the HashTable to compare keys. This is | /* This is a function object used by the HashTable to compare keys. This is |
the default implementation. Others may be defined and passed in the | the default implementation. Others may be defined and passed in the |
template argument list to perform other kinds of comparisons. | template argument list to perform other kinds of comparisons. |
|
|
} | } |
}; | }; |
| |
|
PEGASUS_TEMPLATE_SPECIALIZATION struct EqualFunc <CIMObjectPath> |
|
{ |
|
static Boolean equal (const CIMObjectPath & x, const CIMObjectPath & y) |
|
{ |
|
return x.identical (y); |
|
} |
|
}; |
|
|
|
/* |
|
Equal function object that can be used by HashTable to compare keys that |
|
should be treated as case insensitive. |
|
|
|
This function can be used for hash table keys constructed from strings that |
|
should be treated as case insensitive (e.g. class names, namespace names, |
|
system names). |
|
|
|
Note: this function compares Strings based on the process locale. |
|
*/ |
|
struct EqualNoCaseFunc |
|
{ |
|
static Boolean equal (const String & x, const String & y) |
|
{ |
|
return (0 == String::compareNoCase (x, y)); |
|
} |
|
}; |
|
|
/* Representation for a bucket. The HashTable class derives from this | /* Representation for a bucket. The HashTable class derives from this |
bucket to append a key and value. This base class just defines | bucket to append a key and value. This base class just defines |
the pointer to the next bucket in the chain. | the pointer to the next bucket in the chain. |
|
|
_BucketBase* next; | _BucketBase* next; |
}; | }; |
| |
class _HashTableRep; |
|
|
|
/* This class implements a simple hash table forward iterator. */ | /* This class implements a simple hash table forward iterator. */ |
class PEGASUS_COMMON_LINKAGE _HashTableIteratorBase | class PEGASUS_COMMON_LINKAGE _HashTableIteratorBase |
{ | { |
public: | public: |
| |
_HashTableIteratorBase() : _first(0), _last(0), _bucket(0) { } |
_HashTableIteratorBase(_BucketBase** first, _BucketBase** last); |
| |
operator int() const { return _bucket != 0; } | operator int() const { return _bucket != 0; } |
| |
_HashTableIteratorBase operator++(int); |
void operator++(); |
| |
_HashTableIteratorBase& operator++(); |
void operator++(int) |
|
{ |
_HashTableIteratorBase(_BucketBase** first, _BucketBase** last); |
operator++(); |
|
} |
| |
protected: | protected: |
| |
|
// Note: The default copy constructor/assignment operator is used by the |
|
// postfix increment operator. The member pointers may be safely copied |
|
// because they refer to structures that must not change while the iterator |
|
// is in scope. |
|
|
_BucketBase** _first; | _BucketBase** _first; |
_BucketBase** _last; | _BucketBase** _last; |
_BucketBase* _bucket; | _BucketBase* _bucket; |
friend class _HashTableRep; |
|
}; | }; |
| |
// ATTN: reorganization not supported yet. | // ATTN: reorganization not supported yet. |
|
|
@param key void pointer to key. | @param key void pointer to key. |
@return pointer to bucket with that key or zero otherwise. | @return pointer to bucket with that key or zero otherwise. |
*/ | */ |
const _BucketBase* lookup(Uint32 hashCode, const void* key); |
const _BucketBase* lookup(Uint32 hashCode, const void* key) const; |
| |
/*- Removes the bucket with the given key. This method uses the | /*- Removes the bucket with the given key. This method uses the |
_BucketBase::equal() method to compare keys. | _BucketBase::equal() method to compare keys. |
|
|
{ | { |
public: | public: |
| |
_HashTableIterator() |
|
: _HashTableIteratorBase() { } |
|
|
|
_HashTableIterator(_BucketBase** first, _BucketBase** last) | _HashTableIterator(_BucketBase** first, _BucketBase** last) |
: _HashTableIteratorBase(first, last) { } | : _HashTableIteratorBase(first, last) { } |
| |
|
|
(which by the way has exactly the same effect). | (which by the way has exactly the same effect). |
| |
<pre> | <pre> |
typedef HashTable<String, Uint32, EqualFunc<String>, HashFunc<String>> HT; |
typedef HashTable<String, Uint32, |
|
EqualFunc<String>, HashFunc<String>> HT; |
</pre> | </pre> |
| |
The third and forth arguments are described more in detail later. |
The third and fourth arguments are described more in detail later. |
| |
Then, entries may be inserted like this: | Then, entries may be inserted like this: |
| |
|
|
} | } |
</pre> | </pre> |
| |
Note that only forward iteration is supported (no backwards iteration). |
Note that only forward iteration is supported (no backwards iteration), |
|
AND that the hashtable MUST NOT be modified during the iteration!!! |
| |
Equality of keys is determined using the EqualFunc class which is | Equality of keys is determined using the EqualFunc class which is |
the default third argument of the template argument list. A new function | the default third argument of the template argument list. A new function |
|
|
@param key key to be searched for | @param key key to be searched for |
@return true if hash table contains an entry with the given key. | @return true if hash table contains an entry with the given key. |
*/ | */ |
Boolean contains(const K& key) |
Boolean contains(const K& key) const |
{ | { |
V value; | V value; |
return lookup(key, value); | return lookup(key, value); |
|
|
@param value output value. | @param value output value. |
@return true if found; false otherwise. | @return true if found; false otherwise. |
*/ | */ |
Boolean lookup(const K& key, V& value); |
Boolean lookup(const K& key, V& value) const; |
|
|
|
/** Looks up the entry with the given key and returns a pointer to the |
|
value. Note that this pointer may become invalid when the HashTable |
|
is updated. |
|
@param key key of entry to be located. |
|
@param value Output pointer to the value. |
|
@return true if found; false otherwise. |
|
*/ |
|
Boolean lookupReference(const K& key, V*& value); |
| |
/** Removes the entry with the given key. | /** Removes the entry with the given key. |
@param key key of entry to be removed. | @param key key of entry to be removed. |
|
|
}; | }; |
| |
template<class K, class V, class E, class H> | template<class K, class V, class E, class H> |
inline Boolean HashTable<K, V, E, H>::lookup(const K& key, V& value) |
inline Boolean HashTable<K, V, E, H>::lookup(const K& key, V& value) const |
{ | { |
_Bucket<K, V, E>* bucket | _Bucket<K, V, E>* bucket |
= (_Bucket<K, V, E>*)_rep.lookup(H::hash(key), &key); | = (_Bucket<K, V, E>*)_rep.lookup(H::hash(key), &key); |
|
|
return false; | return false; |
} | } |
| |
|
template<class K, class V, class E, class H> |
|
inline Boolean HashTable<K, V, E, H>::lookupReference(const K& key, V*& value) |
|
{ |
|
_Bucket<K, V, E>* bucket = |
|
(_Bucket<K, V, E>*)_rep.lookup(H::hash(key), &key); |
|
|
|
if (bucket) |
|
{ |
|
value = &bucket->getValue(); |
|
return true; |
|
} |
|
|
|
return false; |
|
} |
|
|
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |
| |
#endif /* Pegasus_HashTable_h */ | #endif /* Pegasus_HashTable_h */ |