src.main/Cj_container_helper.hh

/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
 * mitie
 * Copyright (C) Jason Spencer 2009 <mitie@jasonspencer.org>
 * 
 * mitie 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.
 * 
 * mitie 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, see <http://www.gnu.org/licenses/>.
 */

#ifndef _CJ_CONTAINTER_HELPER_H_
#define _CJ_CONTAINTER_HELPER_H_ 1

namespace jsplib {


template <typename InIter, typename OutIter, typename Pred> OutIter copy_if(InIter begin, InIter end, OutIter outBegin, Pred p ) {
while ( begin != end ) {
        if(p(*begin)) *outBegin++ = *begin;
        ++begin;
}
return outBegin;
}


template < typename T, typename OutIter, typename Pred > void move_if( std::list <T> & from, OutIter to, Pred p ) {
typename std::list<T>::iterator begin = from.begin();
typename std::list<T>::iterator end = from.end();       // this is a list so the end iterator won't be invalidated when we ::erase()
while ( begin != end ) {
        if(p(*begin)) {
                *to++ = *begin;
                begin = from.erase(begin);
                continue;
        }
        ++begin;
}
}


template < class InIter, class searchT > inline InIter searchFirstField(const InIter start, const InIter end, const searchT & what) {
        InIter i (start);
        while ( i != end ) { if(i->first == what) break; ++i; }
        return i;
}


template < class InIter, class searchT > inline InIter searchSecondField(const InIter start, const InIter end, const searchT & what) {
        InIter i (start);
        while ( i != end ) { if(i->second == what) break; ++i; }
        return i;
}


template < typename U, typename V > U & first_of (std::pair<U,V> & p) { return p.first; }
template < typename U, typename V > V & second_of (std::pair<U,V> & p) { return p.second; }
template < typename U, typename V > const U & first_of_const (const std::pair<U,V> & p) { return p.first; }
template < typename U, typename V > const V & second_of_const (const std::pair<U,V> & p) { return p.second; }


} // namespace jsplib 

#endif // _CJ_CONTAINTER_HELPER_H_