CrystalSpace

Public API Reference

csutil/hashr.h
Go to the documentation of this file.
00001 /*
00002     Copyright (C) 2003 by Jorrit Tyberghein
00003               (C) 2003 by Frank Richter
00004 
00005     This library is free software; you can redistribute it and/or
00006     modify it under the terms of the GNU Library General Public
00007     License as published by the Free Software Foundation; either
00008     version 2 of the License, or (at your option) any later version.
00009 
00010     This library is distributed in the hope that it will be useful,
00011     but WITHOUT ANY WARRANTY; without even the implied warranty of
00012     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00013     Library General Public License for more details.
00014 
00015     You should have received a copy of the GNU Library General Public
00016     License along with this library; if not, write to the Free
00017     Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
00018 */
00019 
00024 #ifndef __CS_UTIL_HASHR_H__
00025 #define __CS_UTIL_HASHR_H__
00026 
00027 #include "csutil/hash.h"
00028  
00032 
00033 template <class T, class K = unsigned int> 
00034 class csHashReversible : public csHash<T, K>
00035 {
00036   csHash<K, T> reverse;
00037 public:
00051   csHashReversible (int size = 23, int grow_rate = 5, int max_size = 20000) :
00052     csHash<T, K> (size, grow_rate, max_size), 
00053     reverse (size, grow_rate, max_size)
00054   {
00055   }
00059   void Put (const K& key, const T &value)
00060   {
00061     csHash<T, K>::Put (key, value);
00062     reverse.Put (value, key);
00063   }
00064 
00069   void PutUnique (const K& key, const T &value)
00070   {
00071     csHash<T, K>::PutUnique (key, value);
00072     reverse.PutUnique (value, key);
00073   }
00074 
00078   bool Delete (const K& key, const T &value)
00079   {
00080     bool ret = csHash<T, K>::Delete (key, value);
00081     ret &= reverse.Delete (value, key);
00082     return ret;
00083   }
00084 
00088   bool DeleteAll (const K& key)
00089   {
00090     csArray<T> values = csHash<T,K>::GetAll (key);
00091     bool ret = csHash<T,K>::DeleteAll (key);
00092     for(size_t i=0; i<values.GetSize (); i++)
00093     {
00094       ret &= reverse.Delete (values[i], key);
00095     }
00096     return ret;
00097   }
00098 
00100   void DeleteAll ()
00101   {
00102     csHash<T,K>::DeleteAll ();
00103     reverse.DeleteAll ();
00104   }
00105 
00110   const K* GetKeyPointer (const T& key) const
00111   {
00112     return reverse.GetElementPointer (key);
00113   }
00114  
00119   const K& GetKey (const T& key, const K& fallback) const
00120   {
00121     return reverse.Get (key, fallback);
00122   }
00123 };
00124 
00127 #endif // __CS_UTIL_HASHR_H__

Generated for Crystal Space 2.0 by doxygen 1.7.6.1