From 239bfb08882b0aa089d68bad145f61397134b2f0 Mon Sep 17 00:00:00 2001 From: Richard Kreckel Date: Wed, 13 Apr 2016 08:50:41 +0200 Subject: [PATCH] Fix typos in comments. --- check/exam_clifford.cpp | 2 +- check/exam_misc.cpp | 2 +- check/exam_paranoia.cpp | 2 +- check/randomize_serials.cpp | 2 +- check/time_antipode.cpp | 2 +- doc/tutorial/ginac.texi | 2 +- ginac/function.cppy | 4 ++-- ginac/normal.cpp | 2 +- ginac/normal.h | 2 +- ginac/numeric.cpp | 6 +++--- ginac/parser/parser.cpp | 2 +- ginac/polynomial/collect_vargs.cpp | 2 +- ginac/polynomial/mgcd.cpp | 2 +- ginac/polynomial/optimal_vars_finder.cpp | 2 +- 14 files changed, 17 insertions(+), 17 deletions(-) diff --git a/check/exam_clifford.cpp b/check/exam_clifford.cpp index d07ded14..6b1f53f8 100644 --- a/check/exam_clifford.cpp +++ b/check/exam_clifford.cpp @@ -571,7 +571,7 @@ unsigned exam_clifford() result += clifford_check6(ex_to(diag_matrix({-1, 0, 1, -1})))+clifford_check6(ex_to(diag_matrix({-1, 0, 1, -1})));; cout << '.' << flush; result += clifford_check6(ex_to(diag_matrix({-3, 0, 2, -1})))+clifford_check6(ex_to(diag_matrix({-3, 0, 2, -1})));; cout << '.' << flush; - realsymbol s("s"), t("t"); // symbolic entries in matric + realsymbol s("s"), t("t"); // symbolic entries in matrix result += clifford_check6(ex_to(diag_matrix({-1, 1, s, t})))+clifford_check6(ex_to(diag_matrix({-1, 1, s, t})));; cout << '.' << flush; matrix A(4, 4); diff --git a/check/exam_misc.cpp b/check/exam_misc.cpp index 06c75866..ff1c5ef0 100644 --- a/check/exam_misc.cpp +++ b/check/exam_misc.cpp @@ -164,7 +164,7 @@ static unsigned exam_operator_semantics() ++result; } - // Prefix/postfix increment/decrement behaviour: + // Prefix/postfix increment/decrement behavior: e1 = 7; e2 = 4; i1 = 7; i2 = 4; e1 = (--e2 = 2)++; diff --git a/check/exam_paranoia.cpp b/check/exam_paranoia.cpp index 5c8ef03c..47c03a0c 100644 --- a/check/exam_paranoia.cpp +++ b/check/exam_paranoia.cpp @@ -1,7 +1,7 @@ /** @file exam_paranoia.cpp * * This set of tests checks for some of GiNaC's oopses which showed up during - * development. Things were evaluated wrongly and so. Such a sick behaviour + * development. Things were evaluated wrongly and so. Such a sick behavior * shouldn't occur any more. But we are paranoic and we want to exclude these * these oopses for good, so we run those stupid tests... */ diff --git a/check/randomize_serials.cpp b/check/randomize_serials.cpp index 11185f0b..5c4f3e44 100644 --- a/check/randomize_serials.cpp +++ b/check/randomize_serials.cpp @@ -34,7 +34,7 @@ using namespace std; * their hash values. If the hash values are unpredictable, then so are * the canonical orderings. If the canonical orderings are unpredictable, * all subsequent times are subject to some variation. This variation, - * however is natural and desireable for two reasons: First, we cannot know + * however is natural and desirable for two reasons: First, we cannot know * how many symbols have been generated before in real world computations. * Second, the following timings are subject to some semi-random variation * anyways because short timings need to be repeated until enough time has diff --git a/check/time_antipode.cpp b/check/time_antipode.cpp index ba1169b4..a58a351b 100644 --- a/check/time_antipode.cpp +++ b/check/time_antipode.cpp @@ -133,7 +133,7 @@ const ex Sigma::evaluate(const symbol &x, const unsigned grad) const } -/** Class of vertices of type Sigma_flipped, sitting in the upper fermionline of Vacuum; no consequences for Gamma. */ +/** Class of vertices of type Sigma_flipped, sitting in the upper fermion line of Vacuum; no consequences for Gamma. */ class Sigma_flipped : public Sigma { public: Sigma_flipped(ijpair ij = ijpair(0,0)) : Sigma(ij) { } diff --git a/doc/tutorial/ginac.texi b/doc/tutorial/ginac.texi index 17718f83..b69455d7 100644 --- a/doc/tutorial/ginac.texi +++ b/doc/tutorial/ginac.texi @@ -5979,7 +5979,7 @@ If both flags are set (as in the last call), then GiNaC tries to get the maximal expansion. For example, for the exponent GiNaC firstly expands the argument and then the function. For the logarithm and absolute value, GiNaC uses the opposite order: firstly expands the function and then its -argument. Of course, a user can fine-tune this behaviour by sequential +argument. Of course, a user can fine-tune this behavior by sequential calls of several @code{expand()} methods with desired flags. @node Multiple polylogarithms, Complex expressions, Built-in functions, Methods and functions diff --git a/ginac/function.cppy b/ginac/function.cppy index 7df57168..83564833 100644 --- a/ginac/function.cppy +++ b/ginac/function.cppy @@ -448,7 +448,7 @@ ex function::evalf() const } /** - * This method is defined to be in line with behaviour of function::return_type() + * This method is defined to be in line with behavior of function::return_type() */ ex function::eval_ncmul(const exvector & v) const { @@ -764,7 +764,7 @@ ex function::expl_derivative(const symbol & s) const // explicit differentiation // end of generated lines } } - // There is no fallback for explicit deriviative. + // There is no fallback for explicit derivative. throw(std::logic_error("function::expl_derivative(): explicit derivation is called, but no such function defined")); } diff --git a/ginac/normal.cpp b/ginac/normal.cpp index 462a8ad5..8b6c25c6 100644 --- a/ginac/normal.cpp +++ b/ginac/normal.cpp @@ -146,7 +146,7 @@ struct sym_desc { /** Maximum number of terms of leading coefficient of symbol in both polynomials */ size_t max_lcnops; - /** Commparison operator for sorting */ + /** Comparison operator for sorting */ bool operator<(const sym_desc &x) const { if (max_deg == x.max_deg) diff --git a/ginac/normal.h b/ginac/normal.h index 7e949864..739ed598 100644 --- a/ginac/normal.h +++ b/ginac/normal.h @@ -31,7 +31,7 @@ namespace GiNaC { /** - * Flags to control the behaviour of gcd() and friends + * Flags to control the behavior of gcd() and friends */ struct gcd_options { diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp index e45fe9c9..74e20e8a 100644 --- a/ginac/numeric.cpp +++ b/ginac/numeric.cpp @@ -89,7 +89,7 @@ numeric::numeric() numeric::numeric(int i) { // Not the whole int-range is available if we don't cast to long - // first. This is due to the behaviour of the cl_I-ctor, which + // first. This is due to the behavior of the cl_I-ctor, which // emphasizes efficiency. However, if the integer is small enough // we save space and dereferences by using an immediate type. // (C.f. ) @@ -110,7 +110,7 @@ numeric::numeric(int i) numeric::numeric(unsigned int i) { // Not the whole uint-range is available if we don't cast to ulong - // first. This is due to the behaviour of the cl_I-ctor, which + // first. This is due to the behavior of the cl_I-ctor, which // emphasizes efficiency. However, if the integer is small enough // we save space and dereferences by using an immediate type. // (C.f. ) @@ -2217,7 +2217,7 @@ const numeric bernoulli(const numeric &nn) results.reserve(n/2); for (unsigned p=next_r; p<=n; p+=2) { - cln::cl_I c = 1; // seed for binonmial coefficients + cln::cl_I c = 1; // seed for binomial coefficients cln::cl_RA b = cln::cl_RA(p-1)/-2; // The CLN manual says: "The conversion from `unsigned int' works only // if the argument is < 2^29" (This is for 32 Bit machines. More diff --git a/ginac/parser/parser.cpp b/ginac/parser/parser.cpp index cdfc5af6..8cb3bf14 100644 --- a/ginac/parser/parser.cpp +++ b/ginac/parser/parser.cpp @@ -158,7 +158,7 @@ ex parser::parse_unary_expr() // -(a) // +a // +(a) - // Delegete the work to parse_binop_rhs(), otherwise we end up + // Delegate the work to parse_binop_rhs(), otherwise we end up // duplicating it here. ex lhs = _ex0; // silly trick ex e = parse_binop_rhs(0, lhs); diff --git a/ginac/polynomial/collect_vargs.cpp b/ginac/polynomial/collect_vargs.cpp index e77a3b67..93819d37 100644 --- a/ginac/polynomial/collect_vargs.cpp +++ b/ginac/polynomial/collect_vargs.cpp @@ -129,7 +129,7 @@ static void wipe_out_zeros(ex_collect_priv_t& m) { auto i = m.begin(); while (i != m.end()) { - // be careful to not invalide iterator, use post-increment + // be careful to not invalidate the iterator, use post-increment // for that, see e.g. // http://coding.derkeiler.com/Archive/C_CPP/comp.lang.cpp/2004-02/0502.html if (i->second.is_zero()) diff --git a/ginac/polynomial/mgcd.cpp b/ginac/polynomial/mgcd.cpp index d66369ee..e546fea3 100644 --- a/ginac/polynomial/mgcd.cpp +++ b/ginac/polynomial/mgcd.cpp @@ -52,7 +52,7 @@ static cln::cl_I extract_integer_content(ex& Apr, const ex& A) } } else { Apr = (A/icont_).expand(); - // A is a polynomail over rationals, so GCD is defined + // A is a polynomial over rationals, so GCD is defined // up to arbitrary rational number. return n1; } diff --git a/ginac/polynomial/optimal_vars_finder.cpp b/ginac/polynomial/optimal_vars_finder.cpp index 58696bc4..5f4fc961 100644 --- a/ginac/polynomial/optimal_vars_finder.cpp +++ b/ginac/polynomial/optimal_vars_finder.cpp @@ -72,7 +72,7 @@ struct sym_desc /** Maximum number of terms of leading coefficient of symbol in both polynomials */ std::size_t max_lcnops; - /** Commparison operator for sorting */ + /** Comparison operator for sorting */ bool operator<(const sym_desc &x) const { if (max_deg == x.max_deg) -- 2.47.0