version 1.26.4.1, 2008/04/24 18:41:36
|
version 1.30, 2008/12/02 09:00:47
|
|
|
//%2006//////////////////////////////////////////////////////////////////////// |
//%LICENSE//////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
// Licensed to The Open Group (TOG) under one or more contributor license |
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with |
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
// this work for additional information regarding copyright ownership. |
// IBM Corp.; EMC Corporation, The Open Group. |
// Each contributor licenses this file to you under the OpenPegasus Open |
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
// Source License; you may not use this file except in compliance with the |
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
// License. |
// 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 |
// of this software and associated documentation files (the "Software"), to |
// copy of this software and associated documentation files (the "Software"), |
// deal in the Software without restriction, including without limitation the |
// to deal in the Software without restriction, including without limitation |
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
// the rights to use, copy, modify, merge, publish, distribute, sublicense, |
// sell copies of the Software, and to permit persons to whom the Software is |
// and/or sell copies of the Software, and to permit persons to whom the |
// furnished to do so, subject to the following conditions: |
// Software is furnished to do so, subject to the following conditions: |
// | // |
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN |
// The above copyright notice and this permission notice shall be included |
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED |
// in all copies or substantial portions of the Software. |
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT |
|
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR |
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
|
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
// | // |
//============================================================================== |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS |
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
|
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY |
|
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, |
|
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE |
|
// SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|
// |
|
////////////////////////////////////////////////////////////////////////// |
// | // |
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
|
|
| |
operator int() const { return _bucket != 0; } | operator int() const { return _bucket != 0; } |
| |
_HashTableIteratorBase operator++(int); |
void operator++(); |
| |
_HashTableIteratorBase& operator++(); |
void operator++(int) |
|
{ |
|
operator++(); |
|
} |
| |
protected: | protected: |
| |
|
|
| |
V& getValue() { return _value; } | V& getValue() { return _value; } |
| |
void putValue(const V& value) {_value = value;} |
|
|
|
private: | private: |
| |
K _key; | K _key; |
|
|
public: | public: |
| |
typedef _HashTableIterator<K, V, E> Iterator; | typedef _HashTableIterator<K, V, E> Iterator; |
typedef _Bucket<K, V, E> Bucket; |
|
| |
/* By default, we create this many chains initially */ | /* By default, we create this many chains initially */ |
enum { DEFAULT_NUM_CHAINS = 32 }; | enum { DEFAULT_NUM_CHAINS = 32 }; |
|
|
*/ | */ |
Boolean lookup(const K& key, V& value) const; | 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. |
@return true on success; false otherwise. | @return true on success; false otherwise. |
|
|
_rep.getChains(), _rep.getChains() + _rep.getNumChains()); | _rep.getChains(), _rep.getChains() + _rep.getNumChains()); |
} | } |
| |
/** Gets the entry pointer with the given key. |
|
@param key key of entry to be located. |
|
@param bucket output - pointer to entry with that key |
|
@return true if entry found; false otherwise. |
|
*/ |
|
Boolean getBucket(const K& key, _Bucket<K, V, E>*& bucket) const; |
|
|
|
private: | private: |
| |
_HashTableRep _rep; | _HashTableRep _rep; |
|
|
} | } |
| |
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>::getBucket( |
inline Boolean HashTable<K, V, E, H>::lookupReference(const K& key, V*& value) |
const K& key, _Bucket<K, V, E>*& bucket) const |
|
{ | { |
bucket = (_Bucket<K, V, E>*)_rep.lookup(H::hash(key), &key); |
_Bucket<K, V, E>* bucket = |
|
(_Bucket<K, V, E>*)_rep.lookup(H::hash(key), &key); |
| |
if (bucket) | if (bucket) |
{ | { |
|
value = &bucket->getValue(); |
return true; | return true; |
} | } |
| |
return false; | return false; |
} | } |
|
|
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |
| |
#endif /* Pegasus_HashTable_h */ | #endif /* Pegasus_HashTable_h */ |