Changeset 1a3778 in git for IntegerProgramming/term_ordering.h

Timestamp:

Sep 28, 2022, 5:07:30 PM (19 months ago)

Author:

Frédéric Chapoton <chapoton@…>

Branches:

(u'spielwiese', '6e5adcba05493683b94648c659a729c189812c77')

Children:

aec6fead7ad079baf52b503b680f55839809e605

Parents:

1291fb4c2054a2414ab193f6b00166905b065f98

Message:

fix some typos in IntegerProgramming

File:

• IntegerProgramming/term_ordering.h (modified) (4 diffs)

IntegerProgramming/term_ordering.h

@@ -21 +21 @@
 //   separate function instead of doing it in the constructors.
 
-// For the same reasons as mentionned in the binomial class, frequently
+// For the same reasons as mentioned in the binomial class, frequently
 // used operations on Integer vectors do not perform range checks. Nor do
 // they check if an error has occurred (i.e. control the "error flag", see
@@ -67 +67 @@
   // homogeneous one (i.e. the weighted part), else to FALSE. The standard
   // setting is FALSE.
-  // The routine compare_to_zero is faster if the term ordering is homogenous.
+  // The routine compare_to_zero is faster if the term ordering is homogeneous.
   // It would be safer and more natural to take this flag as a member of
   // the ideal class; this would, however, require many supplementary
@@ -78 +78 @@
   term_ordering(const BOOLEAN& homogeneous=FALSE);
   // Sets weighted_block_size and elimination_block_size to zero.
-  // With this default contructor, the term ordering can be taken as a member
+  // With this default constructor, the term ordering can be taken as a member
   // of another class (the ideal class in our case).
 
@@ -175 +175 @@
   // actual term ordering. The comparison of its two monomials is done
   // according to the binomial data structure:
-  // Instead of comparing explicitely two monomials, the Integer vector
+  // Instead of comparing explicitly two monomials, the Integer vector
   // corresponding to their difference is compared to the zero vector.
   // The function returns