|
IterationPack: General framework for building iterative algorithms
Version of the Day
|
00001 // @HEADER 00002 // *********************************************************************** 00003 // 00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization 00005 // Copyright (2003) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 // @HEADER 00041 00042 #include <algorithm> 00043 00044 #include "IterationPack_AlgorithmTrackerComposite.hpp" 00045 00046 namespace IterationPack { 00047 00048 AlgorithmTrackerComposite::AlgorithmTrackerComposite(const ostream_ptr_t& journal_out) 00049 : AlgorithmTracker(journal_out) 00050 {} 00051 00052 void AlgorithmTrackerComposite::initialize() 00053 { 00054 track_list_t::const_iterator 00055 itr = tracks_.begin(), itr_end = tracks_.end(); 00056 for(; itr != itr_end; ++itr) 00057 (*itr)->initialize(); 00058 } 00059 00060 void AlgorithmTrackerComposite::output_iteration( 00061 const Algorithm& algo 00062 ) const 00063 { 00064 track_list_t::const_iterator 00065 itr = tracks_.begin(), itr_end = tracks_.end(); 00066 for(; itr != itr_end; ++itr) 00067 (*itr)->output_iteration(algo); 00068 } 00069 00070 void AlgorithmTrackerComposite::output_final( 00071 const Algorithm& algo, EAlgoReturn algo_return 00072 ) const 00073 { 00074 track_list_t::const_iterator 00075 itr = tracks_.begin(), itr_end = tracks_.end(); 00076 for(; itr != itr_end; ++itr) 00077 (*itr)->output_final(algo,algo_return); 00078 } 00079 00080 } // end namespace IterationPack
1.7.6.1