/usr/include/trilinos/IterationPack_cast_iq.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 | // @HEADER
// ***********************************************************************
//
// Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
// Copyright (2003) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef GIP_CAST_IQ_H
#define GIP_CAST_IQ_H
#include <stdexcept>
#include <typeinfo>
#include "IterationPack_AlgorithmState.hpp"
#include "IterationPack_IterQuantityAccess.hpp"
namespace IterationPack {
/** \brief Lookup an iteration quantity by name and cast it
* to an <tt>IterQuantityAccess<T></tt> of the given type \c T.
* If the iteration quantity of that name does not
* exist then a <tt>AlgorithmState::DoesNotExist</tt> exception
* will be thrown. If the type of the iteration quantity
* is not of the type <tt>IterQuantityAcess<T></tt> (as determined
* by <tt>dynamic_cast<T></tt>) then the exception \c InvalidTypeCastException:
* will be thrown with a helpful error message.
*
* Note that using this function always cost <tt>O(s.num_iter_quantities())</tt>
* everytime it is called. Therefore, the developer should consider using the
* class \c CastIQMember instead if it is appropriate.
*/
template<class T>
IterQuantityAccess<T>& cast_iq(
AlgorithmState& state, const std::string& iq_name );
/** \brief . */
template<class T>
const IterQuantityAccess<T>& cast_iq(
const AlgorithmState& state, const std::string& iq_name );
/** \brief Lookup an iteration quantity using its id and cast it
* to an <tt>IterQuantityAccess<T></tt> of the given type \c T.
*
* @param state [in]
*
* If the iteration quantity with that id does not
* exist then a <tt>AlgorithmState::DoesNotExist</tt> exception
* will be thrown. If the type of the iteration quantity
* is not of the type <tt>IterQuantityAcess<T></tt> (as determined
* by <tt>dynamic_cast<T></tt>) then the exception \c InvalidTypeCastException:
* will be thrown with a helpful error message.
*
* Note that using this function always cost just <tt>O(1)</tt> everytime
* it is called.
*/
template<class T>
IterQuantityAccess<T>& cast_iq(
AlgorithmState& state, const AlgorithmState::iq_id_type iq_id, const std::string& iq_name );
/** \brief . */
template<class T>
const IterQuantityAccess<T>& cast_iq(
const AlgorithmState& state, const AlgorithmState::iq_id_type iq_id, const std::string& iq_name );
// Helper function
void imp_cast_iq_throw_error(
const std::string& iq_name
,const std::string& iq_is_type_name
,const std::string& iq_want_type_name
);
void imp_cast_iq_throw_error(
const AlgorithmState::iq_id_type iq_id
,const std::string& iq_name
,const std::string& iq_is_type_name
,const std::string& iq_want_type_name
);
// ///////////////////
// Inline definitions
template<class T>
//inline
IterQuantityAccess<T>& cast_iq(
AlgorithmState& state, const std::string& iq_name )
{
IterQuantity
&iq = state.iter_quant( iq_name );
IterQuantityAccess<T>
*p = dynamic_cast<IterQuantityAccess<T>*>( &iq );
// will throw exception if iq_name does not exist
if( !p )
imp_cast_iq_throw_error( iq_name, typeName(iq), TypeNameTraits<T>::name() );
return *p;
}
template<class T>
//inline
const IterQuantityAccess<T>& cast_iq(
const AlgorithmState& state, const std::string& iq_name )
{
const IterQuantity
&iq = state.iter_quant( iq_name );
const IterQuantityAccess<T>
*p = dynamic_cast<const IterQuantityAccess<T>*>( &iq );
// will throw exception if iq_name does not exist
if( !p )
imp_cast_iq_throw_error( iq_name, typeName(iq), TypeNameTraits<T>::name() );
return *p;
}
template<class T>
//inline
IterQuantityAccess<T>& cast_iq(
AlgorithmState& state, const AlgorithmState::iq_id_type iq_id, const std::string& iq_name )
{
IterQuantity
&iq = state.iter_quant( iq_id );
IterQuantityAccess<T>
*p = dynamic_cast<IterQuantityAccess<T>*>( &iq );
// will throw exception if iq_name does not exist
if( !p )
imp_cast_iq_throw_error( iq_id, iq_name, typeName(iq), TypeNameTraits<T>::name() );
return *p;
}
template<class T>
//inline
const IterQuantityAccess<T>& cast_iq(
const AlgorithmState& state, const AlgorithmState::iq_id_type iq_id, const std::string& iq_name )
{
IterQuantity
&iq = state.iter_quant( iq_id );
const IterQuantityAccess<T>
*p = dynamic_cast<const IterQuantityAccess<T>*>( &iq );
// will throw exception if iq_name does not exist
if( !p )
imp_cast_iq_throw_error( iq_id, iq_name, typeName(iq), TypeNameTraits<T>::name() );
return *p;
}
} // namespace IterationPack
#endif // GIP_CAST_IQ_H
|