CODE:

#include 
#include 

/*
Listの実験
Haskell:
map f [a, b, c...] = [f a, f b, f c, ...]
filter p xs = [x|xb)->[a]->[b]
template void map(T (&f)(S), std::list &a, std::list &b)
{
  typename std::list::iterator it_a = a.begin();
  while( it_a != a.end() ){
    b.push_back(f(*it_a));
    it_a++;
  }
}

// filter :: (a->Bool)->[a]->[a]
template void filter(bool (&p)(S), std::list &a, std::list &b)
{
  typename std::list::iterator it_a = a.begin();
  while( it_a != a.end() ){
    if( p(*it_a) == true )
      b.push_back(*it_a);

    it_a++;
  }
}

// foldl :: (a->b->a)->a->[b]->a
template S foldl(S (&f)(S, T), S a, std::list &b)
{
  S fold;
  typename std::list::iterator it_b = b.begin();
  while( it_b != b.end() ){
    fold = f(a, *it_b);
    a = fold;
    it_b++;
  }
  return fold;
}

double add_double(const int a){ return a+0.5; }
bool even(const int a){ return a%2 == 0; }
int add(const int a, const int b){ return a+b; }
int multiple(const int a, const int b){ return a*b; }

int main()
{
  std::list range_10;
  std::list empty;
  std::list empty2;

  for(int i = 0; i (add_double, range_10, empty);
  filter(even, range_10, empty2);
  
  std::list::iterator it = empty.begin();
  while( it != empty.end() ){
    std::cout ::iterator it2 = empty2.begin();
  while( it2 != empty2.end() ){
    std::cout (add, 0, range_10) (multiple, 1, range_10) <；

参考文献：
[url]http://www.geocities.jp/ky_webid/cpp/language/index.html[/url]
[url]http://www.geocities.jp/ky_webid/cpp/library/index.html[/url]