Fix typos.

Author: waywardmonkeys

changelog.in

@@ -872,7 +872,7 @@ Thanks: Rui Machado, Jens Krüger
 The alignment of memory allocated from a Region is now as
 prescribed by the maximum of std::max_align_t and
 GECODE_MEMORY_ALIGNMENT (which can be re-defined). Please also check
-MPG for a tip on alignment of memory handeled by Gecode.
+MPG for a tip on alignment of memory handled by Gecode.
 
 [ENTRY]
 Module: flatzinc
@@ -901,7 +901,7 @@ Module: int
 What:   bug
 Rank:   major
 [DESCRIPTION]
-Fixed scheduling for Boolean variables (funnily, only occured
+Fixed scheduling for Boolean variables (funnily, only occurred
 with a newly added propagator).
 
 [ENTRY]
@@ -1908,7 +1908,7 @@ What:   bug
 Rank:   major
 [DESCRIPTION]
 In certain situations the AFC could be incremented twice (could
-only have occured for linear constraints with Boolean variables
+only have occurred for linear constraints with Boolean variables
 and sequence constraints).
 
 [ENTRY]
@@ -2154,7 +2154,7 @@ What:   bug
 Rank:   major
 Thanks: Matthias Balzer
 [DESCRIPTION]
-Fixed memory leak for regions (occured for many large allocation
+Fixed memory leak for regions (occurred for many large allocation
 requests).
 
 [ENTRY]
@@ -4628,7 +4628,7 @@ What:   change
 Rank:   minor
 [DESCRIPTION]
 The semantics of n-ary Boolean implication has been changed (to
-the more convential reading): rel(home, BOT_IMP, x, y) where x is
+the more conventional reading): rel(home, BOT_IMP, x, y) where x is
 an array of Boolean variable now assumes implication to be right
 associative. See MPG for explanation.
 
@@ -4688,7 +4688,7 @@ What:   bug
 Rank:   major
 [DESCRIPTION]
 Do not use SharedArray<IntSet> in the set element constraints,
-because it does not properly udpate the IntSet during copying.
+because it does not properly update the IntSet during copying.
 This could cause memory corruption.
 
 [ENTRY]
@@ -4891,7 +4891,7 @@ Rank:   minor
 Cached iterators such as n-ary union and intersection, minus, and
 cache (of course) are not any longer template classes but take
 template constructors and member functions. N-ary union and
-intersection iterators can now also be initialized incrementaly
+intersection iterators can now also be initialized incrementally
 with iterators of different types.
 
 [ENTRY]
@@ -5897,7 +5897,7 @@ What:   bug
 Rank:   major
 [DESCRIPTION]
 Fixed extensional constraint with finite automata for very
-unlikely (but apparantely possible) border case.
+unlikely (but apparently possible) border case.
 
 [ENTRY]
 Module: gist
@@ -6186,7 +6186,7 @@ What:   removed
 Rank:   minor
 [DESCRIPTION]
 Removed special cases for posting linear and Boolean expressions
-consisting of a single variable only (was highly ambigious).
+consisting of a single variable only (was highly ambiguous).
 
 [ENTRY]
 Module: minimodel
@@ -10398,7 +10398,7 @@ Module: int
 What:   bug
 Rank:   minor
 [DESCRIPTION]
-Fixed subsumption detection for regular with multiple variable occurences.
+Fixed subsumption detection for regular with multiple variable occurrences.
 
 [ENTRY]
 Module: int

configure.ac

@@ -180,7 +180,7 @@ gnu)
     dnl compiler flags for optimize float computings
     dnl AC_GECODE_CHECK_COMPILERFLAG([-ffast-math])
     dnl ffast-math implies:-fno-math-errno -funsafe-math-optimizations -ffinite-math-only -fno-rounding-math -fno-signaling-nans -fcx-limited-range
-    dnl but -funsafe-math-optimizations break IEEE float comptability, so we have to avoid it
+    dnl but -funsafe-math-optimizations break IEEE float compatibility, so we have to avoid it
     AC_GECODE_CHECK_COMPILERFLAG([-fno-math-errno])
     AC_GECODE_CHECK_COMPILERFLAG([-ffinite-math-only])
     AC_GECODE_CHECK_COMPILERFLAG([-fno-rounding-math])

configure.ac.in

@@ -176,7 +176,7 @@ gnu)
     dnl compiler flags for optimize float computings
     dnl AC_GECODE_CHECK_COMPILERFLAG([-ffast-math])
     dnl ffast-math implies:-fno-math-errno -funsafe-math-optimizations -ffinite-math-only -fno-rounding-math -fno-signaling-nans -fcx-limited-range
-    dnl but -funsafe-math-optimizations break IEEE float comptability, so we have to avoid it
+    dnl but -funsafe-math-optimizations break IEEE float compatibility, so we have to avoid it
     AC_GECODE_CHECK_COMPILERFLAG([-fno-math-errno])
     AC_GECODE_CHECK_COMPILERFLAG([-ffinite-math-only])
     AC_GECODE_CHECK_COMPILERFLAG([-fno-rounding-math])

examples/bin-packing.cpp

