# IterationPack_print_algorithm_step.cpp

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 // This library is free software; you can redistribute it and/or modify
00011 // it under the terms of the GNU Lesser General Public License as
00012 // published by the Free Software Foundation; either version 2.1 of the
00014 //
00015 // This library is distributed in the hope that it will be useful, but
00016 // WITHOUT ANY WARRANTY; without even the implied warranty of
00017 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00018 // Lesser General Public License for more details.
00019 //
00020 // You should have received a copy of the GNU Lesser General Public
00021 // License along with this library; if not, write to the Free Software
00022 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
00023 // USA
00024 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
00025 //
00026 // ***********************************************************************
00028
00029 #include <ostream>
00030
00031 #include "IterationPack_print_algorithm_step.hpp"
00032
00033 void IterationPack::print_algorithm_step( const Algorithm& algo
00034   , Algorithm::poss_type step_poss, EDoStepType type
00035   , Algorithm::poss_type assoc_step_poss, std::ostream& out )
00036 {
00037   out << "\n(" << algo.state().k() << ") " << step_poss;
00038   if(type == DO_MAIN_STEP) {
00039     out
00040       << ": \"" << algo.get_step_name(step_poss) << "\"";
00041   }
00042   else {
00043     EAssocStepType _type = (type == DO_PRE_STEP ? PRE_STEP : POST_STEP );
00044     int num_assoc_steps = algo.num_assoc_steps(step_poss,_type);
00045     out << ".";
00046     switch(_type) {
00047       case PRE_STEP:
00048         out << - num_assoc_steps + ((int)assoc_step_poss - 1);
00049         break;
00050       case POST_STEP:
00051         out << assoc_step_poss;
00052         break;
00053     }
00054     out << ": \"" << algo.get_assoc_step_name(step_poss,_type,assoc_step_poss) << "\"";
00055   }
00056   out << "\n";
00057 }

Generated on Tue Jul 13 09:28:36 2010 for IterationPack: General framework for building iterative algorithms by  1.4.7