sprint/container/unordered_set.h

Go to the documentation of this file.

/******************************************************************************
*   sprint::unordered_set
*
*   Copyright (C) 2005-2011  Paolo Medici <www.pmx.it>
*
*  This library is free software; you can redistribute it and/or
*  modify it under the terms of the GNU Lesser General Public
*  License as published by the Free Software Foundation; either
*  version 2.1 of the License, or (at your option) any later version.
*
*  This library 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
*  Lesser General Public License for more details.
*
*  You should have received a copy of the GNU Lesser General Public
*  License along with this library; if not, write to the Free Software
*  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
*
*******************************************************************************/

#ifndef _SPRINT_UNORDERED_SET_H
#define _SPRINT_UNORDERED_SET_H

#include <vector>

namespace sprint {

template <typename _Key>
class unordered_set: public std::vector< _Key > {
        public:
    typedef _Key                                                                key_type;
        typedef typename std::vector< _Key >    parent;
        public:
        typedef typename parent::iterator               iterator;
    typedef typename parent::const_iterator         const_iterator;    
        public:
    
                iterator find(const key_type & __x)     {
                        for(iterator i = parent::begin(); i!= parent::end(); i++)
                                if( *i == __x)
                                        return i;
                        return parent::end();
                        }
                const_iterator find(const key_type & __x)       const {
                        for(const_iterator i = parent::begin(); i!= parent::end(); i++)
                                if( *i == __x)
                                                return i;
                        return parent::end();
                }       
                
                bool insert(const key_type & __x)
                {
         if(find(__x) == parent::end())
            {
            parent::push_back(__x);
            return true;
            }
            else
            return false;
        }
};

}

#endif