run the non-us patch

Author: erik-krogh

cpp/ql/lib/experimental/semmle/code/cpp/models/interfaces/SimpleRangeAnalysisDefinition.qll

@@ -37,7 +37,7 @@ abstract class SimpleRangeAnalysisDefinition extends RangeSsaDefinition {
    * dependencies. Without this information, range analysis might work for
    * simple cases but will go into infinite loops on complex code.
    *
-   * For example, when modelling the definition by reference in a call to an
+   * For example, when modeling the definition by reference in a call to an
    * overloaded `operator=`, written as `v = e`, the definition of `(this, v)`
    * depends on `e`.
    */

csharp/ql/lib/semmle/code/csharp/frameworks/EntityFramework.qll

@@ -1,5 +1,5 @@
 /**
- * Classes modelling EntityFramework and EntityFrameworkCore.
+ * Classes modeling EntityFramework and EntityFrameworkCore.
  */
 
 import csharp

csharp/ql/lib/semmle/code/csharp/frameworks/JsonNET.qll

@@ -1,5 +1,5 @@
 /**
- * Classes for modelling Json.NET.
+ * Classes for modeling Json.NET.
  */
 
 import csharp

csharp/ql/lib/semmle/code/csharp/frameworks/NHibernate.qll

@@ -1,5 +1,5 @@
 /**
- * Classes for modelling NHibernate.
+ * Classes for modeling NHibernate.
  */
 
 import csharp

csharp/ql/lib/semmle/code/csharp/frameworks/ServiceStack.qll

@@ -1,5 +1,5 @@
 /**
- * General modelling of ServiceStack framework including separate modules for:
+ * General modeling of ServiceStack framework including separate modules for:
  *  - flow sources
  *  - SQLi sinks
  *  - XSS sinks

javascript/ql/lib/semmle/javascript/Arrays.qll

@@ -3,7 +3,7 @@ private import semmle.javascript.dataflow.InferredTypes
 private import semmle.javascript.dataflow.internal.PreCallGraphStep
 
 /**
- * Classes and predicates for modelling TaintTracking steps for arrays.
+ * Classes and predicates for modeling TaintTracking steps for arrays.
  */
 module ArrayTaintTracking {
   /**
@@ -88,13 +88,13 @@ module ArrayTaintTracking {
 }
 
 /**
- * Classes and predicates for modelling data-flow for arrays.
+ * Classes and predicates for modeling data-flow for arrays.
  */
 private module ArrayDataFlow {
   private import DataFlow::PseudoProperties
 
   /**
-   * A step modelling the creation of an Array using the `Array.from(x)` method.
+   * A step modeling the creation of an Array using the `Array.from(x)` method.
    * The step copies the elements of the argument (set, array, or iterator elements) into the resulting array.
    */
   private class ArrayFrom extends DataFlow::SharedFlowStep {
@@ -112,7 +112,7 @@ private module ArrayDataFlow {
   }
 
   /**
-   * A step modelling an array copy where the spread operator is used.
+   * A step modeling an array copy where the spread operator is used.
    * The result is essentially array concatenation.
    *
    * Such a step can occur both with the `push` and `unshift` methods, or when creating a new array.
@@ -260,7 +260,7 @@ private module ArrayDataFlow {
   }
 
   /**
-   * A step modelling that `splice` can insert elements into an array.
+   * A step modeling that `splice` can insert elements into an array.
    * For example in `array.splice(i, del, e)`: if `e` is tainted, then so is `array
    */
   private class ArraySpliceStep extends DataFlow::SharedFlowStep {
@@ -275,7 +275,7 @@ private module ArrayDataFlow {
   }
 
   /**
-   * A step for modelling `concat`.
+   * A step for modeling `concat`.
    * For example in `e = arr1.concat(arr2, arr3)`: if any of the `arr` is tainted, then so is `e`.
    */
   private class ArrayConcatStep extends DataFlow::SharedFlowStep {
@@ -290,7 +290,7 @@ private module ArrayDataFlow {
   }
 
   /**
-   * A step for modelling that elements from an array `arr` also appear in the result from calling `slice`/`splice`/`filter`.
+   * A step for modeling that elements from an array `arr` also appear in the result from calling `slice`/`splice`/`filter`.
    */
   private class ArraySliceStep extends DataFlow::SharedFlowStep {
     override predicate loadStoreStep(DataFlow::Node pred, DataFlow::Node succ, string prop) {
@@ -304,7 +304,7 @@ private module ArrayDataFlow {
   }
 
   /**
-   * A step modelling that elements from an array `arr` are received by calling `find`.
+   * A step modeling that elements from an array `arr` are received by calling `find`.
    */
   private class ArrayFindStep extends DataFlow::SharedFlowStep {
     override predicate loadStep(DataFlow::Node pred, DataFlow::Node succ, string prop) {
@@ -320,7 +320,7 @@ private module ArrayDataFlow {
 private import ArrayLibraries
 
 /**
- * Classes and predicates modelling various libraries that work on arrays or array-like structures.
+ * Classes and predicates modeling various libraries that work on arrays or array-like structures.
  */
 private module ArrayLibraries {
   private import DataFlow::PseudoProperties

javascript/ql/lib/semmle/javascript/Collections.qll

@@ -156,7 +156,7 @@ private module CollectionDataFlow {
   }
 
   /**
-   * A step for modelling `for of` iteration on arrays, maps, sets, and iterators.
+   * A step for modeling `for of` iteration on arrays, maps, sets, and iterators.
    *
    * For sets and iterators the l-value are the elements of the set/iterator.
    * For maps the l-value is a tuple containing a key and a value.

javascript/ql/lib/semmle/javascript/Generators.qll

@@ -6,7 +6,7 @@ import javascript
 private import semmle.javascript.dataflow.internal.PreCallGraphStep
 
 /**
- * Classes and predicates for modelling data-flow for generator functions.
+ * Classes and predicates for modeling data-flow for generator functions.
  */
 private module GeneratorDataFlow {
   private import DataFlow::PseudoProperties

javascript/ql/lib/semmle/javascript/Promises.qll

@@ -1,5 +1,5 @@
 /**
- * Provides classes for modelling promises and their data-flow.
+ * Provides classes for modeling promises and their data-flow.
  */
 
 import javascript

javascript/ql/lib/semmle/javascript/Routing.qll

@@ -67,7 +67,7 @@ module Routing {
   Node getRouteSetupNode(DataFlow::Node call) { result = MkRouteSetup(call) }
 
   /**
-   * A node in a routing tree modelling the composition of middleware functions and route handlers.
+   * A node in a routing tree modeling the composition of middleware functions and route handlers.
    *
    * More precisely, this is a node in a graph representing a set of possible routing trees, as the
    * concrete shape of the routing tree may be depend on branching control flow.