Commit 5ee2aed7 authored by Oliver Sander's avatar Oliver Sander
Browse files

Fix all misspellings found by the 'codespell' tool

parent c48d861e
......@@ -157,7 +157,7 @@ corresponding version of the Dune core modules.
- Add a set of unit tests for bases
- Extend the documentation of these bases
- Remove `DiscreteScalarGlobalBasisFunction`. This was replaced by `DiscreteGlobalBasisFunction`.
- Introduce inteface method `NodeIndexSet::indices(it)` that must write all global
- Introduce interface method `NodeIndexSet::indices(it)` that must write all global
indices for the bound tree into the container pointed to by the iterator `it`
- Remove `NodeIndexSet::index(i)` for computation of individual global indices.
- `DefaultLocalIndexSet::bind(...)` now computes and caches all global indices
......
......@@ -1452,7 +1452,7 @@ The structure of the interface is visualized in Figure~\ref{fig:febasis_interfac
\subsection*{Notation}
The \dunemodule{dune-functions} module is implemented in the C++ programming languange.
The \dunemodule{dune-functions} module is implemented in the C++ programming language.
All header include paths
start with \cpp{dune/functions/}, and all code is contained in the namespace \cpp{Dune::Functions}.
Internally, \dunemodule{dune-functions} depends on the \dunemodule{dune-typetree} module,
......
......@@ -56,7 +56,7 @@ public:
*
* Coefficients are ordered in accordance with
* the corresponding monomial order. This will
* move the coefficients from givven vector.
* move the coefficients from the given vector.
*/
Polynomial(std::vector<K>&& coefficients) :
coefficients_(std::move(coefficients))
......@@ -67,7 +67,7 @@ public:
*
* Coefficients are ordered in accordance with
* the corresponding monomial order. This will
* copy coefficients from given vector.
* copy coefficients from the given vector.
*/
Polynomial(const std::vector<K>& coefficients) :
coefficients_(coefficients)
......
......@@ -196,7 +196,7 @@ class ISTLVectorBackend
// size we throw an exception.
//
// We could perhaps also allow c.size()>size.
// But then looping the loop below get's complicated:
// But then looping the loop below gets complicated:
// We're not allowed to loop until c.size(). But
// we also cannot use size for termination,
// because this fails if c is a static vector.
......
......@@ -42,7 +42,7 @@ class CallableFunctionWrapper
public:
/**
* \brief Instanciate from reference to f
* \brief Instantiate from reference to f
*
* The CallableFunctionWrapper will not take ownership
* of the provided function.
......@@ -53,7 +53,7 @@ class CallableFunctionWrapper
}
/**
* \brief Instanciate from std::shared_ptr to f
* \brief Instantiate from std::shared_ptr to f
*
* The CallableFunctionWrapper will share ownership
* with the provided function.
......
......@@ -247,7 +247,7 @@ struct MultiIndexResolver
* \ingroup Utility
*
* This provides access to a nested container by given
* multi-index. Internally this is resolved by recusive
* multi-index. Internally this is resolved by recursive
* operator[]-calls with static or dynamic indices.
* Because this recursion must be terminated using a
* compile-time criterion, the result type must explicitly
......@@ -334,7 +334,7 @@ namespace Imp {
* \ingroup Utility
*
* This provides access to a nested container by given dynamically sized
* multi-index. Internally this is resolved by recusive
* multi-index. Internally this is resolved by recursive
* operator[]-calls with static or dynamic indices.
* Because this recursion must be terminated, a predicate
* is used to determine if a type is considered final for the
......@@ -362,12 +362,12 @@ constexpr decltype(auto) resolveDynamicMultiIndex(C&& c, const MultiIndex& multi
* \ingroup Utility
*
* This provides access to a nested container by given dynamically sized
* multi-index. Internally this is resolved by recusive
* multi-index. Internally this is resolved by recursive
* operator[]-calls with static or dynamic indices.
* Because this recursion must be terminated, a predicate
* is used to determine if a type is considered final for the
* multi-index resolution. This version terminates the recursion
* on values that neither have a static nore a dynamic operator[].
* on values that neither have a static nor a dynamic operator[].
*
* \param c Container to access
* \param index Multi-index
......@@ -385,7 +385,7 @@ constexpr decltype(auto) resolveDynamicMultiIndex(C&& c, const MultiIndex& multi
* \ingroup Utility
*
* This provides access to a nested container by given statically sized
* multi-index. Internally this is resolved by recusive
* multi-index. Internally this is resolved by recursive
* operator[]-calls with static or dynamic indices.
* Since the multi-index must have compile-time known size
* it is possible, that values resolved by different multi-indices
......
......@@ -164,7 +164,7 @@ public:
}
/**
* \brief Obtain local contex this LocalFunction is bound to
* \brief Obtain local context this LocalFunction is bound to
*/
const LocalContext& localContext() const
{
......
......@@ -81,7 +81,7 @@ UniformNodeVisitor :
* the type of these data objects must be default constructible.
*
* Notice that the data per node can only be interpreted if the
* node type is known. Hence the tree will be traversed on initilization,
* node type is known. Hence the tree will be traversed on initialization,
* copy, assignment, and destruction of a TreeData container.
*
* \tparam T Type of the tree
......@@ -119,7 +119,7 @@ protected:
// tree traversal. Once we can use C++14 this can
// be written in a much easier and more selfcontained
// ways using generic lambda functions.
// Until then we need explicite visitor classes for
// Until then we need explicit visitor classes for
// each operation.
struct InitVisitor :
......
......@@ -18,7 +18,7 @@ namespace Functions {
*
* Helper typedef to remove constructor with forwarding reference from
* overload set for type is not constructible from argument list.
* This is useful to avoid failng forwarding constructors
* This is useful to avoid failing forwarding constructors
* for base classes or members.
*/
template<class T, class... Args>
......
......@@ -105,9 +105,9 @@ protected:
* type it can use the wrapper_ member of this base class being
* of this type.
*
* \tparam Interface Class defininig the internal abstract virtual interface
* \tparam Implementation Class defininig implemention the abstract methods of Interface
* \tparam T A type modelleding the desired interface
* \tparam Interface Class defining the internal abstract virtual interface
* \tparam Implementation Class defining the implementation of the abstract methods of Interface
* \tparam T A type modeling the desired interface
*/
template<class Interface, template<class> class Implementation, class T>
class TypeErasureWrapperImplementation :
......
......@@ -43,7 +43,7 @@ auto forwardAsStaticInteger(std::integer_sequence<size_type, firstValue, secondV
* This will call the given function with index_constant<i>
* where i is the dynamically provided index.
*
* To achieve this the conditon i==ii is checked subsequently
* To achieve this the condition i==ii is checked subsequently
* for al static indices ii in the range 0,...,(end-1). In order
* to be able to compile this we require for all ii in this range
* that f(index_constant<ii>()) is well-formed and that the result
......@@ -262,7 +262,7 @@ struct RotateTuple
* This returns a function object that allows to check if the
* expression encoded in f is valid for the given arguments.
* To be precise it checks if f can be called using the given arguments.
* This can be used inthe following way: To generate a check if the
* This can be used in the following way: To generate a check if the
* expression x(a,b) is valid for some a and b use:
*
\code{.cpp}
......
......@@ -20,7 +20,7 @@ namespace Functions {
namespace Imp {
// Construct default coefficent type from vector and multiindex type
// Construct default coefficient type from vector and multiindex type
// This requires that MultiIndex has a static size. Otherwise the
// vector type itself is returned.
template<class V, class MultiIndex>
......
......@@ -29,7 +29,7 @@ namespace Experimental {
*
* This class is intended to be passed to the BasisFactory::periodic()
* function.
* The class stores a set of index pairs which whould be
* The class stores a set of index pairs which should be
* identified in order to construct a basis with periodic functions.
*/
class PeriodicIndexSet
......@@ -67,7 +67,7 @@ private:
namespace Impl {
// An index transformation for a TransformedIndexPreBasis
// impelementing periodic functions by merging indices.
// implementing periodic functions by merging indices.
// Currently only flat indices are supported.
class PeriodicIndexingTransformation
{
......
......@@ -244,7 +244,7 @@ private:
// Fill indices for first child at the beginning.
auto next = subPreBasis().indices(node.child(_0), multiIndices);
// Multiply first component of all indices for first child by
// number of children to strech the index range for interleaving.
// number of children to stretch the index range for interleaving.
for (std::size_t i = 0; i<subTreeSize; ++i)
multiIndices[i][0] *= children;
for (std::size_t child = 1; child<children; ++child)
......
......@@ -26,7 +26,7 @@ namespace Functions {
* by its local index and codimension wrt the element the LocalView
* is bound to, or by an intersection having this element as inside.
*
* After beeing bound this class can be used as range of local indices
* After being bound this class can be used as range of local indices
* of those DOFs that are associated to the sub-entity or sub-sub-entities
* of this sub-entity. Furthermore it allows to ask if a given local index
* is contained in this range.
......
......@@ -199,7 +199,7 @@ Dune::TestSuite checkBasisIndices(const Basis& basis)
auto multiIndex = localView.index(i);
for(auto mi: multiIndex)
test.check(mi>=0)
<< "Global multi-index containes negative entry for shape function " << i
<< "Global multi-index contains negative entry for shape function " << i
<< " in element " << elementStr(localView.element(), basis.gridView());
multiIndexSet.insert(multiIndex);
}
......
......@@ -223,7 +223,7 @@ auto transformIndices(
* argument.
*
* \tparam IndexTransformation Callback type for transforming multi-indices
* \tparam SizeImplementation Callback type for implemenation of size(prefix)
* \tparam SizeImplementation Callback type for implementation of size(prefix)
* \tparam minIS Minimal multi-index size
* \tparam maxIS Maximal multi-index size. Notice that this has to large enough to also store the untransformed indices.
*/
......@@ -280,7 +280,7 @@ private:
* argument.
*
* \tparam IndexTransformation Callback type for transforming multi-indices
* \tparam SizeImplementation Callback type for implemenation of size(prefix)
* \tparam SizeImplementation Callback type for implementation of size(prefix)
* \tparam minIS Minimal multi-index size
* \tparam maxIS Maximal multi-index size. Notice that this has to be large enough to also store the untransformed indices.
*/
......
......@@ -72,7 +72,7 @@ int main (int argc, char* argv[]) try
// Interpolate f wrt basis.
interpolate(basis, c, f);
// Create grid functions from coeffients of individual
// Create grid functions from coefficients of individual
// components. Each is the piecewise Q2 interpolation of f_i.
// They should be exact, since f is P2.
auto basis_0 = Dune::Functions::subspaceBasis(basis, 0);
......
......@@ -72,7 +72,7 @@ void registerTree_(pybind11::handle scope, const char* name)
pybind11::class_<Tree> cls(scope, name);
registerTreeCommon(cls);
// static variable cls is captured automatically - explicit caputre fails with clang:
// static variable cls is captured automatically - explicit capture fails with clang:
// fatal error: 'cls' cannot be captured because it does not have automatic storage duration
Hybrid::forEach(std::make_index_sequence<Tree::degree()>{}, [&cls](auto i) {
using SubTree = typename Tree::template Child<i>::Type;
......
......@@ -472,7 +472,7 @@ int main (int argc, char *argv[]) try
// Construct the actual iterative solver
RestartedGMResSolver<VectorType> solver(
stiffnessOperator, // operator to invert
preconditioner, // preconditioner for interation
preconditioner, // preconditioner for iteration
1e-10, // desired residual reduction factor
500, // number of iterations between restarts
500, // maximum number of iterations
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment