|
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 <assert.h> 00043 00044 #include "IterationPack_AlgorithmSetOptions.hpp" 00045 #include "Teuchos_Assert.hpp" 00046 00047 // Define the options 00048 namespace { 00049 00050 const int local_num_options = 1; 00051 00052 enum local_EOptions { 00053 INTERRUPT_FILE_NAME 00054 }; 00055 00056 const char* local_SOptions[local_num_options] = { 00057 "interrupt_file_name" 00058 }; 00059 00060 inline 00061 std::string remove_quotes( const std::string &option_name, const std::string &str ) 00062 { 00063 TEUCHOS_TEST_FOR_EXCEPTION( 00064 str[0]!='\"' || str[str.length()-1]!='\"', std::logic_error 00065 ,"Error, the option \'" << option_name << "\' must have a single set of quotes around it!" 00066 ); 00067 if(str.length()==2) 00068 return std::string(""); 00069 return str.substr(1,str.length()-2); 00070 } 00071 00072 } // namespace 00073 00074 namespace IterationPack { 00075 00076 AlgorithmSetOptions::AlgorithmSetOptions( 00077 Algorithm* target 00078 , const char opt_grp_name[] ) 00079 : OptionsFromStreamPack::SetOptionsFromStreamNode( 00080 opt_grp_name, local_num_options, local_SOptions ) 00081 , OptionsFromStreamPack::SetOptionsToTargetBase< 00082 Algorithm >( target ) 00083 {} 00084 00085 void AlgorithmSetOptions::setOption( 00086 int option_num, const std::string& option_value ) 00087 { 00088 typedef Algorithm target_t; 00089 switch( (local_EOptions)option_num ) { 00090 case INTERRUPT_FILE_NAME : 00091 target().interrupt_file_name(remove_quotes("interrupt_file_name",option_value)); 00092 break; 00093 default: 00094 TEUCHOS_TEST_FOR_EXCEPT(true); // Local error only? 00095 } 00096 } 00097 00098 } // end namespace IterationPack
1.7.6.1