docs: fix typos

doc/rfc/0001-smarter-imports.md

@@ -79,7 +79,7 @@ You aren't saying *where* that module should be found, you're saying *what*
 module you want. Assuming we get a package manager at some point, these kinds of
 "logical" imports will be common. So I want these too.
 
-If you look at other langauges' package managers, you'll find many times a
+If you look at other languages' package managers, you'll find many times a
 single package offers a number of separate libraries you can use. So I also
 want to support logical imports that contain a path too — the import would say
 both *what* package to look in and *where* in that package to look.

doc/site/blog/0-hello-wren.markdown

@@ -5,7 +5,7 @@
 
 Welcome to the new Wren development blog!
 
-Around November 2018 on the Wren mailing list, munificent announced that a new maintainer is taking over the development and maintainence of the Wren language. [The original post is here, with all the details.](https://groups.google.com/forum/#!topic/wren-lang/cMUwij-NIn0)
+Around November 2018 on the Wren mailing list, munificent announced that a new maintainer is taking over the development and maintenance of the Wren language. [The original post is here, with all the details.](https://groups.google.com/forum/#!topic/wren-lang/cMUwij-NIn0)
 
 In short, [I'm (ruby0x1)](https://github.com/ruby0x1) taking over from [Bob (munificent)](https://github.com/munificent) as maintainer, but Bob is sticking around as a contributor!
 

doc/site/blog/1-0.2.0-and-beyond.markdown

@@ -66,7 +66,7 @@ We'll fix that with 0.3.0.
 
 The 0.3.0 goals in simple form:
 - VM / CLI split
-- Build consistency/reliablity
+- Build consistency/reliability
 - Web build for embedding in docs
 - Prebuilt releases
 

doc/site/blog/2-0.3.0-released.markdown

@@ -11,7 +11,7 @@ Let's revisit our goals from [the last blog post](1-0.2.0-and-beyond.html),
 and mark what we managed to get done:
 
 - <s>VM / CLI split</s> [#](#vm--cli-split)
-- <s>Build consistency/reliablity</s> [#](#build-consistencyreliability)
+- <s>Build consistency/reliability</s> [#](#build-consistencyreliability)
 - <s>Web build for embedding in docs</s> [#](#web-build-for-embedding-in-docs)
 - <s>Prebuilt releases</s> [#](#prebuilt-releases)
 

doc/site/modules/core/object.markdown

@@ -12,7 +12,7 @@ For all other objects, this returns `true` only if *obj1* and *obj2* refer to
 the exact same object in memory.
 
 This is similar to the built in `==` operator in Object except that this cannot
-be overriden. It allows you to reliably access the built-in equality semantics
+be overridden. It allows you to reliably access the built-in equality semantics
 even on user-defined classes.
 
 ## Methods

doc/site/modules/random/random.markdown

@@ -32,7 +32,7 @@ var random = Random.new()
 ### Random.**new**(seed)
 
 Creates a new generator initialized with [seed]. The seed can either be a
-number, or a non-empty sequence of numbers. If the sequnce has more than 16
+number, or a non-empty sequence of numbers. If the sequence has more than 16
 elements, only the first 16 are used. If it has fewer, the elements are cycled
 to generate 16 seed values.
 

src/vm/wren_compiler.c

@@ -1835,7 +1835,7 @@ static void validateNumParameters(Compiler* compiler, int numArgs)
 }
 
 // Parses the rest of a comma-separated parameter list after the opening
-// delimeter. Updates `arity` in [signature] with the number of parameters.
+// delimiter. Updates `arity` in [signature] with the number of parameters.
 static void finishParameterList(Compiler* compiler, Signature* signature)
 {
   do
@@ -2832,7 +2832,7 @@ void parsePrecedence(Compiler* compiler, Precedence precedence)
     return;
   }
 
-  // Track if the precendence of the surrounding expression is low enough to
+  // Track if the precedence of the surrounding expression is low enough to
   // allow an assignment inside this one. We can't compile an assignment like
   // a normal expression because it requires us to handle the LHS specially --
   // it needs to be an lvalue, not an rvalue. So, for each of the kinds of
@@ -3042,7 +3042,7 @@ static void forStatement(Compiler* compiler)
   //     }
   //
   // It's not exactly this, because the synthetic variables `seq_` and `iter_`
-  // actually get names that aren't valid Wren identfiers, but that's the basic
+  // actually get names that aren't valid Wren identifiers, but that's the basic
   // idea.
   //
   // The important parts are:
@@ -3948,7 +3948,7 @@ static void disallowAttributes(Compiler* compiler)
   }
 }
 
-// Add an attribute to a given group in the compiler attribues map
+// Add an attribute to a given group in the compiler attributes map
 static void addToAttributeGroup(Compiler* compiler, 
                                 Value group, Value key, Value value) 
 {

src/vm/wren_debug.c

@@ -341,7 +341,7 @@ static int dumpInstruction(WrenVM* vm, ObjFn* fn, int i, int* lastLine)
       break;
 
     default:
-      printf("UKNOWN! [%d]\n", bytecode[i - 1]);
+      printf("UNKNOWN! [%d]\n", bytecode[i - 1]);
       break;
   }
 

src/vm/wren_value.h

@@ -754,7 +754,7 @@ Value wrenStringFromByte(WrenVM* vm, uint8_t value);
 // empty string.
 Value wrenStringCodePointAt(WrenVM* vm, ObjString* string, uint32_t index);
 
-// Search for the first occurence of [needle] within [haystack] and returns its
+// Search for the first occurrence of [needle] within [haystack] and returns its
 // zero-based offset. Returns `UINT32_MAX` if [haystack] does not contain
 // [needle].
 uint32_t wrenStringFind(ObjString* haystack, ObjString* needle,

src/vm/wren_vm.c

@@ -1415,7 +1415,7 @@ WrenHandle* wrenMakeCallHandle(WrenVM* vm, const char* signature)
     }
   }
 
-  // Add the signatue to the method table.
+  // Add the signature to the method table.
   int method =  wrenSymbolTableEnsure(vm, &vm->methodNames,
                                       signature, signatureLength);
 

test/benchmark/delta_blue.dart

@@ -153,7 +153,7 @@ abstract class Constraint {
   /**
    * Normal constraints are not input constraints.  An input constraint
    * is one that depends on external state, such as the mouse, the
-   * keybord, a clock, or some arbitraty piece of imperative code.
+   * keyboard, a clock, or some arbitrary piece of imperative code.
    */
   bool isInput() => false;
 }
@@ -459,7 +459,7 @@ class Planner {
 
   /**
    * Attempt to satisfy the given constraint and, if successful,
-   * incrementally update the dataflow graph.  Details: If satifying
+   * incrementally update the dataflow graph.  Details: If satisfying
    * the constraint is successful, it may override a weaker constraint
    * on its output. The algorithm attempts to resatisfy that
    * constraint using some other method. This process is repeated
@@ -652,7 +652,7 @@ class Plan {
  * In case 1, the added constraint is stronger than the stay
  * constraint and values must propagate down the entire length of the
  * chain. In case 2, the added constraint is weaker than the stay
- * constraint so it cannot be accomodated. The cost in this case is,
+ * constraint so it cannot be accommodated. The cost in this case is,
  * of course, very low. Typical situations lie somewhere between these
  * two extremes.
  */

test/benchmark/delta_blue.lua.inprogress

@@ -19,7 +19,7 @@
 -- This implementation of the DeltaBlue benchmark is derived
 -- from the Smalltalk implementation by John Maloney and Mario
 -- Wolczko. Some parts have been translated directly, whereas
--- others have been modified more aggresively to make it feel
+-- others have been modified more aggressively to make it feel
 -- more like a JavaScript program.
 
 
@@ -203,7 +203,7 @@ end
 --
 -- Normal constraints are not input constraints.  An input constraint
 -- is one that depends on external state, such as the mouse, the
--- keybord, a clock, or some arbitraty piece of imperative code.
+-- keyboard, a clock, or some arbitrary piece of imperative code.
 --
 function Constraint:isInput ()
    return false
@@ -595,7 +595,7 @@ end
 
 --
 -- Attempt to satisfy the given constraint and, if successful,
--- incrementally update the dataflow graph.  Details: If satifying
+-- incrementally update the dataflow graph.  Details: If satisfying
 -- the constraint is successful, it may override a weaker constraint
 -- on its output. The algorithm attempts to resatisfy that
 -- constraint using some other method. This process is repeated
@@ -818,7 +818,7 @@ end
 -- In case 1, the added constraint is stronger than the stay
 -- constraint and values must propagate down the entire length of the
 -- chain. In case 2, the added constraint is weaker than the stay
--- constraint so it cannot be accomodated. The cost in this case is,
+-- constraint so it cannot be accommodated. The cost in this case is,
 -- of course, very low. Typical situations lie somewhere between these
 -- two extremes.
 --

test/benchmark/delta_blue.py

@@ -511,7 +511,7 @@ def chain_test(n):
     In case 1, the added constraint is stronger than the stay
     constraint and values must propagate down the entire length of the
     chain. In case 2, the added constraint is weaker than the stay
-    constraint so it cannot be accomodated. The cost in this case is,
+    constraint so it cannot be accommodated. The cost in this case is,
     of course, very low. Typical situations lie somewhere between these
     two extremes.
     """

test/benchmark/delta_blue.wren

@@ -114,7 +114,7 @@ class Constraint {
 
   // Normal constraints are not input constraints.  An input constraint
   // is one that depends on external state, such as the mouse, the
-  // keybord, a clock, or some arbitraty piece of imperative code.
+  // keyboard, a clock, or some arbitrary piece of imperative code.
   isInput { false }
 }
 
@@ -436,7 +436,7 @@ class Planner {
   }
 
   // Attempt to satisfy the given constraint and, if successful,
-  // incrementally update the dataflow graph.  Details: If satifying
+  // incrementally update the dataflow graph.  Details: If satisfying
   // the constraint is successful, it may override a weaker constraint
   // on its output. The algorithm attempts to resatisfy that
   // constraint using some other method. This process is repeated
@@ -599,7 +599,7 @@ var total = 0
 // In case 1, the added constraint is stronger than the stay
 // constraint and values must propagate down the entire length of the
 // chain. In case 2, the added constraint is weaker than the stay
-// constraint so it cannot be accomodated. The cost in this case is,
+// constraint so it cannot be accommodated. The cost in this case is,
 // of course, very low. Typical situations lie somewhere between these
 // two extremes.
 var chainTest = Fn.new {|n|

test/core/list/join.wren

@@ -1,7 +1,7 @@
 // Handle empty list.
 System.print([].join(",") == "") // expect: true
 
-// Handle a simple list with an empty delimeter.
+// Handle a simple list with an empty delimiter.
 System.print([1, 2, 3].join("")) // expect: 123
 
 // Handle a simple list with no separator.

test/language/field/in_static_method_in_nested_class.wren

@@ -1,4 +1,4 @@
-// Refering to an instance method in a nested static class should *not* walk
+// Referring to an instance method in a nested static class should *not* walk
 // out to find the nearest enclosing instance method. We could make that work,
 // but it's confusing to users, and would require some tricky work to make sure
 // the enclosing instance is closed over.

test/regression/561.wren

@@ -1,4 +1,4 @@
-// This test caused an array oveflow in local variable array due to hidden
+// This test caused an array overflow in local variable array due to hidden
 // variables of for loop
 
 // expect error line 91