@@ -559,7 +559,7 @@ main(int argc, char* argv[]) {
   opt.solutions(0);
   opt.parse(argc,argv);
   if (!Spec(opt.instance()).valid()) {
-    std::cerr << "Error: unkown instance" << std::endl;
+    std::cerr << "Error: unknown instance" << std::endl;
     return 1;
   }
   IntMinimizeScript::run<BinPacking,BAB,InstanceOptions>(opt);
@@ -574,7 +574,7 @@ namespace {
    * for exactly solving the one-dimensional bin packing problem.
    * Computers & Operations Research 24 (1997) 627-645.
    *
-   * The item size have been sorted for simplicty.
+   * The item size have been sorted for simplicity.
    *
    */
 
@@ -20778,7 +20778,7 @@ namespace {
    * E. Falkenauer. A hybrid grouping genetic algorithm fir bin packing.
    * Journal of Heuristics, 2:5-30, 1996.
    *
-   * The item size have been sorted for simplicty and fractional capacities
+   * The item size have been sorted for simplicity and fractional capacities
    * have been converted to integers.
    *
    */

examples/car-sequencing.cpp

@@ -77,13 +77,13 @@ namespace {
 
 
   /**
-   * \brief Propagator that pushes all occurences of a value to the end.
+   * \brief Propagator that pushes all occurrences of a value to the end.
    *
    * This propagator uses a variable array \f$x=\langle
    * x_1,x_2,\ldots,x_n\rangle\f$, a variable \f$y\f$, and a value
    * \f$val\f$. It It makes sure that the last \f$y\f$ variables of
    * \f$x\f$ are assigned the value, and that the value does not
-   * appear in the rest of the array. Furthermore, the constriant
+   * appear in the rest of the array. Furthermore, the constraint
    * ensure that \$fval\$f isnot adjacent to \$fval-1\$f.
    *
    * Since the propagator is custom-made for the car sequencing

examples/colored-matrix.cpp

@@ -133,7 +133,7 @@ namespace {
    */
   DFA no_monochrome_rectangle_dfa(int colors);
 
-  /** Return counts for using a global cardninality constraint for the distinct exept 0 constraint.
+  /** Return counts for using a global cardninality constraint for the distinct except 0 constraint.
    */
   IntSetArgs distinct_except_0_counts(int colors, int size);
 
@@ -319,7 +319,7 @@ class ColoredMatrix : public IntMinimizeScript {
   enum {
     SYMMETRY_NONE   = 0,   ///< No symmetry breaking
     SYMMETRY_MATRIX = 1, ///< Order rows and columns of matrix
-    SYMMETRY_VALUES = 2, ///< Order value occurences
+    SYMMETRY_VALUES = 2, ///< Order value occurrences
   };
   /// Model variants
   enum {
@@ -329,9 +329,9 @@ class ColoredMatrix : public IntMinimizeScript {
   };
   /// Not all equal variants
   enum {
-    NOT_ALL_EQUAL_NQ,      ///< Use direct constraint for implemeting not all equals
-    NOT_ALL_EQUAL_NAIVE,   ///< Use naive reification for implemeting not all equals
-    NOT_ALL_EQUAL_REIFIED, ///< Use reification for implemeting not all equals
+    NOT_ALL_EQUAL_NQ,      ///< Use direct constraint for implementing not all equals
+    NOT_ALL_EQUAL_NAIVE,   ///< Use naive reification for implementing not all equals
+    NOT_ALL_EQUAL_REIFIED, ///< Use reification for implementing not all equals
     NOT_ALL_EQUAL_NVALUES, ///< Use nvalues for implementing not all equals
     NOT_ALL_EQUAL_COUNT,   ///< Use count for implementing not all equals
     NOT_ALL_EQUAL_DFA,     ///< Use dfa for implementing not all equals
@@ -400,7 +400,7 @@ class ColoredMatrix : public IntMinimizeScript {
 
     // Symmetry breaking constraints.
     {
-      // Lexical order for all columns and rows (all are interchangable)
+      // Lexical order for all columns and rows (all are interchangeable)
       if (opt.symmetry() & SYMMETRY_MATRIX) {
         for (int r = 0; r < height-1; ++r) {
           rel(*this, m.row(r), IRT_LE, m.row(r+1));

examples/crowded-chess.cpp

@@ -310,8 +310,8 @@ class CrowdedChess : public Script {
       extensional(*this, b, bishops, opt.ipl());
     }
 
-    // Handle knigths
-    // Connect knigths to board
+    // Handle knights
+    // Connect knights to board
     for(int i = n*n; i--; )
       knights[i] = expr(*this, (s[i] == K));
     knight_constraints();

examples/golf.cpp

@@ -231,7 +231,7 @@ main(int argc, char* argv[]) {
   opt.propagation(Golf::PROP_SET);
   opt.propagation(Golf::PROP_SET, "set", "Use set intersection cardinality for pair play constraints");
   opt.propagation(Golf::PROP_INT, "int", "Use integer distinct for pair play constraints");
-  opt.propagation(Golf::PROP_MIXED, "mixed", "Use set interesection cardinality and integer distinct for pair play constraints");
+  opt.propagation(Golf::PROP_MIXED, "mixed", "Use set intersection cardinality and integer distinct for pair play constraints");
   opt.ipl(IPL_DOM);
   opt.solutions(1);
   opt.parse(argc,argv);

examples/ind-set.cpp

@@ -83,7 +83,7 @@ class IndSet : public IntMaximizeScript {
   const Graph& g;
   /// Whether vertex included in independent set
   BoolVarArray v;
-  /// How many elements has indipendent set
+  /// How many elements has independent set
   IntVar       k;
 public:
   /// Actual model

examples/job-shop.cpp

@@ -818,7 +818,7 @@ main(int argc, char* argv[]) {
 
   opt.parse(argc,argv);
   if (!Spec(opt.instance()).valid()) {
-    std::cerr << "Error: unkown instance" << std::endl;
+    std::cerr << "Error: unknown instance" << std::endl;
     return 1;
   }
   solve(opt);