mirror of
https://gitlab.com/libeigen/eigen.git
synced 2026-04-10 11:34:33 +08:00
Fix ~40 typos found by codespell across the codebase
libeigen/eigen!2181 Co-authored-by: Rasmus Munk Larsen <rmlarsen@gmail.com>
This commit is contained in:
@@ -208,7 +208,7 @@ struct product_type_selector<Large, Large, Small> {
|
||||
* 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.
|
||||
|
||||
@@ -1163,7 +1163,7 @@ EIGEN_STRONG_INLINE Packet4i pdiv<Packet4i>(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<Packet2d>(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);
|
||||
|
||||
@@ -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 <typename Packet>
|
||||
@@ -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).
|
||||
|
||||
|
||||
@@ -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<uint16_t, Eigen::half>(c
|
||||
}
|
||||
|
||||
// Specialize multiply-add to match packet operations and reduce conversions to/from float.
|
||||
template<>
|
||||
EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half madd<Eigen::half>(const Eigen::half& x, const Eigen::half& y, const Eigen::half& z) {
|
||||
template <>
|
||||
EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half madd<Eigen::half>(const Eigen::half& x, const Eigen::half& y,
|
||||
const Eigen::half& z) {
|
||||
return Eigen::half(static_cast<float>(x) * static_cast<float>(y) + static_cast<float>(z));
|
||||
}
|
||||
|
||||
|
||||
@@ -170,9 +170,9 @@ class ComplexQZ {
|
||||
template <typename SparseMatrixType_>
|
||||
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; }
|
||||
|
||||
|
||||
@@ -507,7 +507,7 @@ class SparseLU : public SparseSolverBase<SparseLU<MatrixType_, OrderingType_>>,
|
||||
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
|
||||
|
||||
Reference in New Issue
Block a user