Saf/Collection/TreeSet.h

Go to the documentation of this file.

/*
    This file is part of Simple Application Framework (Saf) library.
    Copyright (C) 2010 - 2012 Ondrej Danek <ondrej.danek@gmail.com>

    This library 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 3 of the License, or
    (at your option) any later version.

    Saf 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 Simple Application Framework library. If not, 
    see <http://www.gnu.org/licenses/>.
*/

#ifndef SAF_COLLECTION_TREESET_H
#define SAF_COLLECTION_TREESET_H

#include "../Algo/Struct/RedBlackTree.h"
#include "../Algo/Predicate.h"
#include "../Algo/Basic.h"

namespace Saf
{
    namespace Collection
    {
        template <class ValType, class CompType = Algo::Predicate::Less<ValType> > 
        class TreeSet
            : public Algo::Struct::RedBlackTree<ValType,ValType,Algo::Identity<ValType>,CompType>
        {
        protected:            
            typedef Algo::Struct::RedBlackTree<ValType,ValType,Algo::Identity<ValType>,CompType> BaseType;
            typedef TreeSet<ValType,CompType> MyType;

        public:
            typedef typename BaseType::Iterator Iterator;
            typedef typename BaseType::ConstIterator ConstIterator;

        public:
            TreeSet()
                : BaseType()
            {}

            TreeSet(const MyType& m) 
                : BaseType(m)
            {}

            MyType& operator=(const MyType& m)
            {
                BaseType::operator=(m);
                return *this;
            }

            MyType& Swap(MyType& m)
            {
                BaseType::Swap(m);
                return *this;
            }
        };
    }

    namespace Algo
    {
        // Swap specialization for set container.
        template <class ValType, class CompType>
        struct SwapFunc< Collection::TreeSet<ValType,CompType> >
        {
            void operator()(Collection::TreeSet<ValType,CompType>& x, 
                Collection::TreeSet<ValType,CompType>& y)
            {
                x.Swap(y);
            }
        };
    }
}

#endif