From 44c6132163613be47f7b88dbc92b037590b22f1b Mon Sep 17 00:00:00 2001 From: Rasmus Munk Larsen <4643818-rmlarsen1@users.noreply.gitlab.com> Date: Sat, 21 Feb 2026 21:29:50 -0800 Subject: [PATCH] Fix ~40 typos found by codespell across the codebase libeigen/eigen!2181 Co-authored-by: Rasmus Munk Larsen --- Eigen/src/Core/GeneralProduct.h | 2 +- Eigen/src/Core/arch/AltiVec/PacketMath.h | 4 ++-- .../arch/Default/GenericPacketMathFunctions.h | 4 ++-- Eigen/src/Core/arch/Default/Half.h | 7 ++++--- Eigen/src/Eigenvalues/ComplexQZ.h | 4 ++-- Eigen/src/SparseLU/SparseLU.h | 2 +- bench/perf_monitoring/changesets.txt | 2 +- bench/spbench/spbench.dtd | 2 +- blas/BandTriangularSolver.h | 2 +- doc/HiPerformance.dox | 2 +- doc/Manual.dox | 2 +- doc/TutorialGeometry.dox | 2 +- test/constexpr.cpp | 2 +- test/gpu_basic.cu | 2 +- test/indexed_view.cpp | 2 +- test/packetmath.cpp | 4 ++-- unsupported/Eigen/CXX11/src/Tensor/README.md | 2 +- .../CXX11/src/Tensor/TensorContractionSycl.h | 2 +- .../src/Tensor/TensorContractionThreadPool.h | 16 ++++------------ .../Eigen/CXX11/src/Tensor/TensorRandom.h | 4 ++-- .../Eigen/CXX11/src/Tensor/TensorReduction.h | 2 +- .../Eigen/CXX11/src/TensorSymmetry/Symmetry.h | 2 +- unsupported/Eigen/NNLS | 2 +- .../KroneckerProduct/KroneckerTensorProduct.h | 4 ++-- unsupported/test/NonLinearOptimization.cpp | 4 ++-- unsupported/test/cxx11_tensor_reduction.cpp | 2 +- unsupported/test/cxx11_tensor_symmetry.cpp | 2 +- unsupported/test/levenberg_marquardt.cpp | 4 ++-- unsupported/test/special_functions.cpp | 2 +- 29 files changed, 43 insertions(+), 50 deletions(-) diff --git a/Eigen/src/Core/GeneralProduct.h b/Eigen/src/Core/GeneralProduct.h index ace438d77..a9da77071 100644 --- a/Eigen/src/Core/GeneralProduct.h +++ b/Eigen/src/Core/GeneralProduct.h @@ -208,7 +208,7 @@ struct product_type_selector { * Implementation of General Matrix Vector Product ***********************************************************************/ -/* According to the shape/flags of the matrix we have to distinghish 3 different cases: +/* According to the shape/flags of the matrix we have to distinguish 3 different cases: * 1 - the matrix is col-major, BLAS compatible and M is large => call fast BLAS-like colmajor routine * 2 - the matrix is row-major, BLAS compatible and N is large => call fast BLAS-like rowmajor routine * 3 - all other cases are handled using a simple loop along the outer-storage direction. diff --git a/Eigen/src/Core/arch/AltiVec/PacketMath.h b/Eigen/src/Core/arch/AltiVec/PacketMath.h index acc204846..ce6702008 100644 --- a/Eigen/src/Core/arch/AltiVec/PacketMath.h +++ b/Eigen/src/Core/arch/AltiVec/PacketMath.h @@ -1163,7 +1163,7 @@ EIGEN_STRONG_INLINE Packet4i pdiv(const Packet4i& a, const Packet4i& b #endif } -// for some weird raisons, it has to be overloaded for packet of integers +// for some weird reasons, it has to be overloaded for packet of integers template <> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) { return vec_madd(a, b, c); @@ -3274,7 +3274,7 @@ EIGEN_STRONG_INLINE Packet2d pdiv(const Packet2d& a, const Packet2d& b return vec_div(a, b); } -// for some weird raisons, it has to be overloaded for packet of integers +// for some weird reasons, it has to be overloaded for packet of integers template <> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return vec_madd(a, b, c); diff --git a/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h b/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h index 546795890..915241f73 100644 --- a/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h +++ b/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h @@ -397,7 +397,7 @@ EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS Packet pcbrt_float(const Pac // Generic implementation of cbrt(x) for double. // // The algorithm is identical to the one for float except that a different initial -// approximation is used for y^(1/3) and two Halley iteration steps are peformed. +// approximation is used for y^(1/3) and two Halley iteration steps are performed. // // This is accurate to 1 ULP. template @@ -1406,7 +1406,7 @@ EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS T ptanh_float(const T& a_x) /** \internal \returns the hyperbolic tan of \a a (coeff-wise). On the domain [-1.25:1.25] we use an approximation of the form tanh(x) ~= x^3 * (P(x) / Q(x)) + x, where P and Q are polynomials in x^2. - For |x| > 1.25, tanh is implememented as tanh(x) = 1 - (2 / (1 + exp(2*x))). + For |x| > 1.25, tanh is implemented as tanh(x) = 1 - (2 / (1 + exp(2*x))). This implementation has a maximum error of 1 ULP (measured with AVX2+FMA). diff --git a/Eigen/src/Core/arch/Default/Half.h b/Eigen/src/Core/arch/Default/Half.h index 47832a4df..e1c954cff 100644 --- a/Eigen/src/Core/arch/Default/Half.h +++ b/Eigen/src/Core/arch/Default/Half.h @@ -508,7 +508,7 @@ EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half& operator/=(half& a, const half& b) { // fp16 uses 1 sign bit, 5 exponent bits, and 10 mantissa bits. The bit pattern conveys NaN when all the exponent // bits (5) are set, and at least one mantissa bit is set. The sign bit is irrelevant for determining NaN. To check for // NaN, clear the sign bit and check if the integral representation is greater than 01111100000000. To test -// for non-NaN, clear the sign bit and check if the integeral representation is less than or equal to 01111100000000. +// for non-NaN, clear the sign bit and check if the integral representation is less than or equal to 01111100000000. // convert sign-magnitude representation to two's complement EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC int16_t mapToSigned(uint16_t a) { @@ -956,8 +956,9 @@ EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC uint16_t bit_cast(c } // Specialize multiply-add to match packet operations and reduce conversions to/from float. -template<> -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half madd(const Eigen::half& x, const Eigen::half& y, const Eigen::half& z) { +template <> +EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half madd(const Eigen::half& x, const Eigen::half& y, + const Eigen::half& z) { return Eigen::half(static_cast(x) * static_cast(y) + static_cast(z)); } diff --git a/Eigen/src/Eigenvalues/ComplexQZ.h b/Eigen/src/Eigenvalues/ComplexQZ.h index da7da6c9d..1d5f8d0da 100644 --- a/Eigen/src/Eigenvalues/ComplexQZ.h +++ b/Eigen/src/Eigenvalues/ComplexQZ.h @@ -170,9 +170,9 @@ class ComplexQZ { template void computeSparse(const SparseMatrixType_& A, const SparseMatrixType_& B, bool computeQZ = true); - /** \brief Reports whether the last computation was successfull. + /** \brief Reports whether the last computation was successful. * - * \returns \c Success if computation was successfull, \c NoConvergence otherwise. + * \returns \c Success if computation was successful, \c NoConvergence otherwise. */ ComputationInfo info() const { return m_info; } diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h index fbd4cc7ca..7338c61a3 100644 --- a/Eigen/src/SparseLU/SparseLU.h +++ b/Eigen/src/SparseLU/SparseLU.h @@ -507,7 +507,7 @@ class SparseLU : public SparseSolverBase>, SparseLU(const SparseLU&); }; // End class SparseLU -// Functions needed by the anaysis phase +// Functions needed by the analysis phase /** \brief Compute the column permutation. * * Compute the column permutation to minimize the fill-in diff --git a/bench/perf_monitoring/changesets.txt b/bench/perf_monitoring/changesets.txt index efdd9a0ff..b545dbb04 100644 --- a/bench/perf_monitoring/changesets.txt +++ b/bench/perf_monitoring/changesets.txt @@ -73,7 +73,7 @@ Load hg-to-git hash maps from ./eigen_git/.git/ 9946a5fe86098 # Complete rewrite of column-major-matrix * vector product
to deliver higher performance of modern CPU. 99591003f3b86 # Improve performance of row-major-dense-matrix * vector products
for recent CPUs. 997eb621413c1 # Revert vec/y to vec*(1/y) in row-major TRSM -10444bbc320468 # Bug 1435: fix aliasing issue in exressions like: A = C - B*A; +10444bbc320468 # Bug 1435: fix aliasing issue in expressions like: A = C - B*A; 1073624df50945 # Adds missing EIGEN_STRONG_INLINE to support MSVC
properly inlining small vector calculations 1094d428a199ab # Bug 1562: optimize evaluation of small products
of the form s*A*B by rewriting them as: s*(A.lazyProduct(B))
to save a costly temporary.
Measured speedup from 2x to 5x. 1096de9e31a06d # Introduce the macro ei_declare_local_nested_eval to
help allocating on the stack local temporaries via alloca,
and let outer-products makes a good use of it. diff --git a/bench/spbench/spbench.dtd b/bench/spbench/spbench.dtd index 0fb51b89a..efab960c8 100644 --- a/bench/spbench/spbench.dtd +++ b/bench/spbench/spbench.dtd @@ -9,7 +9,7 @@ - + diff --git a/blas/BandTriangularSolver.h b/blas/BandTriangularSolver.h index f9bfdc1d4..fbc639f2f 100644 --- a/blas/BandTriangularSolver.h +++ b/blas/BandTriangularSolver.h @@ -15,7 +15,7 @@ namespace internal { /* \internal * Solve Ax=b with A a band triangular matrix - * TODO: extend it to matrices for x abd b */ + * TODO: extend it to matrices for x and b */ template struct band_solve_triangular_selector; diff --git a/doc/HiPerformance.dox b/doc/HiPerformance.dox index 9cee3351c..662fc9aaa 100644 --- a/doc/HiPerformance.dox +++ b/doc/HiPerformance.dox @@ -81,7 +81,7 @@ m1 += temp.adjoint(); \endcode m1.noalias() += m3.adjoint() * * m2.adjoint(); \endcode This is because the product expression has the EvalBeforeNesting bit which - enforces the evaluation of the product by the Tranpose expression. + enforces the evaluation of the product by the Transpose expression. \code diff --git a/doc/Manual.dox b/doc/Manual.dox index 73dd8a631..c229ef53b 100644 --- a/doc/Manual.dox +++ b/doc/Manual.dox @@ -1,5 +1,5 @@ -// This file strutures pages and modules into a convenient hierarchical structure. +// This file structures pages and modules into a convenient hierarchical structure. namespace Eigen { diff --git a/doc/TutorialGeometry.dox b/doc/TutorialGeometry.dox index 30bc25a97..2938df48e 100644 --- a/doc/TutorialGeometry.dox +++ b/doc/TutorialGeometry.dox @@ -112,7 +112,7 @@ rot3 = rot1.slerp(alpha,rot2);\endcode top\section TutorialGeoTransform Affine transformations Generic affine transformations are represented by the Transform class which internally -is a (Dim+1)^2 matrix. In Eigen we have chosen to not distinghish between points and +is a (Dim+1)^2 matrix. In Eigen we have chosen to not distinguish between points and vectors such that all points are actually represented by displacement vectors from the origin ( \f$ \mathbf{p} \equiv \mathbf{p}-0 \f$ ). With that in mind, real points and vector distinguish when the transformation is applied. diff --git a/test/constexpr.cpp b/test/constexpr.cpp index ecfda0ae9..ce5702aee 100644 --- a/test/constexpr.cpp +++ b/test/constexpr.cpp @@ -40,7 +40,7 @@ EIGEN_DECLARE_TEST(constexpr) { VERIFY_IS_EQUAL(vec.size(), 3); static_assert(vec.coeff(0, 1) == 2); - // Check assignment. A wrapper struct is used to avoid copy ellision. + // Check assignment. A wrapper struct is used to avoid copy elision. constexpr ConstexprTest obj1(Matrix2d({{1, 2}, {3, 4}})); VERIFY_IS_EQUAL(obj1.A.size(), 4); static_assert(obj1.A(0, 0) == 1); diff --git a/test/gpu_basic.cu b/test/gpu_basic.cu index 35839e466..5e69fb7c4 100644 --- a/test/gpu_basic.cu +++ b/test/gpu_basic.cu @@ -438,7 +438,7 @@ EIGEN_DECLARE_TEST(gpu_basic) { // numeric_limits CALL_SUBTEST(test_with_infs_nans(numeric_limits_test(), 1, in, out)); - // These tests require dynamic-sized matrix multiplcation, which isn't currently + // These tests require dynamic-sized matrix multiplication, which isn't currently // supported on GPU. // CALL_SUBTEST( run_and_compare_to_gpu(eigenvalues(), nthreads, in, out) ); diff --git a/test/indexed_view.cpp b/test/indexed_view.cpp index 9f0df851d..c0d140da3 100644 --- a/test/indexed_view.cpp +++ b/test/indexed_view.cpp @@ -422,7 +422,7 @@ void check_indexed_view() { A(last, last) = 1; // check weird non-const, non-lvalue scenarios { - // in these scenarios, the objects are not declared 'const', and the compiler will atttempt to use the non-const + // in these scenarios, the objects are not declared 'const', and the compiler will attempt to use the non-const // overloads without intervention // non-const map to a const object diff --git a/test/packetmath.cpp b/test/packetmath.cpp index 873efb17d..fd27eb36c 100644 --- a/test/packetmath.cpp +++ b/test/packetmath.cpp @@ -1022,7 +1022,7 @@ void packetmath_real() { } if (PacketTraits::HasTanh) { - // NOTE this test migh fail with GCC prior to 6.3, see MathFunctionsImpl.h for details. + // NOTE this test might fail with GCC prior to 6.3, see MathFunctionsImpl.h for details. data1[0] = NumTraits::quiet_NaN(); test::packet_helper::HasTanh, Packet> h; h.store(data2, internal::ptanh(h.load(data1))); @@ -1580,7 +1580,7 @@ struct exp_complex_test_impl { template struct exp_complex_test_impl { typedef typename Scalar::value_type RealScalar; - static void run(Scalar*, Scalar*, Scalar*, int) {}; + static void run(Scalar*, Scalar*, Scalar*, int){}; }; template diff --git a/unsupported/Eigen/CXX11/src/Tensor/README.md b/unsupported/Eigen/CXX11/src/Tensor/README.md index 45a94542f..9a3934395 100644 --- a/unsupported/Eigen/CXX11/src/Tensor/README.md +++ b/unsupported/Eigen/CXX11/src/Tensor/README.md @@ -1189,7 +1189,7 @@ containing the coefficient wise maximums of the inputs. ### (Operation) cwiseMin(const OtherDerived& other) Returns a tensor of the same type and dimensions as the input tensors -containing the coefficient wise mimimums of the inputs. +containing the coefficient wise minimums of the inputs. ### (Operation) Logical operators diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionSycl.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionSycl.h index ea210a1f8..fb98d5b76 100644 --- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionSycl.h +++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionSycl.h @@ -632,7 +632,7 @@ class TensorContractionKernel { (thread_properties.is_internal) ? compute_panel(itemID, thread_properties, out_ptr) : compute_panel(itemID, thread_properties, out_ptr); } - // The compute block computes the contraction operation private block for each thread and store the resutl in the + // The compute block computes the contraction operation private block for each thread and store the result in the // privateRes memory of Each computation the compute block function is independent of local and no local concepts as // it only compute the block on each thread's private memory space EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void compute_block_per_tile(OutScalar *lhs_block_ptr, OutScalar *rhs_block_ptr, diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h index 99e7304d8..59b798f00 100644 --- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h +++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionThreadPool.h @@ -932,9 +932,7 @@ struct TensorEvaluator 1) { Index mid = (start + end) / 2; - device_.enqueue([this, mid, end, k, rhs]() { - enqueue_packing_helper(mid, end, k, rhs); - }); + device_.enqueue([this, mid, end, k, rhs]() { enqueue_packing_helper(mid, end, k, rhs); }); end = mid; } @@ -1000,9 +996,7 @@ struct TensorEvaluator 0 || std::this_thread::get_id() == created_by_thread_id_); if (pack_async) { - device_.enqueue([this, start, end, k, rhs]() { - enqueue_packing_helper(start, end, k, rhs); - }); + device_.enqueue([this, start, end, k, rhs]() { enqueue_packing_helper(start, end, k, rhs); }); } else { enqueue_packing_helper(start, end, k, rhs); } @@ -1283,9 +1277,7 @@ struct TensorEvaluator 1) { Index mid_block_idx = (start_block_idx + end_block_idx) / 2; evaluator->m_device.enqueue( - [this, mid_block_idx, end_block_idx]() { - evalAsync(mid_block_idx, end_block_idx); - }); + [this, mid_block_idx, end_block_idx]() { evalAsync(mid_block_idx, end_block_idx); }); end_block_idx = mid_block_idx; } diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorRandom.h b/unsupported/Eigen/CXX11/src/Tensor/TensorRandom.h index e9de98848..d71b39506 100644 --- a/unsupported/Eigen/CXX11/src/Tensor/TensorRandom.h +++ b/unsupported/Eigen/CXX11/src/Tensor/TensorRandom.h @@ -133,7 +133,7 @@ class UniformRandomGenerator { m_state = PCG_XSH_RS_state(seed); #ifdef EIGEN_USE_SYCL // In SYCL it is not possible to build PCG_XSH_RS_state in one step. - // Therefore, we need two steps to initializate the m_state. + // Therefore, we need two steps to initialize the m_state. // IN SYCL, the constructor of the functor is s called on the CPU // and we get the clock seed here from the CPU. However, This seed is // the same for all the thread. As unlike CUDA, the thread.ID, BlockID, etc is not a global function. @@ -241,7 +241,7 @@ class NormalRandomGenerator { m_state = PCG_XSH_RS_state(seed); #ifdef EIGEN_USE_SYCL // In SYCL it is not possible to build PCG_XSH_RS_state in one step. - // Therefore, we need two steps to initializate the m_state. + // Therefore, we need two steps to initialize the m_state. // IN SYCL, the constructor of the functor is s called on the CPU // and we get the clock seed here from the CPU. However, This seed is // the same for all the thread. As unlike CUDA, the thread.ID, BlockID, etc is not a global function. diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorReduction.h b/unsupported/Eigen/CXX11/src/Tensor/TensorReduction.h index b9f066ead..5c4951be2 100644 --- a/unsupported/Eigen/CXX11/src/Tensor/TensorReduction.h +++ b/unsupported/Eigen/CXX11/src/Tensor/TensorReduction.h @@ -903,7 +903,7 @@ struct TensorReductionEvaluatorBase friend class TensorSycl::internal::GenericNondeterministicReducer; - // SYCL need the Generic reducer for the case the recution algorithm is neither inner, outer, and full reducer + // SYCL need the Generic reducer for the case the reduction algorithm is neither inner, outer, and full reducer template friend struct internal::GenericReducer; #endif diff --git a/unsupported/Eigen/CXX11/src/TensorSymmetry/Symmetry.h b/unsupported/Eigen/CXX11/src/TensorSymmetry/Symmetry.h index 2d3ff466f..2c57e3623 100644 --- a/unsupported/Eigen/CXX11/src/TensorSymmetry/Symmetry.h +++ b/unsupported/Eigen/CXX11/src/TensorSymmetry/Symmetry.h @@ -74,7 +74,7 @@ struct AntiHermiticity { * \brief Dynamic symmetry group * * The %DynamicSGroup class represents a symmetry group that need not be known at - * compile time. It is useful if one wants to support arbitrary run-time defineable + * compile time. It is useful if one wants to support arbitrary run-time definable * symmetries for tensors, but it is also instantiated if a symmetry group is defined * at compile time that would be either too large for the compiler to reasonably * generate (using templates to calculate this at compile time is very inefficient) diff --git a/unsupported/Eigen/NNLS b/unsupported/Eigen/NNLS index 2923f5962..fcafc080d 100644 --- a/unsupported/Eigen/NNLS +++ b/unsupported/Eigen/NNLS @@ -88,7 +88,7 @@ class NNLS { /** */ NNLS(); - /** \brief Constructs a NNLS sovler and initializes it with the given system matrix @c A. + /** \brief Constructs a NNLS solver and initializes it with the given system matrix @c A. * \param A Specifies the system matrix. * \param max_iter Specifies the maximum number of iterations to solve the system. * \param tol Specifies the precision of the optimum. diff --git a/unsupported/Eigen/src/KroneckerProduct/KroneckerTensorProduct.h b/unsupported/Eigen/src/KroneckerProduct/KroneckerTensorProduct.h index 1d29f2fca..aa03c04a6 100644 --- a/unsupported/Eigen/src/KroneckerProduct/KroneckerTensorProduct.h +++ b/unsupported/Eigen/src/KroneckerProduct/KroneckerTensorProduct.h @@ -70,7 +70,7 @@ class KroneckerProductBase : public ReturnByValue { * * This class is the return value of kroneckerProduct(MatrixBase, * MatrixBase). Use the function rather than construct this class - * directly to avoid specifying template prarameters. + * directly to avoid specifying template parameters. * * \tparam Lhs Type of the left-hand side, a matrix expression. * \tparam Rhs Type of the rignt-hand side, a matrix expression. @@ -101,7 +101,7 @@ class KroneckerProduct : public KroneckerProductBase * * This class is the return value of kroneckerProduct(EigenBase, * EigenBase). Use the function rather than construct this class - * directly to avoid specifying template prarameters. + * directly to avoid specifying template parameters. * * \tparam Lhs Type of the left-hand side, a matrix expression. * \tparam Rhs Type of the rignt-hand side, a matrix expression. diff --git a/unsupported/test/NonLinearOptimization.cpp b/unsupported/test/NonLinearOptimization.cpp index fa2ee32a5..78990d7be 100644 --- a/unsupported/test/NonLinearOptimization.cpp +++ b/unsupported/test/NonLinearOptimization.cpp @@ -845,7 +845,7 @@ void testNistHahn1(void) { VERIFY_IS_APPROX(x[0], 1.0776351733E+00); VERIFY_IS_APPROX(x[1], -1.2269296921E-01); VERIFY_IS_APPROX(x[2], 4.0863750610E-03); - VERIFY_IS_APPROX(x[3], -1.426264e-06); // shoulde be : -1.4262662514E-06 + VERIFY_IS_APPROX(x[3], -1.426264e-06); // should be : -1.4262662514E-06 VERIFY_IS_APPROX(x[4], -5.7609940901E-03); VERIFY_IS_APPROX(x[5], 2.4053735503E-04); VERIFY_IS_APPROX(x[6], -1.2314450199E-07); @@ -867,7 +867,7 @@ void testNistHahn1(void) { VERIFY_IS_APPROX(x[0], 1.077640); // should be : 1.0776351733E+00 VERIFY_IS_APPROX(x[1], -0.1226933); // should be : -1.2269296921E-01 VERIFY_IS_APPROX(x[2], 0.004086383); // should be : 4.0863750610E-03 - VERIFY_IS_APPROX(x[3], -1.426277e-06); // shoulde be : -1.4262662514E-06 + VERIFY_IS_APPROX(x[3], -1.426277e-06); // should be : -1.4262662514E-06 VERIFY_IS_APPROX(x[4], -5.7609940901E-03); VERIFY_IS_APPROX(x[5], 0.00024053772); // should be : 2.4053735503E-04 VERIFY_IS_APPROX(x[6], -1.231450e-07); // should be : -1.2314450199E-07 diff --git a/unsupported/test/cxx11_tensor_reduction.cpp b/unsupported/test/cxx11_tensor_reduction.cpp index ab497c4e1..0fdebe271 100644 --- a/unsupported/test/cxx11_tensor_reduction.cpp +++ b/unsupported/test/cxx11_tensor_reduction.cpp @@ -471,7 +471,7 @@ void test_sum_accuracy() { Tensor sum; sum = tensor.sum(); - // Compute the reference value in double precsion. + // Compute the reference value in double precision. double expected_sum = 0.0; double abs_sum = 0.0; for (int i = 0; i < num_elements; ++i) { diff --git a/unsupported/test/cxx11_tensor_symmetry.cpp b/unsupported/test/cxx11_tensor_symmetry.cpp index 16173b94a..dce303037 100644 --- a/unsupported/test/cxx11_tensor_symmetry.cpp +++ b/unsupported/test/cxx11_tensor_symmetry.cpp @@ -30,7 +30,7 @@ using Eigen::GlobalRealFlag; using Eigen::GlobalZeroFlag; using Eigen::NegationFlag; -// helper function to determine if the compiler intantiated a static +// helper function to determine if the compiler instantiated a static // or dynamic symmetry group template bool isDynGroup(StaticSGroup const& dummy) { diff --git a/unsupported/test/levenberg_marquardt.cpp b/unsupported/test/levenberg_marquardt.cpp index 8a8c838e1..45edcc2aa 100644 --- a/unsupported/test/levenberg_marquardt.cpp +++ b/unsupported/test/levenberg_marquardt.cpp @@ -505,7 +505,7 @@ void testNistHahn1(void) { VERIFY_IS_APPROX(x[0], 1.0776351733E+00); VERIFY_IS_APPROX(x[1], -1.2269296921E-01); VERIFY_IS_APPROX(x[2], 4.0863750610E-03); - VERIFY_IS_APPROX(x[3], -1.426264e-06); // shoulde be : -1.4262662514E-06 + VERIFY_IS_APPROX(x[3], -1.426264e-06); // should be : -1.4262662514E-06 VERIFY_IS_APPROX(x[4], -5.7609940901E-03); VERIFY_IS_APPROX(x[5], 2.4053735503E-04); VERIFY_IS_APPROX(x[6], -1.2314450199E-07); @@ -528,7 +528,7 @@ void testNistHahn1(void) { VERIFY_IS_APPROX(x[0], 1.077640); // should be : 1.0776351733E+00 VERIFY_IS_APPROX(x[1], -0.1226933); // should be : -1.2269296921E-01 VERIFY_IS_APPROX(x[2], 0.004086383); // should be : 4.0863750610E-03 - VERIFY_IS_APPROX(x[3], -1.426277e-06); // shoulde be : -1.4262662514E-06 + VERIFY_IS_APPROX(x[3], -1.426277e-06); // should be : -1.4262662514E-06 VERIFY_IS_APPROX(x[4], -5.7609940901E-03); VERIFY_IS_APPROX(x[5], 0.00024053772); // should be : 2.4053735503E-04 VERIFY_IS_APPROX(x[6], -1.231450e-07); // should be : -1.2314450199E-07 diff --git a/unsupported/test/special_functions.cpp b/unsupported/test/special_functions.cpp index 9239b3327..a63a2ea8f 100644 --- a/unsupported/test/special_functions.cpp +++ b/unsupported/test/special_functions.cpp @@ -65,7 +65,7 @@ void array_special_functions() { ArrayType m1 = ArrayType::Random(rows, cols); ArrayType m2 = ArrayType::Random(rows, cols); - // Test various propreties of igamma & igammac. These are normalized + // Test various properties of igamma & igammac. These are normalized // gamma integrals where // igammac(a, x) = Gamma(a, x) / Gamma(a) // igamma(a, x) = gamma(a, x) / Gamma(a)