From cd0f12f5ce6023812f76d0f6eb40ee83078c2775 Mon Sep 17 00:00:00 2001 From: Richard Kreckel Date: Sat, 1 Aug 2015 00:41:30 +0200 Subject: [PATCH] Fix some apparent typos and misindentations. --- check/check_numeric.cpp | 2 +- check/exam_clifford.cpp | 42 ++++++++++++++++++------------------- check/exam_inifcns.cpp | 2 +- check/exam_matrices.cpp | 6 +++--- check/exam_misc.cpp | 2 +- check/exam_numeric.cpp | 2 +- check/genex.cpp | 22 +++++++++---------- check/match_bug.cpp | 2 +- check/randomize_serials.cpp | 4 ++-- check/time_uvar_gcd.cpp | 2 +- ginac/archive.cpp | 2 +- ginac/clifford.cpp | 4 ++-- ginac/color.cpp | 4 ++-- ginac/excompiler.cpp | 4 ++-- ginac/expairseq.cpp | 2 +- ginac/expairseq.h | 4 ++-- ginac/flags.h | 4 ++-- ginac/indexed.cpp | 4 ++-- ginac/indexed.h | 4 ++-- ginac/inifcns.cpp | 2 +- ginac/inifcns_nstdsums.cpp | 2 +- ginac/integral.cpp | 2 +- ginac/matrix.cpp | 6 +++--- ginac/matrix.h | 2 +- ginac/mul.cpp | 4 ++-- ginac/normal.cpp | 6 +++--- ginac/numeric.h | 2 +- ginac/power.cpp | 2 +- ginac/pseries.cpp | 2 +- ginac/registrar.h | 2 +- ginac/relational.cpp | 2 +- ginac/relational.h | 2 +- ginac/symmetry.h | 2 +- ginac/utils.h | 2 +- 34 files changed, 79 insertions(+), 79 deletions(-) diff --git a/check/check_numeric.cpp b/check/check_numeric.cpp index fe98933a..6c14623f 100644 --- a/check/check_numeric.cpp +++ b/check/check_numeric.cpp @@ -1,6 +1,6 @@ /** @file check_numeric.cpp * - * These exams creates some numbers and check the result of several boolean + * These exams creates some numbers and check the result of several Boolean * tests on these numbers like is_integer() etc... */ /* diff --git a/check/exam_clifford.cpp b/check/exam_clifford.cpp index 69080dde..420089fd 100644 --- a/check/exam_clifford.cpp +++ b/check/exam_clifford.cpp @@ -247,7 +247,7 @@ static unsigned clifford_check3() e = dirac_gamma(mu, 0) * dirac_gamma(mu.toggle_variance(), 1) * dirac_gamma(nu, 0) * dirac_gamma(nu.toggle_variance(), 1); result += check_equal_simplify(dirac_trace(e, 0), 4 * dim * dirac_ONE(1)); result += check_equal_simplify(dirac_trace(e, 1), 4 * dim * dirac_ONE(0)); - // Fails with new tinfo mechanism because the order of gamme matrices with different rl depends on luck. + // Fails with new tinfo mechanism because the order of gamma matrices with different rl depends on luck. // TODO: better check. //result += check_equal_simplify(dirac_trace(e, 2), canonicalize_clifford(e)); // e will be canonicalized by the calculation of the trace result += check_equal_simplify(dirac_trace(e, lst(0, 1)), 16 * dim); @@ -576,34 +576,34 @@ unsigned exam_clifford() result += clifford_check6(ex_to(diag_matrix(lst(-1, 1, s, t))))+clifford_check6(ex_to(diag_matrix(lst(-1, 1, s, t))));; cout << '.' << flush; matrix A(4, 4); - A = 1, 0, 0, 0, // anticommuting, not symmetric, Tr=0 - 0, -1, 0, 0, - 0, 0, 0, -1, - 0, 0, 1, 0; + A = 1, 0, 0, 0, // anticommuting, not symmetric, Tr=0 + 0, -1, 0, 0, + 0, 0, 0, -1, + 0, 0, 1, 0; result += clifford_check6(A)+clifford_check6(A);; cout << '.' << flush; - A = 1, 0, 0, 0, // anticommuting, not symmetric, Tr=2 - 0, 1, 0, 0, - 0, 0, 0, -1, - 0, 0, 1, 0; + A = 1, 0, 0, 0, // anticommuting, not symmetric, Tr=2 + 0, 1, 0, 0, + 0, 0, 0, -1, + 0, 0, 1, 0; result += clifford_check6(A)+clifford_check6(A);; cout << '.' << flush; - A = 1, 0, 0, 0, // not anticommuting, symmetric, Tr=0 - 0, -1, 0, 0, - 0, 0, 0, -1, - 0, 0, -1, 0; + A = 1, 0, 0, 0, // not anticommuting, symmetric, Tr=0 + 0, -1, 0, 0, + 0, 0, 0, -1, + 0, 0, -1, 0; result += clifford_check6(A)+clifford_check6(A);; cout << '.' << flush; - A = 1, 0, 0, 0, // not anticommuting, symmetric, Tr=2 - 0, 1, 0, 0, - 0, 0, 0, -1, - 0, 0, -1, 0; + A = 1, 0, 0, 0, // not anticommuting, symmetric, Tr=2 + 0, 1, 0, 0, + 0, 0, 0, -1, + 0, 0, -1, 0; result += clifford_check6(A)+clifford_check6(A);; cout << '.' << flush; - A = 1, 1, 0, 0, // not anticommuting, not symmetric, Tr=4 - 0, 1, 1, 0, - 0, 0, 1, 1, - 0, 0, 0, 1; + A = 1, 1, 0, 0, // not anticommuting, not symmetric, Tr=4 + 0, 1, 1, 0, + 0, 0, 1, 1, + 0, 0, 0, 1; result += clifford_check6(A)+clifford_check6(A);; cout << '.' << flush; symbol dim("D"); diff --git a/check/exam_inifcns.cpp b/check/exam_inifcns.cpp index bd7168ed..03c25807 100644 --- a/check/exam_inifcns.cpp +++ b/check/exam_inifcns.cpp @@ -349,7 +349,7 @@ static unsigned inifcns_consist_various() return result; } -/* Several tests for derivetives */ +/* Several tests for derivatives */ static unsigned inifcns_consist_derivatives() { unsigned result = 0; diff --git a/check/exam_matrices.cpp b/check/exam_matrices.cpp index 15177661..3e1c25e5 100644 --- a/check/exam_matrices.cpp +++ b/check/exam_matrices.cpp @@ -143,9 +143,9 @@ static unsigned matrix_invert2() ex det = m.determinant(); if ((normal(m_i(0,0)*det) != d) || - (normal(m_i(0,1)*det) != -b) || - (normal(m_i(1,0)*det) != -c) || - (normal(m_i(1,1)*det) != a)) { + (normal(m_i(0,1)*det) != -b) || + (normal(m_i(1,0)*det) != -c) || + (normal(m_i(1,1)*det) != a)) { clog << "inversion of 2x2 matrix " << m << " erroneously returned " << m_i << endl; ++result; diff --git a/check/exam_misc.cpp b/check/exam_misc.cpp index e94ab11b..cdbb7637 100644 --- a/check/exam_misc.cpp +++ b/check/exam_misc.cpp @@ -220,7 +220,7 @@ static unsigned exam_subs() } // And this used to fail in GiNaC 1.5.8 because it first substituted - // exp(x) -> exp(log(x)) -> x, and then substitued again x -> log(x) + // exp(x) -> exp(log(x)) -> x, and then substituted again x -> log(x) e1 = exp(x); e2 = e1.subs(x == log(x)); if (!e2.is_equal(x)) { diff --git a/check/exam_numeric.cpp b/check/exam_numeric.cpp index 27d68f78..8170e364 100644 --- a/check/exam_numeric.cpp +++ b/check/exam_numeric.cpp @@ -1,6 +1,6 @@ /** @file exam_numeric.cpp * - * These exams creates some numbers and check the result of several boolean + * These exams creates some numbers and check the result of several Boolean * tests on these numbers like is_integer() etc... */ /* diff --git a/check/genex.cpp b/check/genex.cpp index fe8ed91d..ce4684c9 100644 --- a/check/genex.cpp +++ b/check/genex.cpp @@ -55,13 +55,13 @@ dense_bivariate_poly(const symbol & x1, const symbol & x2, unsigned degree) return bipoly; } -/* Chose a randum symbol or number from the argument list. */ +/* Chose a random symbol or number from the argument list. */ const ex random_symbol(const symbol & x, - const symbol & y, - const symbol & z, - bool rational = true, - bool complex = false) + const symbol & y, + const symbol & z, + bool rational = true, + bool complex = false) { ex e; switch (abs(rand()) % 4) { @@ -93,12 +93,12 @@ random_symbol(const symbol & x, /* Create a sparse random tree in three symbols. */ const ex sparse_tree(const symbol & x, - const symbol & y, - const symbol & z, - int level, - bool trig = false, // true includes trigonomatric functions - bool rational = true, // false excludes coefficients in Q - bool complex = false) // true includes complex numbers + const symbol & y, + const symbol & z, + int level, + bool trig = false, // true includes trigonometric functions + bool rational = true, // false excludes coefficients in Q + bool complex = false) // true includes complex numbers { if (level == 0) return random_symbol(x,y,z,rational,complex); diff --git a/check/match_bug.cpp b/check/match_bug.cpp index 1d4ef372..87434a98 100644 --- a/check/match_bug.cpp +++ b/check/match_bug.cpp @@ -30,7 +30,7 @@ using namespace GiNaC; /* * basic::match(lst&) used to have an obscure side effect: repl_lst * could be modified even if the match failed! Although this "feature" - * was documented it happend to be very confusing *even for GiNaC + * was documented it happened to be very confusing *even for GiNaC * developers*, see * http://www.ginac.de/pipermail/ginac-devel/2006-April/000942.html * diff --git a/check/randomize_serials.cpp b/check/randomize_serials.cpp index b0e53ba4..5016a0c0 100644 --- a/check/randomize_serials.cpp +++ b/check/randomize_serials.cpp @@ -1,6 +1,6 @@ /** @file randomize_serials.cpp * - * Utilitiy function used by the benchmarks. + * Utility function used by the benchmarks. */ /* @@ -28,7 +28,7 @@ using namespace GiNaC; #include using namespace std; -/** Generate a random amount of symbols and destroy them again immediatly. +/** Generate a random amount of symbols and destroy them again immediately. * This operation effectively makes the serial numbers of all subsequent * symbols unpredictable. If the serials are unpredictable, then so are * their hash values. If the hash values are unpredictable, then so are diff --git a/check/time_uvar_gcd.cpp b/check/time_uvar_gcd.cpp index 10135d77..11fbe1ec 100644 --- a/check/time_uvar_gcd.cpp +++ b/check/time_uvar_gcd.cpp @@ -1883,7 +1883,7 @@ run_with_random_intputs(const unsigned d1, const unsigned d2) int main(int argc, char** argv) { - std::cout << "timing univarite GCD" << std::endl << std::flush; + std::cout << "timing univariate GCD" << std::endl << std::flush; run_with_random_intputs(100, 50); // run PRS gcd tests, both with upoly and ex run_test(p1_srep, p2_srep, true, true); diff --git a/ginac/archive.cpp b/ginac/archive.cpp index d3a7f63f..fc9ec2c4 100644 --- a/ginac/archive.cpp +++ b/ginac/archive.cpp @@ -320,7 +320,7 @@ archive_atom archive::atomize(const std::string &s) const const std::string &archive::unatomize(archive_atom id) const { if (id >= atoms.size()) - throw (std::range_error("archive::unatomizee(): atom ID out of range")); + throw (std::range_error("archive::unatomize(): atom ID out of range")); return atoms[id]; } diff --git a/ginac/clifford.cpp b/ginac/clifford.cpp index 7d55bee1..a66c8355 100644 --- a/ginac/clifford.cpp +++ b/ginac/clifford.cpp @@ -349,7 +349,7 @@ bool diracgamma::contract_with(exvector::iterator self, exvector::iterator other if (is_a(*other)) { - // Contraction only makes sense if the represenation labels are equal + // Contraction only makes sense if the representation labels are equal if (ex_to(*other).get_representation_label() != rl) return false; @@ -456,7 +456,7 @@ bool cliffordunit::contract_with(exvector::iterator self, exvector::iterator oth unsigned char rl = unit.get_representation_label(); if (is_a(*other)) { - // Contraction only makes sense if the represenation labels are equal + // Contraction only makes sense if the representation labels are equal // and the metrics are the same if ((ex_to(*other).get_representation_label() != rl) && unit.same_metric(*other)) diff --git a/ginac/color.cpp b/ginac/color.cpp index 891d55c1..9a0d3534 100644 --- a/ginac/color.cpp +++ b/ginac/color.cpp @@ -195,7 +195,7 @@ ex color::thiscontainer(std::auto_ptr vp) const * * @param iv3 Vector of 3 indices * @param iv2 Vector of 2 indices, must be a subset of iv3 - * @param sig Returs sign introduced by index permutation + * @param sig Returns sign introduced by index permutation * @return the free index (the one that is in iv3 but not in iv2) */ static ex permute_free_index_to_front(const exvector & iv3, const exvector & iv2, int & sig) { @@ -314,7 +314,7 @@ bool su3t::contract_with(exvector::iterator self, exvector::iterator other, exve if (is_exactly_a(other->op(0))) { - // Contraction only makes sense if the represenation labels are equal + // Contraction only makes sense if the representation labels are equal GINAC_ASSERT(is_a(*other)); if (ex_to(*other).get_representation_label() != rl) return false; diff --git a/ginac/excompiler.cpp b/ginac/excompiler.cpp index c3323512..d7897c01 100644 --- a/ginac/excompiler.cpp +++ b/ginac/excompiler.cpp @@ -72,7 +72,7 @@ class excompiler std::vector filelist; /**< List of all opened modules */ public: /** - * Complete clean-up of opend modules is done on destruction. + * Complete clean-up of opened modules is done on destruction. */ ~excompiler() { @@ -181,7 +181,7 @@ public: }; /** - * This static object manages the modules opened by the complile_ex and link_ex + * This static object manages the modules opened by the compile_ex and link_ex * functions. On program termination its dtor is called and all open modules * are closed. The associated source and so-files are eventually deleted then * as well. diff --git a/ginac/expairseq.cpp b/ginac/expairseq.cpp index fe03ce89..c7b3e9ed 100644 --- a/ginac/expairseq.cpp +++ b/ginac/expairseq.cpp @@ -1524,7 +1524,7 @@ bool expairseq::is_canonical() const return 1; #if EXPAIRSEQ_USE_HASHTAB - if (hashtabsize > 0) return 1; // not canoncalized + if (hashtabsize > 0) return 1; // not canonicalized #endif // EXPAIRSEQ_USE_HASHTAB epvector::const_iterator it = seq.begin(), itend = seq.end(); diff --git a/ginac/expairseq.h b/ginac/expairseq.h index fca1e670..82489f8c 100644 --- a/ginac/expairseq.h +++ b/ginac/expairseq.h @@ -175,9 +175,9 @@ protected: }; /** Class to handle the renaming of dummy indices. It holds a vector of - * indices that are being used in the expression so-far. If the same + * indices that are being used in the expression so far. If the same * index occurs again as a dummy index in a factor, it is to be renamed. - * Unless dummy index renaming was swichted of, of course ;-) . */ + * Unless dummy index renaming was switched off, of course ;-) . */ class make_flat_inserter { public: diff --git a/ginac/flags.h b/ginac/flags.h index b9f47164..41965e50 100644 --- a/ginac/flags.h +++ b/ginac/flags.h @@ -32,7 +32,7 @@ public: expand_indexed = 0x0001, ///< expands (a+b).i to a.i+b.i expand_function_args = 0x0002, ///< expands the arguments of functions expand_rename_idx = 0x0004, ///< used internally by mul::expand() - expand_transcendental = 0x0008 ///< expands trancendental functions like log and exp + expand_transcendental = 0x0008 ///< expands transcendental functions like log and exp }; }; @@ -55,7 +55,7 @@ public: pattern_is_product = 0x0004, ///< used internally by expairseq::subschildren() pattern_is_not_product = 0x0008, ///< used internally by expairseq::subschildren() no_index_renaming = 0x0010, - // To indicate that we want to substitue an index by something that is + // To indicate that we want to substitute an index by something that // is not an index. Without this flag the index value would be // substituted in that case. really_subs_idx = 0x0020 diff --git a/ginac/indexed.cpp b/ginac/indexed.cpp index b62e5d4d..873a9ad0 100644 --- a/ginac/indexed.cpp +++ b/ginac/indexed.cpp @@ -648,7 +648,7 @@ bool reposition_dummy_indices(ex & e, exvector & variant_dummy_indices, exvector } // In the case where a dummy symbol occurs twice in the same indexed object - // we try all posibilities of raising/lowering and keep the least one in + // we try all possibilities of raising/lowering and keep the least one in // the sense of ex_is_less. ex optimal_e = e; size_t numpossibs = 1 << local_var_dummies.size(); @@ -988,7 +988,7 @@ public: terminfo(const ex & orig_, const ex & symm_) : orig(orig_), symm(symm_) {} ex orig; /**< original term */ - ex symm; /**< symmtrized term */ + ex symm; /**< symmetrized term */ }; class terminfo_is_less { diff --git a/ginac/indexed.h b/ginac/indexed.h index 4edfd0cb..69e03692 100644 --- a/ginac/indexed.h +++ b/ginac/indexed.h @@ -255,7 +255,7 @@ protected: exvector get_all_dummy_indices(const ex & e); /** More reliable version of the form. The former assumes that e is an - * expanded epxression. */ + * expanded expression. */ exvector get_all_dummy_indices_safely(const ex & e); /** Returns b with all dummy indices, which are listed in va, renamed @@ -279,7 +279,7 @@ lst rename_dummy_indices_uniquely(const exvector & va, const exvector & vb); * indices with the corresponding numeric values without variance. * * @param e the given expression - * @param subs_idx indicates if variance of dummy indixes should be neglected + * @param subs_idx indicates if variance of dummy indices should be neglected */ ex expand_dummy_sum(const ex & e, bool subs_idx = false); diff --git a/ginac/inifcns.cpp b/ginac/inifcns.cpp index ecb6e007..9ac5ceba 100644 --- a/ginac/inifcns.cpp +++ b/ginac/inifcns.cpp @@ -956,7 +956,7 @@ static ex binomial_eval(const ex & x, const ex &y) return binomial(x, y).hold(); } -// At the moment the numeric evaluation of a binomail function always +// At the moment the numeric evaluation of a binomial function always // gives a real number, but if this would be implemented using the gamma // function, also complex conjugation should be changed (or rather, deleted). static ex binomial_conjugate(const ex & x, const ex & y) diff --git a/ginac/inifcns_nstdsums.cpp b/ginac/inifcns_nstdsums.cpp index ee667752..24a17a60 100644 --- a/ginac/inifcns_nstdsums.cpp +++ b/ginac/inifcns_nstdsums.cpp @@ -25,7 +25,7 @@ * 0, 1 and -1 --- or in compactified --- a string with zeros in front of 1 or -1 is written as a single * number --- notation. * - * - All functions can be nummerically evaluated with arguments in the whole complex plane. The parameters + * - All functions can be numerically evaluated with arguments in the whole complex plane. The parameters * for Li, zeta and S must be positive integers. If you want to have an alternating Euler sum, you have * to give the signs of the parameters as a second argument s to zeta(m,s) containing 1 and -1. * diff --git a/ginac/integral.cpp b/ginac/integral.cpp index 170522af..7a9fcbb3 100644 --- a/ginac/integral.cpp +++ b/ginac/integral.cpp @@ -185,7 +185,7 @@ ex integral::evalf(int level) const } // 12.34 is just an arbitrary number used to check whether a number - // results after subsituting a number for the integration variable. + // results after substituting a number for the integration variable. if (is_exactly_a(ea) && is_exactly_a(eb) && is_exactly_a(ef.subs(x==12.34).evalf())) { return adaptivesimpson(x, ea, eb, ef); diff --git a/ginac/matrix.cpp b/ginac/matrix.cpp index cfe3d6ec..3c46b17e 100644 --- a/ginac/matrix.cpp +++ b/ginac/matrix.cpp @@ -888,7 +888,7 @@ ex matrix::trace() const /** Characteristic Polynomial. Following mathematica notation the - * characteristic polynomial of a matrix M is defined as the determiant of + * characteristic polynomial of a matrix M is defined as the determinant of * (M - lambda * 1) where 1 stands for the unit matrix of the same dimension * as M. Note that some CASs define it with a sign inside the determinant * which gives rise to an overall sign if the dimension is odd. This method @@ -1118,7 +1118,7 @@ unsigned matrix::rank() const * more than once. According to W.M.Gentleman and S.C.Johnson this algorithm * is better than elimination schemes for matrices of sparse multivariate * polynomials and also for matrices of dense univariate polynomials if the - * matrix' dimesion is larger than 7. + * matrix' dimension is larger than 7. * * @return the determinant as a new expression (in expanded form) * @see matrix::determinant() */ @@ -1496,7 +1496,7 @@ int matrix::fraction_free_elimination(const bool det) * @param co is the column to be inspected * @param symbolic signal if we want the first non-zero element to be pivoted * (true) or the one with the largest absolute value (false). - * @return 0 if no interchange occured, -1 if all are zero (usually signaling + * @return 0 if no interchange occurred, -1 if all are zero (usually signaling * a degeneracy) and positive integer k means that rows ro and k were swapped. */ int matrix::pivot(unsigned ro, unsigned co, bool symbolic) diff --git a/ginac/matrix.h b/ginac/matrix.h index 56470651..759e825a 100644 --- a/ginac/matrix.h +++ b/ginac/matrix.h @@ -101,7 +101,7 @@ public: matrix(unsigned r, unsigned c, const exvector & m2); matrix(unsigned r, unsigned c, const lst & l); - // First step of initialization of matrix with a comma-separated seqeuence + // First step of initialization of matrix with a comma-separated sequence // of expressions. Subsequent steps are handled by matrix_init<>::operator,(). matrix_init operator=(const ex & x) { diff --git a/ginac/mul.cpp b/ginac/mul.cpp index 22133a74..07209088 100644 --- a/ginac/mul.cpp +++ b/ginac/mul.cpp @@ -764,7 +764,7 @@ bool tryfactsubs(const ex & origfactor, const ex & patternfactor, int & nummatch return true; } -/** Checks wheter e matches to the pattern pat and the (possibly to be updated) +/** Checks whether e matches to the pattern pat and the (possibly to be updated) * list of replacements repls. This matching is in the sense of algebraic * substitutions. Matching starts with pat.op(factor) of the pattern because * the factors before this one have already been matched. The (possibly @@ -1293,7 +1293,7 @@ ex mul::expand(unsigned options) const /** Member-wise expand the expairs representing this sequence. This must be * overridden from expairseq::expandchildren() and done iteratively in order - * to allow for early cancallations and thus safe memory. + * to allow for early cancellations and thus safe memory. * * @see mul::expand() * @return pointer to epvector containing expanded representation or zero diff --git a/ginac/normal.cpp b/ginac/normal.cpp index f22bf27b..954529e6 100644 --- a/ginac/normal.cpp +++ b/ginac/normal.cpp @@ -1912,7 +1912,7 @@ ex sqrfree(const ex &a, const lst &l) else result *= quo(tmp, result, x); - // Put in the reational overall factor again and return + // Put in the rational overall factor again and return return result * lcm.inverse(); } @@ -2212,7 +2212,7 @@ ex add::normal(exmap & repl, exmap & rev_lookup, int level) const num_it++; den_it++; } - // Additiion of two fractions, taking advantage of the fact that + // Addition of two fractions, taking advantage of the fact that // the heuristic GCD algorithm computes the cofactors at no extra cost ex co_den1, co_den2; ex g = gcd(den, next_den, &co_den1, &co_den2, false); @@ -2398,7 +2398,7 @@ ex ex::denom() const return e.op(1).subs(repl, subs_options::no_pattern); } -/** Get numerator and denominator of an expression. If the expresison is not +/** Get numerator and denominator of an expression. If the expression is not * of the normal form "numerator/denominator", it is first converted to this * form and then a list [numerator, denominator] is returned. * diff --git a/ginac/numeric.h b/ginac/numeric.h index 4bb8ad28..0a6df50a 100644 --- a/ginac/numeric.h +++ b/ginac/numeric.h @@ -50,7 +50,7 @@ typedef void (* digits_changed_callback)(long); * than a dumber basic type since as a side-effect we let it change * cl_default_float_format when it gets changed. The only other * meaningful thing to do with it is converting it to an unsigned, - * for temprary storing its value e.g. The user must not create an + * for temporarily storing its value e.g. The user must not create an * own working object of this class! Since C++ forces us to make the * class definition visible in order to use an object we put in a * flag which prevents other objects of that class to be created. */ diff --git a/ginac/power.cpp b/ginac/power.cpp index c3fe14a1..1a4f57db 100644 --- a/ginac/power.cpp +++ b/ginac/power.cpp @@ -913,7 +913,7 @@ ex power::expand(unsigned options) const namespace { // anonymous namespace for power::expand_add() helpers /** Helper class to generate all bounded combinatorial partitions of an integer - * n with exactly m parts (including zero parts) in non-decreaing order. + * n with exactly m parts (including zero parts) in non-decreasing order. */ class partition_generator { private: diff --git a/ginac/pseries.cpp b/ginac/pseries.cpp index dfffa647..99eed8a2 100644 --- a/ginac/pseries.cpp +++ b/ginac/pseries.cpp @@ -1229,7 +1229,7 @@ ex integral::series(const relational & r, int order, unsigned options) const if (x.subs(r) != x) throw std::logic_error("Cannot series expand wrt dummy variable"); - // Expanding integrant with r substituted taken in boundaries. + // Expanding integrand with r substituted taken in boundaries. ex fseries = f.series(r, order, options); epvector fexpansion; fexpansion.reserve(fseries.nops()); diff --git a/ginac/registrar.h b/ginac/registrar.h index 27bfc7ab..cb351716 100644 --- a/ginac/registrar.h +++ b/ginac/registrar.h @@ -45,7 +45,7 @@ struct return_type_t /// to distinguish between non-commutative objects of different type. std::type_info const* tinfo; /// to distinguish between non-commutative objects of the same type. - /// Think of gamma matrices with different represenation labels. + /// Think of gamma matrices with different representation labels. unsigned rl; /// Strict weak ordering (so one can put return_type_t's into diff --git a/ginac/relational.cpp b/ginac/relational.cpp index 11c29b83..37063e6a 100644 --- a/ginac/relational.cpp +++ b/ginac/relational.cpp @@ -322,7 +322,7 @@ relational::safe_bool relational::make_safe_bool(bool cond) const return cond? &safe_bool_helper::nonnull : 0; } -/** Cast the relational into a boolean, mainly for evaluation within an +/** Cast the relational into a Boolean, mainly for evaluation within an * if-statement. Note that (a=b) == true in * the general symbolic case. A false result means the comparison is either * false or undecidable (except of course for !=, where true means either diff --git a/ginac/relational.h b/ginac/relational.h index 6c7ebbae..6983cbfa 100644 --- a/ginac/relational.h +++ b/ginac/relational.h @@ -82,7 +82,7 @@ public: // non-virtual functions in this class private: - // For conversions to boolean, as would be used in an if conditional, + // For conversions to Boolean, as would be used in an if conditional, // implicit conversions from bool to int have a large number of // undesirable side effects. The following safe_bool type enables // use of relational objects in conditionals without those side effects diff --git a/ginac/symmetry.h b/ginac/symmetry.h index 2f396395..6839e756 100644 --- a/ginac/symmetry.h +++ b/ginac/symmetry.h @@ -167,7 +167,7 @@ inline ex antisymmetrize(const ex & e, const exvector & v) return antisymmetrize(e, v.begin(), v.end()); } -/** Symmetrize expression by cyclic permuation over a set of objects +/** Symmetrize expression by cyclic permutation over a set of objects * (symbols, indices). */ ex symmetrize_cyclic(const ex & e, exvector::const_iterator first, exvector::const_iterator last); diff --git a/ginac/utils.h b/ginac/utils.h index dd39d42e..042f14cb 100644 --- a/ginac/utils.h +++ b/ginac/utils.h @@ -49,7 +49,7 @@ class dunno {}; unsigned log2(unsigned n); /** Rotate bits of unsigned value by one bit to the left. - * This can be necesary if the user wants to define its own hashes. */ + * This can be necessary if the user wants to define its own hashes. */ inline unsigned rotate_left(unsigned n) { return (n & 0x80000000U) ? (n << 1 | 0x00000001U) : (n << 1); -- 2.44.0