util.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2004 by Ilya A. Volynets-Evenbakh                       *
 *   ilya@total-knowledge.com                                              *
 *                                                                         *
 *   This program 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.             *
 ***************************************************************************/
#ifndef CSERVUTIL_H
#define CSERVUTIL_H

#include <string>
#include <list>
#include <vector>
#include <map>
#include <memory>
#include <boost/shared_ptr.hpp>
#include <algorithm>
#include <ext/functional>
//#include <ext/hash_fun.h>

namespace container {
namespace util {

struct TrEq
{
    char operator() (char c) const  { return (c!='=' && c!='/')?c:'0'; }
};
typedef std::pair<std::string, std::string> nvpair;
typedef std::list<nvpair> pairlist_t;
typedef std::map<std::string,boost::shared_ptr<void> > attr_t;
typedef std::map<std::string,std::string> param_t;
typedef std::multimap<std::string,std::string> mparam_t;
unsigned long getRandomLong();
std::string getRandomString(int len);

template <class T>
 std::auto_ptr< std::vector<std::string> > getMapKeyNames(const std::map<std::string,T>& map)
{
    std::auto_ptr<std::vector<std::string> > ret(new std::vector<std::string>);
    std::back_insert_iterator<std::vector<std::string> > ii(*ret);
    std::transform(map.begin(), map.end(), ii, __gnu_cxx::select1st<std::pair<std::string, T> >());
    return ret;
}

template <class T>
struct GetMKey: public std::unary_function<const std::pair<std::string, T >&,void>
{
    std::vector<std::string>& m_out;
    std::string m_last;
    GetMKey(std::vector<std::string>& out):m_out(out){}
    void operator()(const std::pair<std::string, T >& p)
    {
        if( m_last != p.first)
            m_out.push_back(p.first);
        m_last=p.first;
    }
};

template <class T>
 std::auto_ptr< std::vector<std::string> > getMapKeyNames(const std::multimap<std::string,T>& map)
{
    std::auto_ptr<std::vector<std::string> > ret(new std::vector<std::string>);
    GetMKey<T> getKey(*ret);
    std::for_each(map.begin(), map.end(), getKey);
    return ret;
}

template <typename K, typename V>
 std::auto_ptr< std::vector<V> > getMapValues(const std::multimap<K, V>& map, const K& name)
{
    std::auto_ptr<std::vector<V> > ret(new std::vector<V>);
    std::back_insert_iterator<std::vector<V> > ii(*ret);
    transform(map.lower_bound(name), map.upper_bound(name), ii, __gnu_cxx::select2nd<std::pair<K, V> >());
    return ret;
}

}
}
#endif