MOOCHO (Single Doxygen Collection) Version of the Day
IterationPack_print_algorithm_step.cpp
Go to the documentation of this file.
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 <ostream>
00043 
00044 #include "IterationPack_print_algorithm_step.hpp"
00045 
00046 void IterationPack::print_algorithm_step( const Algorithm& algo
00047   , Algorithm::poss_type step_poss, EDoStepType type
00048   , Algorithm::poss_type assoc_step_poss, std::ostream& out )
00049 {
00050   out << "\n(" << algo.state().k() << ") " << step_poss;
00051   if(type == DO_MAIN_STEP) {
00052     out
00053       << ": \"" << algo.get_step_name(step_poss) << "\"";
00054   }
00055   else {
00056     EAssocStepType _type = (type == DO_PRE_STEP ? PRE_STEP : POST_STEP );
00057     int num_assoc_steps = algo.num_assoc_steps(step_poss,_type);
00058     out << ".";
00059     switch(_type) {
00060       case PRE_STEP:
00061         out << - num_assoc_steps + ((int)assoc_step_poss - 1);
00062         break;
00063       case POST_STEP:
00064         out << assoc_step_poss;
00065         break;
00066     }
00067     out << ": \"" << algo.get_assoc_step_name(step_poss,_type,assoc_step_poss) << "\"";
00068   }
00069   out << "\n";
00070 }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines