Evocosm - A C++ Framework for Evolutionary Computing

Main Index

Created by Scott Robert Ladd at Coyote Gulch Productions.


analyzer.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_ANALYZER_H)
00054 #define LIBEVOCOSM_ANALYZER_H
00055 
00056 // libevocosm
00057 #include "organism.h"
00058 #include "listener.h"
00059 
00060 namespace libevocosm
00061 {
00063 
00069     template <typename OrganismType>
00070     class analyzer : protected globals
00071     {
00072     public:
00074 
00078         analyzer(listener<OrganismType> & a_listener, size_t max_iterations = 0)
00079             : m_listener(a_listener),
00080               m_max_iterations(max_iterations)
00081         {
00082             // nada
00083         }
00084 
00086         analyzer(const analyzer & a_source)
00087             : m_listener(a_source.m_listener),
00088               m_max_iterations(a_source.m_max_iterations)
00089         {
00090             // nada
00091         }
00092 
00094         analyzer & operator = (const analyzer & a_source)
00095         {
00096             m_listener = a_source.m_listener;
00097             m_max_iterations = a_source.m_max_iterations;
00098         }
00099 
00101 
00108         virtual ~analyzer()
00109         {
00110             // nada
00111         }
00112 
00114 
00124         virtual bool analyze(const vector<OrganismType> & a_population,  size_t a_iteration)
00125         {
00126             if (m_max_iterations > 0)
00127                 return (a_iteration < m_max_iterations);
00128             else
00129                 return true;
00130         }
00131 
00132     protected:
00134         listener<OrganismType> & m_listener;
00135 
00137         size_t m_max_iterations;
00138     };
00139 };
00140 
00141 #endif

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