template<class ArchiveImplementation>
class polymorphic_iarchive_route :
public polymorphic_iarchive,
- // note: gcc dynamic cross cast fails if the derivation below is
+ // note: gcc dynamic cross cast fails if the the derivation below is
// not public. I think this is a mistake.
public /*protected*/ ArchiveImplementation
{
}
// register type function
template<class T>
- const basic_pointer_iserializer *
+ const basic_pointer_iserializer *
register_type(T * t = NULL){
return ArchiveImplementation::register_type(t);
}
template<class ArchiveImplementation>
class polymorphic_oarchive_route :
public polymorphic_oarchive,
- // note: gcc dynamic cross cast fails if the derivation below is
+ // note: gcc dynamic cross cast fails if the the derivation below is
// not public. I think this is a mistake.
public /*protected*/ ArchiveImplementation
{
}
// register type function
template<class T>
- const basic_pointer_oserializer *
+ const basic_pointer_oserializer *
register_type(T * t = NULL){
return ArchiveImplementation::register_type(t);
}
// Cray employee), the release patch level is reported as "x". This gives
// versions that look like e.g. "8.6.x".
//
-// To accomplish this, the Cray compiler preprocessor inserts:
+// To accomplish this, the the Cray compiler preprocessor inserts:
//
// #define _RELEASE_PATCHLEVEL x
//
#define BOOST_MATH_DISABLE_STD_FPCLASSIFY
//#define BOOST_HAS_FPCLASSIFY
-#define BOOST_SP_USE_PTHREADS
-#define BOOST_AC_USE_PTHREADS
+#define BOOST_SP_USE_PTHREADS
+#define BOOST_AC_USE_PTHREADS
//
// Everything that follows is working around what are thought to be
#undef BOOST_NO_SFINAE_EXPR
#undef BOOST_NO_TWO_PHASE_NAME_LOOKUP
#undef BOOST_MATH_DISABLE_STD_FPCLASSIFY
-#undef BOOST_SP_USE_PTHREADS
-#undef BOOST_AC_USE_PTHREADS
+#undef BOOST_SP_USE_PTHREADS
+#undef BOOST_AC_USE_PTHREADS
#define BOOST_HAS_VARIADIC_TMPL
#define BOOST_HAS_UNISTD_H
this->assign(c_it(val, n), c_it());
}
- //! <b>Effects</b>: Assigns the range [first, last) to *this.
+ //! <b>Effects</b>: Assigns the the range [first, last) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or
//! T's constructor from dereferencing InIt throws.
#endif
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- //! <b>Effects</b>: Assigns the range [il.begin(), il.end()) to *this.
+ //! <b>Effects</b>: Assigns the the range [il.begin(), il.end()) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or
//! T's constructor from dereferencing std::initializer_list iterator throws.
this->assign(cvalue_iterator(t, n), cvalue_iterator());
}
- //! <b>Effects</b>: Assigns the range [first, last) to *this.
+ //! <b>Effects</b>: Assigns the the range [first, last) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or
//! T's constructor from dereferencing InpIt throws.
}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- //! <b>Effects</b>: Assigns the range [il.begin(), il.end()) to *this.
+ //! <b>Effects</b>: Assigns the the range [il.begin(), il.end()) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or
//! T's constructor from dereferencing initializer_list iterator throws.
#endif
- //! <b>Effects</b>: Assigns the range [first, last) to *this.
+ //! <b>Effects</b>: Assigns the the range [first, last) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment or
//! T's constructor/assignment from dereferencing InpIt throws.
}
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- //! <b>Effects</b>: Assigns the range [il.begin(), il.end()) to *this.
+ //! <b>Effects</b>: Assigns the the range [il.begin(), il.end()) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or
//! T's constructor from dereferencing iniializer_list iterator throws.
}
#endif
- //! <b>Effects</b>: Assigns the range [first, last) to *this.
+ //! <b>Effects</b>: Assigns the the range [first, last) to *this.
//!
//! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment or
//! T's constructor/assignment from dereferencing InpIt throws.
operations (add, subtract) and storage (minimize space to represent)
in a concrete class. Thus, the date uses a count internally to
represent a particular date. The calendar parameter defines
- the policies for converting the year-month-day and internal
+ the policies for converting the the year-month-day and internal
counted form here. Applications that need to perform heavy
formatting of the same date repeatedly will perform better
by using the year-month-day representation.
// }
/*! Operator allows for adding dissimilar int_adapter types.
- * The return type will match that of the calling object's type */
+ * The return type will match that of the the calling object's type */
template<class rhs_type>
inline
int_adapter operator+(const int_adapter<rhs_type>& rhs) const
}
/*! Operator allows for subtracting dissimilar int_adapter types.
- * The return type will match that of the calling object's type */
+ * The return type will match that of the the calling object's type */
template<class rhs_type>
inline
int_adapter operator-(const int_adapter<rhs_type>& rhs)const
/**
* @name Generate Label Map
* These type generators are responsible for instantiating an associative
- * container for the labeled graph. Note that the Selector must be
+ * container for the the labeled graph. Note that the Selector must be
* select a pair associative container or a vecS, which is only valid if
* Label is an integral type.
*/
// clean_up_embedding does some clean-up and fills in values that have
// to be computed lazily during the actual execution of the algorithm
// (for instance, whether or not a bicomp is flipped in the final
- // embedding). It's dispatched on the StoreEmbeddingPolicy, since
+ // embedding). It's dispatched on the the StoreEmbeddingPolicy, since
// it's not needed if an embedding isn't desired.
typename vertex_vector_t::reverse_iterator vi, vi_end;
new_start = false; //Setting the loop repetition status to false
//step 2
- //initialize the disance std-vector with 0
+ //initialize the the disance std-vector with 0
for(typename std::vector<typename graph_traits<Graph>::vertices_size_type>::iterator iter = dist.begin(); iter != dist.end(); ++iter) *iter = 0;
//generating the RLS (rooted level structure)
// There are, in fact 5 diagonals, but they only differ from zero on the first and last row,
// so we can patch up the tridiagonal row reduction algorithm to deal with two special rows.
// See Kress, equations 8.41
- // the "tridiagonal" matrix is:
+ // The the "tridiagonal" matrix is:
// 1 0 -1
// 1 4 1
// 1 4 1
#include <boost/config.hpp>
-// These are the "Sinus Cardinal" functions.
+// These are the the "Sinus Cardinal" functions.
namespace boost
{
#include <boost/config.hpp>
-// These are the "Hyperbolic Sinus Cardinal" functions.
+// These are the the "Hyperbolic Sinus Cardinal" functions.
namespace boost
{
}
// last observation, if we are still in observation interval
- // might happen due to finite precision problems when computing the time
+ // might happen due to finite precision problems when computing the the time
if( less_eq_with_sign( time , end_time , dt ) )
{
st.calc_state( time , start_state );
namespace boost { namespace numeric { namespace ublas {
- /** \brief Base class for uBLAS statically derived expressions using the Barton Nackman trick
+ /** \brief Base class for uBLAS statically derived expressions using the the Barton Nackman trick
*
* This is a NonAssignable class
* Directly implement nonassignable - simplifes debugging call trace!
#include <boost/config.hpp>
#include <boost/detail/workaround.hpp>
-// note: this version incorporates the related code into the
+// note: this version incorporates the related code into the the
// the same library as BOOST_ARCHIVE. This could change some day in the
// future
// the sequence of object initialization.
// Unfortunately, this triggers detectors of undefine behavior
// and reports an error. But I've been unable to find a different
- // of guarenteeing that the singleton is created at pre-main time.
+ // of guarenteeing that the the singleton is created at pre-main time.
use(* m_instance);
return static_cast<T &>(t);
// (2) a Base* cannot be converted to Derived* (so the base class is either ambiguous or virtual)
// With both conditions true, Base must be a virtual base of Derived.
// The "is_base_of" is only needed so the compiler can (but is not required to) error out if the types are incomplete.
- // This is in league with the expected behaviour.
+ // This is in league with the the expected behaviour.
template<class T, class U>
constexpr bool is_virtual_base_impl(...) { return true; }
\param [in] a_eAssociativity The associativity of the operator.
\param [in] a_bAllowOpt If this is true the operator may be optimized away.
- Adds a new Binary operator the parser instance.
+ Adds a new Binary operator the the parser instance.
*/
void ParserBase::DefineOprt(const string_type& a_sName, fun_type2 a_pFun, unsigned a_iPrec, EOprtAssociativity a_eAssociativity, bool a_bAllowOpt)
{
(-Control [UMFPACK_ALLOC_INIT]).
Regardless of the value of this parameter, a space equal to or
- greater than the bare minimum amount of memory needed to start
+ greater than the the bare minimum amount of memory needed to start
the factorization is always initially allocated. The bare initial
memory required is returned by umfpack_*_*symbolic in
Info [UMFPACK_VARIABLE_INIT_ESTIMATE] (an exact value, not an
Ax is optional; if Tx and/or Ax are not present (a (double *) NULL
pointer), then Ax is not computed. If present, Ax holds the
- numerical values of the real part of the sparse matrix A and Az
+ numerical values of the the real part of the sparse matrix A and Az
holds the imaginary parts. The nonzero pattern (row indices) for
column j is stored in Ai [(Ap [j]) ... (Ap [j+1]-1)], and the
corresponding numerical values are stored in
projects / dealii.git / commitdiff