Evocosm - A C++ Framework for Evolutionary Computing

Main Index

Created by Scott Robert Ladd at Coyote Gulch Productions.


landscape.h
00001 /*
00002     Evocosm is a C++ framework for implementing evolutionary algorithms.
00003 
00004     Copyright 2011 Scott Robert Ladd. All rights reserved.
00005 
00006     Evocosm is user-supported open source software. Its continued development is dependent
00007     on financial support from the community. You can provide funding by visiting the Evocosm
00008     website at:
00009 
00010         http://www.coyotegulch.com
00011 
00012     You may license Evocosm in one of two fashions:
00013 
00014     1) Simplified BSD License (FreeBSD License)
00015 
00016     Redistribution and use in source and binary forms, with or without modification, are
00017     permitted provided that the following conditions are met:
00018 
00019     1.  Redistributions of source code must retain the above copyright notice, this list of
00020         conditions and the following disclaimer.
00021 
00022     2.  Redistributions in binary form must reproduce the above copyright notice, this list
00023         of conditions and the following disclaimer in the documentation and/or other materials
00024         provided with the distribution.
00025 
00026     THIS SOFTWARE IS PROVIDED BY SCOTT ROBERT LADD ``AS IS'' AND ANY EXPRESS OR IMPLIED
00027     WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
00028     FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SCOTT ROBERT LADD OR
00029     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00030     CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
00031     SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
00032     ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00033     NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
00034     ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00035 
00036     The views and conclusions contained in the software and documentation are those of the
00037     authors and should not be interpreted as representing official policies, either expressed
00038     or implied, of Scott Robert Ladd.
00039 
00040     2) Closed-Source Proprietary License
00041 
00042     If your project is a closed-source or proprietary project, the Simplified BSD License may
00043     not be appropriate or desirable. In such cases, contact the Evocosm copyright holder to
00044     arrange your purchase of an appropriate license.
00045 
00046     The author can be contacted at:
00047 
00048           scott.ladd@coyotegulch.com
00049           scott.ladd@gmail.com
00050           http:www.coyotegulch.com
00051 */
00052 
00053 #if !defined(LIBEVOCOSM_LANDSCAPE_H)
00054 #define LIBEVOCOSM_LANDSCAPE_H
00055 
00056 // libevocosm
00057 #include "organism.h"
00058 
00059 #ifdef _OPENMP
00060 #include "omp.h"
00061 #endif
00062 
00063 namespace libevocosm
00064 {
00066 
00079     template <class OrganismType>
00080     class landscape : protected globals
00081     {
00082         public:
00084 
00088             landscape(listener<OrganismType> & a_listener)
00089               : m_listener(a_listener)
00090             {
00091                 // nada
00092             }
00093 
00095             landscape(const landscape & a_source)
00096               : m_listener(a_source.m_listener)
00097             {
00098                 // nada
00099             }
00100 
00102             landscape & operator = (const landscape & a_source)
00103             {
00104                 m_listener = a_source.m_listener;
00105                 return *this;
00106             }
00107 
00109 
00116             virtual ~landscape()
00117             {
00118                 // nada
00119             }
00120 
00122 
00128             virtual double test(OrganismType & a_organism, bool a_verbose = false) const = 0;
00129 
00131 
00136             virtual double test(vector<OrganismType> & a_population) const
00137             {
00138                 double result = 0.0;
00139 
00140                 for (int n = 0; n < (int)a_population.size(); ++n)
00141                 {
00142                     a_population[n].fitness = test(a_population[n]);
00143                     result += a_population[n].fitness;
00144                 }
00145 
00146                 // return average fitness
00147                 return 0.0; // result / (double)a_population.size();
00148             }
00149 
00150         protected:
00152             listener<OrganismType> & m_listener;
00153     };
00154 };
00155 
00156 #endif

© 1996-2005 Scott Robert Ladd. All rights reserved.
HTML documentation generated by Dimitri van Heesch's excellent Doxygen tool.