devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

fixing a lot of typos

Browse Source
This commit is contained in:
Frédéric Chapoton
2024-07-30 22:15:49 +00:00
committed by Charles Schlosser
parent c29c800126
commit 6331da95eb
43 changed files with 73 additions and 74 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Eigen/src/SparseCore/SparseCwiseBinaryOp.h
View File

@@ -834,7 +834,7 @@ struct sparse_disjunction_evaluator<XprType, IteratorBased, IndexBased> : evalua
const XprType& m_expr;
};
// when DupFunc is wrapped with scalar_dup_op, use disjunction evaulator
// when DupFunc is wrapped with scalar_dup_op, use disjunction evaluator
template <typename T1, typename T2, typename DupFunc, typename Lhs, typename Rhs>
struct binary_evaluator<CwiseBinaryOp<scalar_disjunction_op<DupFunc, T1, T2>, Lhs, Rhs>, IteratorBased, IteratorBased>
: sparse_disjunction_evaluator<CwiseBinaryOp<scalar_disjunction_op<DupFunc, T1, T2>, Lhs, Rhs> > {

8
Eigen/src/SparseCore/SparseMatrix.h
View File

@@ -250,7 +250,7 @@ class SparseMatrix : public SparseCompressedBase<SparseMatrix<Scalar_, Options_,
}
}
if ((dst < end) && (m_data.index(dst) == inner)) {
// this coefficient exists, return a refernece to it
// this coefficient exists, return a reference to it
if (inserted != nullptr) {
*inserted = false;
}
@@ -1226,8 +1226,8 @@ void set_from_triplets_sorted(const InputIterator& begin, const InputIterator& e
// matrix is finalized
}
// thin wrapper around a generic binary functor to use the sparse disjunction evaulator instead of the default
// "arithmetic" evaulator
// thin wrapper around a generic binary functor to use the sparse disjunction evaluator instead of the default
// "arithmetic" evaluator
template <typename DupFunctor, typename LhsScalar, typename RhsScalar = LhsScalar>
struct scalar_disjunction_op {
using result_type = typename result_of<DupFunctor(LhsScalar, RhsScalar)>::type;
@@ -1633,7 +1633,7 @@ SparseMatrix<Scalar_, Options_, StorageIndex_>::insertCompressedAtByOuterInner(I
// first, check if there is adequate allocated memory
if (m_data.allocatedSize() <= m_data.size()) {
// if there is no capacity for a single insertion, double the capacity
// increase capacity by a mininum of 32
// increase capacity by a minimum of 32
Index minReserve = 32;
Index reserveSize = numext::maxi(minReserve, m_data.allocatedSize());
m_data.reserve(reserveSize);

2
Eigen/src/SparseCore/SparseSelfAdjointView.h
View File

@@ -143,7 +143,7 @@ class SparseSelfAdjointView : public EigenBase<SparseSelfAdjointView<MatrixType,
return *this = src.twistedBy(pnull);
}
// Since we override the copy-assignment operator, we need to explicitly re-declare the copy-constructor
// Since we override the copy-assignment operator, we need to explicitly redeclare the copy-constructor
EIGEN_DEFAULT_COPY_CONSTRUCTOR(SparseSelfAdjointView)
template <typename SrcMatrixType, unsigned int SrcMode>

2
Eigen/src/SparseCore/SparseVector.h
View File

@@ -109,7 +109,7 @@ class SparseVector : public SparseCompressedBase<SparseVector<Scalar_, Options_,
}
/** \returns a reference to the coefficient value at given index \a i
* This operation involes a log(rho*size) binary search. If the coefficient does not
* This operation involves a log(rho*size) binary search. If the coefficient does not
* exist yet, then a sorted insertion into a sequential buffer is performed.
*
* This insertion might be very costly if the number of nonzeros above \a i is large.