Home    News    Components    Get ViTooKi    Documentation    Community    Developers    @sf.net  

Info

Last update:
12 Feb 2007

Documentation

Doxygen LXR

PointerHashTable.hpp

 /***********************************************************************
 *                                                                      *
 * ViTooKi                                                              *
 *                                                                      *
 * title:       HashTable.hpp                                          *
 *                                                                      *
 *                                                                      *
 *                                                                      *
 * ITEC institute of the University of Klagenfurt (Austria)             *
 * http://www.itec.uni-klu.ac.at                                        *
 *                                                                      *
 *                                                                      *
 * For more information visit the ViTooKi homepage:                     *
 * http://ViTooKi.sourceforge.net                                       *
 * vitooki-user@lists.sourceforge.net                                   *
 * vitooki-devel@lists.sourceforge.net                                  *
 *                                                                      *
 * This file is part of ViTooKi, a free video toolkit.                  *
 * ViTooKi is free software; you can redistribute it and/or             *
 * modify it under the terms of the GNU General Public License          *
 * as published by the Free Software Foundation; either version 2       *
 * of the License, or (at your option) any later version.               *
 *                                                                      *
 * This program is distributed in the hope that it will be useful,      *
 * but WITHOUT ANY WARRANTY; without even the implied warranty of       *
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the         *
 * GNU General Public License for more details.                         *
 *                                                                      *
 * You should have received a copy of the GNU General Public License    *
 * along with this program; if not, write to the Free Software          *
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,               *
 * MA  02111-1307, USA.                                                 *
 *                                                                      *
 ***********************************************************************/

 /***********************************************************************
 *                                                                      *
 *  REVISION HISTORY:                                                   *
 *                                                                      *
 *                                                                      *
 *                                                                      *
 ***********************************************************************/
#ifndef VITOOKI_PS_POINTERHASHTABLE_HPP
#define VITOOKI_PS_POINTERHASHTABLE_HPP
#include <assert.h>
template<class T> class PointerHashTable 
{
        std::list<T> invalid;
        std::list<T>* data;
        int size;
        unsigned int* keys;

public:
        PointerHashTable(int siz) {
                size=siz;
                data=new std::list<T>[size];
                keys=new unsigned int[size];
        };
        ~PointerHashTable() {
                for(unsigned int i=0;i<size;i++) {
                        freeElementsForPos(i);
                }
                delete[] data; delete[] keys;
        };

        void put(T& elem,unsigned int key) {
                unsigned int pos=key%size;
                assert(elem != NULL);
                // if we receive another element that maps to the same pos but has
                // a different key then we delete it!
                if(!data[pos].empty() && keys[pos]!=key)
                        freeElementsForKey(pos);
                
                data[pos].push_back(elem);
        };

        std::list<T>& get(unsigned int key) {
                unsigned int pos=key%size;
                if(keys[pos]==key)
                        return data[pos];
                return invalid;
        };
        
        void unlinkElementsForKey(const unsigned int key) {
                unsigned int pos=key%size;
                if(!data[pos].empty()) {
                        list<T>::iterator li;
                        while(!data[pos].empty()) {
                                data[pos].pop_front();
                        }
                }
        }
        void freeElementsForKey(const unsigned int key) {
                unsigned int pos=key%size;
                if(keys[pos]==key)
                        freeElementsForPos(pos);
        }

protected:
        void freeElementsForPos(const unsigned int p) {
                unsigned int pos=p%size;
                if(!data[pos].empty()) {
                        list<T>::iterator li;
                        while(!data[pos].empty()) {
                                li=data[pos].begin();
                                if(*li)
                                        delete (*li);
                                data[pos].pop_front();
                        }
                }
        };

};
#endif

© ViTooKi 2003 :: [Lite version] Created with Doxygen