Utility.h File Reference

#include <algorithm>
#include <utility>
#include <vector>

Go to the source code of this file.

Macros
#define	_H_FACILITIES_UTILITY

Functions
template<class FwdIt, class UniPred, class BinPred>
std::pair< FwdIt, FwdIt >	adjacent_find_if (const FwdIt &first, const FwdIt &last, UniPred if_pred, BinPred adj_pred)
template<class FwdIt, class UniPred, class BinPred>
std::vector< FwdIt >	adjacent_find_multiple (const FwdIt &first, const FwdIt &last, UniPred if_pred, BinPred adj_pred, unsigned N=2)

Macro Definition Documentation

_H_FACILITIES_UTILITY

#define _H_FACILITIES_UTILITY

Definition at line 5 of file Calibration/facilities/include/facilities/Utility.h.

Function Documentation

adjacent_find_if()

template<class FwdIt, class UniPred, class BinPred>

std::pair< FwdIt, FwdIt > adjacent_find_if ( const FwdIt & first, const FwdIt & last, UniPred if_pred, BinPred adj_pred )

inline

Definition at line 20 of file Calibration/facilities/include/facilities/Utility.h.

                                                                                     {
  FwdIt i = std::find_if( first, last, if_pred );
  FwdIt j = i;
  if ( i != last ) i = std::find_if( ++i, last, if_pred );
  while ( i != last )
  {
    if ( adj_pred( ( *j ), ( *i ) ) ) return std::make_pair( j, i );
    j = i++;
    while ( !( if_pred( *i ) ) && ( i != last ) ) ++i;
  }
  return std::make_pair( last, last );
}

Referenced by adjacent_find_multiple().

adjacent_find_multiple()

template<class FwdIt, class UniPred, class BinPred>

std::vector< FwdIt > adjacent_find_multiple ( const FwdIt & first, const FwdIt & last, UniPred if_pred, BinPred adj_pred, unsigned N = 2 )

inline

Definition at line 35 of file Calibration/facilities/include/facilities/Utility.h.

{
  std::vector<FwdIt>      itvec;
  std::pair<FwdIt, FwdIt> adjpr1 = adjacent_find_if( first, last, if_pred, adj_pred );
  if ( adjpr1.second == last ) return itvec;
 
  itvec.push_back( adjpr1.first );
  itvec.push_back( adjpr1.second );
  std::pair<FwdIt, FwdIt> adjpr2;
 
  while ( ( itvec.size() < N ) && ( adjpr1.second != last ) )
  {
    adjpr2 = adjacent_find_if( adjpr1.second, last, if_pred, adj_pred );
    if ( adjpr2.second == last ) return std::vector<FwdIt>();
    if ( adj_pred( ( *adjpr1.second ), ( *adjpr2.second ) ) ) itvec.push_back( adjpr2.second );
    else
    {
      itvec.clear();
      itvec.push_back( adjpr2.first );
      itvec.push_back( adjpr2.second );
    }
    adjpr1.second = adjpr2.second;
  }
  return itvec;
}