landscape.h

//---------------------------------------------------------------------
//  Algorithmic Conjurings @ http://www.coyotegulch.com
//  Evocosm -- An Object-Oriented Framework for Evolutionary Algorithms
//
//  landscape.h
//---------------------------------------------------------------------
//
//  Copyright 1996, 1999, 2002, 2003, 2004, 2005, 2007 Scott Robert Ladd
//
//  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.
//
//-----------------------------------------------------------------------
//
//  For more information on this software package, please visit
//  Scott's web site, Coyote Gulch Productions, at:
//
//      http://www.coyotegulch.com
//  
//-----------------------------------------------------------------------

#if !defined(LIBEVOCOSM_LANDSCAPE_H)
#define LIBEVOCOSM_LANDSCAPE_H

// libevocosm
#include "organism.h"

#include <iostream>
#include <iomanip>

namespace libevocosm
{

    template <class OrganismType>
    class landscape : protected globals
    {
        public:

            landscape(listener & a_listener)
              : m_listener(a_listener)
            {
                // nada
            }

            landscape(const landscape & a_source)
              : m_listener(a_source.m_listener)
            {
                // nada
            }

            landscape & operator = (const landscape & a_source)
            {
                m_listener = a_source.m_listener;
                return *this;
            }


            virtual ~landscape()
            {
                // nada
            }


            virtual double test(OrganismType & a_organism, bool a_verbose = false) const = 0;


            virtual double test_pop(vector<OrganismType> & a_population) const
            {
                double result = 0.0;
                int n = 0;
                int stop = (int)a_population.size();

                #ifdef _OPENMP
                #pragma omp parallel for schedule(static) reduction(+:result) private(n)
                #endif
                for (n = 0; n < stop; ++n)
                {
                    a_population[n].fitness() = test(a_population[n]);
                    result += a_population[n].fitness();
                }

                // algorithm doesn't use this return value, so return nothing.
                return result / (double)a_population.size();
            }
        
        protected:
            listener & m_listener;
    };
};

#endif