version 1.19, 2005/02/05 22:59:23
|
version 1.24, 2008/01/15 22:14:15
|
|
|
//%2005//////////////////////////////////////////////////////////////////////// |
//%2006//////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development | // Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. | // Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. | // IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; | // Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
// EMC Corporation; VERITAS Software Corporation; The Open Group. | // 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: Carol Ann Krug Graves, Hewlett-Packard Company |
|
// (carolann_graves@hp.com) |
|
// |
|
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
#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> | #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> |
Hash function object that converts to lowercase. |
|
|
|
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 converts to lower case based on the process locale. |
|
*/ |
|
struct HashLowerCaseFunc |
|
{ | { |
static Uint32 hash (const String & str) |
static Uint32 hash (const CIMObjectPath & path) |
{ | { |
String cpy (str); |
return path.makeHashCode (); |
cpy.toLower (); |
|
Uint32 h = 0; |
|
for (Uint32 i = 0, n = cpy.size (); i < n; i++) |
|
h = 5 * h + cpy [i]; |
|
return h; |
|
} | } |
}; | }; |
| |
|
// |
|
// 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 | Equal function object that can be used by HashTable to compare keys that |
should be treated as case insensitive. | should be treated as case insensitive. |
|
|
{ | { |
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++(); | _HashTableIteratorBase& operator++(); |
| |
_HashTableIteratorBase(_BucketBase** first, _BucketBase** last); |
|
|
|
protected: | protected: |
| |
|
_HashTableIteratorBase(const _HashTableIteratorBase&); |
|
_HashTableIteratorBase& operator=(const _HashTableIteratorBase&); |
|
|
_BucketBase** _first; | _BucketBase** _first; |
_BucketBase** _last; | _BucketBase** _last; |
_BucketBase* _bucket; | _BucketBase* _bucket; |
|
|
{ | { |
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: |
| |