#
# FEATURE_${feature}_FIND_EXTERNAL(var) (a macro)
# which should set var to TRUE if all dependencies for the feature are
-# fullfilled. In this case all necessary variables for
+# fulfilled. In this case all necessary variables for
# FEATURE_${feature}_CONFIGURE_EXTERNAL must be set. Otherwise
# var should remain unset.
# If not defined, FIND_PACKAGE(${feature}) is called.
DEAL_II_WITH_${_feature})
#
- # Are all dependencies fullfilled?
+ # Are all dependencies fulfilled?
#
SET(_dependencies_ok TRUE)
FOREACH(_dependency ${FEATURE_${_feature}_DEPENDS})
ENDIF ()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_PETSC)
MESSAGE(FATAL_ERROR "
ENDIF ()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_PETSC)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_UMFPACK)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_UMFPACK)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_TRILINOS)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF( NOT DEAL_II_WITH_MPI OR
NOT DEAL_II_WITH_P4EST OR
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_TRILINOS)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_MUPARSER)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_UMFPACK)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_PETSC OR NOT DEAL_II_WITH_SLEPC)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_LAPACK)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_PETSC OR NOT DEAL_II_WITH_P4EST)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_TRILINOS)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF( NOT DEAL_II_WITH_MPI OR
NOT DEAL_II_WITH_P4EST OR
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_TRILINOS)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_UMFPACK)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF( NOT DEAL_II_WITH_MPI OR
NOT DEAL_II_WITH_P4EST OR
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_ZLIB)
MESSAGE(FATAL_ERROR "
ENDIF()
#
-# Are all dependencies fullfilled?
+# Are all dependencies fulfilled?
#
IF(NOT DEAL_II_WITH_OPENCASCADE)
MESSAGE(FATAL_ERROR "
* cmake/modules/Find*.cmake
*/
-/* cmake/moduels/FindARPACK.cmake */
+/* cmake/modules/FindARPACK.cmake */
#cmakedefine DEAL_II_ARPACK_WITH_PARPACK
/* cmake/configure/configure_1_threads.cmake */
/**
* Computes the volume element associated with the jacobian of the
- * tranformation F. That is to say if $DF$ is square, it computes
+ * transformation F. That is to say if $DF$ is square, it computes
* $\det(DF)$, in case DF is not square returns $\sqrt(\det(DF^{t} * DF))$.
*/
double determinant () const;
* provided constructors of <tt>ComponentSelectFunction<dim, Number> <\tt>
* class can only have same value for all components.
*
- * @note: we copy the underlaying component value data from @para f from its beginning.
+ * @note: we copy the underlying component value data from @para f from its beginning.
* So the number of components of @para f cannot be less than the calling object.
*/
virtual void substitute_function_value_with (const ConstantFunction<dim, Number> &f);
{
public:
/**
- * Construct a valid accessor given an Indexset and the index @p range_idx
+ * Construct a valid accessor given an IndexSet and the index @p range_idx
* of the range to point to.
*/
IntervalAccessor(const IndexSet *idxset, const size_type range_idx);
/**
- * Construct an invalid accessor for the Indexset.
+ * Construct an invalid accessor for the IndexSet.
*/
explicit IntervalAccessor(const IndexSet *idxset);
project_to_all_children (const Quadrature<dim> &quadrature);
/**
- * Project the onedimensional rule <tt>quadrature</tt> to the straight line
+ * Project the one dimensional rule <tt>quadrature</tt> to the straight line
* connecting the points <tt>p1</tt> and <tt>p2</tt>.
*/
static
*
* The class is poorly named since the proper name of the quadrature formula
* is "trapezoidal rule", or sometimes also called the "trapezoid rule". The
- * misnomer results from the fact that its original authors's poor English
+ * misnomer results from the fact that its original authors' poor English
* language skills led them to translate the name incorrectly from the German
* "Trapezregel".
*
* };
* @endcode
*
- * This namespace provides primitves for access, reordering and contraction
+ * This namespace provides primitives for access, reordering and contraction
* of such objects.
*
* @ingroup geomprimitives
/**
* This class provides a local typedef @p value_type that is equal to
* the typedef <code>value_type</code> after @p deref_steps
- * recursive dereferenciations via ```operator[](unsigned int)```.
+ * recursive dereferences via ```operator[](unsigned int)```.
* Further, constness is preserved via the ValueType
* type trait, i.e., if T is const, ReturnType<rank, T>::value_type
* will also be const.
* The purpose of this reordering facility is to be able to contract over
* an arbitrary index of two (ore more) tensors:
* - reorder the indices in mind to the end of the tensors
- * - use belows contract function that contracts the _last_ elements of
+ * - use the contract function below that contracts the _last_ elements of
* tensors.
*
* @note This function returns an internal class object consisting of an
};
- // TODO: Is there a possibility ot just have the following block of
+ // TODO: Is there a possibility to just have the following block of
// explanation on an internal page in doxygen? If, yes. Doxygen
// wizards, your call!
// -------------------------------------------------------------------------
- // Implemenation of helper classes for reordered_index_view
+ // Implementation of helper classes for reordered_index_view
// -------------------------------------------------------------------------
// OK. This is utterly brutal template magic. Therefore, we will not
//
// Our task is to reorder access to a tensor object where a specified
// index is moved to the end. Thus we want to construct an object
- // <code>reorderd</code> out of a <code>tensor</code> where the
+ // <code>reordered</code> out of a <code>tensor</code> where the
// following access patterns are equivalent:
// @code
// tensor [i_0]...[i_index-1][i_index][i_index+1]...[i_n]
// -------------------------------------------------------------------------
- // Implemenation of helper classes for extract
+ // Implementation of helper classes for extract
// -------------------------------------------------------------------------
// Straightforward recursion implemented by specializing ExtractHelper
// -------------------------------------------------------------------------
- // Implemenation of helper classes for contract
+ // Implementation of helper classes for contract
// -------------------------------------------------------------------------
- // Straightforwad recursive pattern:
+ // Straightforward recursive pattern:
//
// As long as rank_1 > no_contr, assign indices from the left tensor to
// result. This builds up the first part of the nested outer loops:
// -------------------------------------------------------------------------
- // Implemenation of helper classes for contract3
+ // Implementation of helper classes for contract3
// -------------------------------------------------------------------------
// Fully contract three tensorial objects
return x;
}
-X fourty_two = initializer();
+X forty_two = initializer();
-Threads::ThreadLocalStorage<X> tls_data(fourty_two);
+Threads::ThreadLocalStorage<X> tls_data(forty_two);
void execute (Threads::Mutex &m)