Fix many typos in docs and comments

This commit corrects many typos found in scaladocs, comments and
documentation. It should reduce a bit number of PRs which fix one
typo.

There are no changes in the 'real' code except one corrected name of
a JUnit test method and some error messages in exceptions. In the case
of typos in other method or field names etc., I just skipped them.

Obviously this commit doesn't fix all existing typos. I just generated
in IntelliJ the list of potential typos and looked through it quickly.

Author: mpociecha

spec/04-basic-declarations-and-definitions.md

@@ -631,7 +631,7 @@ For every parameter $p_{i,j}$ with a default argument a method named
 expression. Here, $n$ denotes the parameter's position in the method
 declaration. These methods are parametrized by the type parameter clause
 `[$\mathit{tps}\,$]` and all value parameter clauses
-`($\mathit{ps}_1$)$\ldots$($\mathit{ps}_{i-1}$)` preceeding $p_{i,j}$.
+`($\mathit{ps}_1$)$\ldots$($\mathit{ps}_{i-1}$)` preceding $p_{i,j}$.
 The `$f\$$default$\$$n` methods are inaccessible for
 user programs.
 

spec/05-classes-and-objects.md

@@ -128,7 +128,7 @@ consists of the following steps.
   occurrence in the linearization.
 - Finally the statement sequence $\mathit{stats}\,$ is evaluated.
 
-###### Delayed Initializaton
+###### Delayed Initialization
 The initialization code of an object or class (but not a trait) that follows
 the superclass
 constructor invocation and the mixin-evaluation of the template's base

spec/06-expressions.md

@@ -666,7 +666,7 @@ followed by operators starting with ``|`', etc.
 
 There's one exception to this rule, which concerns
 [_assignment operators_](#assignment-operators).
-The precedence of an assigment operator is the same as the one
+The precedence of an assignment operator is the same as the one
 of simple assignment `(=)`. That is, it is lower than the
 precedence of any other operator.
 
@@ -1761,7 +1761,7 @@ trait Dynamic {
 ```
 
 Assume a selection of the form $e.x$ where the type of $e$ conforms to `scala.Dynamic`.
-Further assuming the selection is not followed by any function arguments, such an expression can be rewitten under the conditions given [here](#implicit-conversions) to:
+Further assuming the selection is not followed by any function arguments, such an expression can be rewritten under the conditions given [here](#implicit-conversions) to:
 
 ```scala
 $e$.applyDynamic("$x$")

spec/08-pattern-matching.md

@@ -609,7 +609,7 @@ case class If[T](c: Term[Boolean],
 
 There are terms to represent numeric literals, incrementation, a zero
 test, and a conditional. Every term carries as a type parameter the
-type of the expression it representes (either `Int` or `Boolean`).
+type of the expression it represents (either `Int` or `Boolean`).
 
 A type-safe evaluator for such terms can be written as follows.
 

spec/09-top-level-definitions.md

@@ -159,7 +159,7 @@ The `main` method of a program can be directly defined in the
 object, or it can be inherited. The scala library defines a special class
 `scala.App` whose body acts as a `main` method.
 An objects $m$ inheriting from this class is thus a program,
-which executes the initializaton code of the object $m$.
+which executes the initialization code of the object $m$.
 
 ###### Example
 The following example will create a hello world program by defining

src/actors/scala/actors/Actor.scala

@@ -205,7 +205,7 @@ object Actor extends Combinators {
    * Actions in `f` have to contain the rest of the computation of `self`,
    * as this method will never return.
    *
-   * A common method of continuting the computation is to send a message
+   * A common method of continuing the computation is to send a message
    * to another actor:
    * {{{
    * react {

src/actors/scala/actors/LinkedQueue.java

@@ -22,7 +22,7 @@
  * and takes when the queue is not empty.
  * Normally a put and a take can proceed simultaneously.
  * (Although it does not allow multiple concurrent puts or takes.)
- * This class tends to perform more efficently than
+ * This class tends to perform more efficiently than
  * other Channel implementations in producer/consumer
  * applications.
  * <p>[<a href="http://gee.cs.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/intro.html"> Introduction to this package. </a>]

src/actors/scala/actors/remote/Proxy.scala

@@ -84,7 +84,7 @@ private[remote] class Proxy(node: Node, name: Symbol, @transient var kernel: Net
 }
 
 // Proxy is private[remote], but these classes are public and use it in a public
-// method signature.  That makes the only method they have non-overriddable.
+// method signature.  That makes the only method they have non-overridable.
 // So I made them final, which seems appropriate anyway.
 
 final class LinkToFun extends Function2[AbstractActor, Proxy, Unit] with Serializable {

src/actors/scala/actors/threadpool/AbstractCollection.java

@@ -1,6 +1,6 @@
 /*
  * Written by Dawid Kurzyniec, based on public domain code written by Doug Lea
- * and publictly available documentation, and released to the public domain, as
+ * and publicly available documentation, and released to the public domain, as
  * explained at http://creativecommons.org/licenses/publicdomain
  */
 

src/actors/scala/actors/threadpool/ExecutorCompletionService.java

@@ -135,7 +135,7 @@ public ExecutorCompletionService(Executor executor) {
      * @param completionQueue the queue to use as the completion queue
      * normally one dedicated for use by this service. This queue is
      * treated as unbounded -- failed attempted <tt>Queue.add</tt>
-     * operations for completed taskes cause them not to be
+     * operations for completed tasks cause them not to be
      * retrievable.
      * @throws NullPointerException if executor or completionQueue are <tt>null</tt>
      */

src/actors/scala/actors/threadpool/locks/ReentrantReadWriteLock.java

@@ -20,13 +20,13 @@
  *
  * <p>The order of entry
  * to the read and write lock is unspecified, subject to reentrancy
- * constraints.  A nonfair lock that is continously contended may
+ * constraints.  A nonfair lock that is continuously contended may
  * indefinitely postpone one or more reader or writer threads, but
  * will normally have higher throughput than a fair lock.
  * <p>
  *
  * DEPARTURE FROM java.util.concurrent: this implementation impose
- * a writer-preferrence and thus its acquisition order may be different
+ * a writer-preference and thus its acquisition order may be different
  * than in java.util.concurrent.
  *
  * <li><b>Reentrancy</b>

src/asm/scala/tools/asm/Label.java

@@ -545,7 +545,7 @@ void visitSubroutine(final Label JSR, final long id, final int nbSubroutines) {
     }
 
     // ------------------------------------------------------------------------
-    // Overriden Object methods
+    // Overridden Object methods
     // ------------------------------------------------------------------------
 
     /**

src/asm/scala/tools/asm/tree/analysis/Analyzer.java

@@ -375,7 +375,7 @@ private void findSubroutine(int insn, final Subroutine sub,
      *         instruction of the method. The size of the returned array is
      *         equal to the number of instructions (and labels) of the method. A
      *         given frame is <tt>null</tt> if the corresponding instruction
-     *         cannot be reached, or if an error occured during the analysis of
+     *         cannot be reached, or if an error occurred during the analysis of
      *         the method.
      */
     public Frame<V>[] getFrames() {
@@ -435,7 +435,7 @@ protected Frame<V> newFrame(final Frame<? extends V> src) {
 
     /**
      * Creates a control flow graph edge. The default implementation of this
-     * method does nothing. It can be overriden in order to construct the
+     * method does nothing. It can be overridden in order to construct the
      * control flow graph of a method (this method is called by the
      * {@link #analyze analyze} method during its visit of the method's code).
      *

src/asm/scala/tools/asm/tree/analysis/Interpreter.java

@@ -82,7 +82,7 @@ protected Interpreter(final int api) {
      *            the bytecode instruction to be interpreted.
      * @return the result of the interpretation of the given instruction.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V newOperation(AbstractInsnNode insn)
             throws AnalyzerException;
@@ -101,7 +101,7 @@ public abstract V newOperation(AbstractInsnNode insn)
      * @return the result of the interpretation of the given instruction. The
      *         returned value must be <tt>equal</tt> to the given value.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V copyOperation(AbstractInsnNode insn, V value)
             throws AnalyzerException;
@@ -122,7 +122,7 @@ public abstract V copyOperation(AbstractInsnNode insn, V value)
      *            the argument of the instruction to be interpreted.
      * @return the result of the interpretation of the given instruction.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V unaryOperation(AbstractInsnNode insn, V value)
             throws AnalyzerException;
@@ -146,7 +146,7 @@ public abstract V unaryOperation(AbstractInsnNode insn, V value)
      *            the second argument of the instruction to be interpreted.
      * @return the result of the interpretation of the given instruction.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V binaryOperation(AbstractInsnNode insn, V value1, V value2)
             throws AnalyzerException;
@@ -167,7 +167,7 @@ public abstract V binaryOperation(AbstractInsnNode insn, V value1, V value2)
      *            the third argument of the instruction to be interpreted.
      * @return the result of the interpretation of the given instruction.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V ternaryOperation(AbstractInsnNode insn, V value1,
             V value2, V value3) throws AnalyzerException;
@@ -185,7 +185,7 @@ public abstract V ternaryOperation(AbstractInsnNode insn, V value1,
      *            the arguments of the instruction to be interpreted.
      * @return the result of the interpretation of the given instruction.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract V naryOperation(AbstractInsnNode insn,
             List<? extends V> values) throws AnalyzerException;
@@ -203,7 +203,7 @@ public abstract V naryOperation(AbstractInsnNode insn,
      * @param expected
      *            the expected return type of the analyzed method.
      * @throws AnalyzerException
-     *             if an error occured during the interpretation.
+     *             if an error occurred during the interpretation.
      */
     public abstract void returnOperation(AbstractInsnNode insn, V value,
             V expected) throws AnalyzerException;

src/asm/scala/tools/asm/util/Printer.java

@@ -181,7 +181,7 @@ public abstract Printer visitClassAnnotation(final String desc,
      */
     public Printer visitClassTypeAnnotation(final int typeRef,
             final TypePath typePath, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -264,7 +264,7 @@ public abstract Printer visitFieldAnnotation(final String desc,
      */
     public Printer visitFieldTypeAnnotation(final int typeRef,
             final TypePath typePath, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -287,7 +287,7 @@ public Printer visitFieldTypeAnnotation(final int typeRef,
      * {@link scala.tools.asm.MethodVisitor#visitParameter(String, int)}.
      */
     public void visitParameter(String name, int access) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -309,7 +309,7 @@ public abstract Printer visitMethodAnnotation(final String desc,
      */
     public Printer visitMethodTypeAnnotation(final int typeRef,
             final TypePath typePath, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -380,7 +380,7 @@ public void visitMethodInsn(final int opcode, final String owner,
             visitMethodInsn(opcode, owner, name, desc, itf);
             return;
         }
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -397,7 +397,7 @@ public void visitMethodInsn(final int opcode, final String owner,
             visitMethodInsn(opcode, owner, name, desc);
             return;
         }
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -457,7 +457,7 @@ public abstract void visitMultiANewArrayInsn(final String desc,
      */
     public Printer visitInsnAnnotation(final int typeRef,
             final TypePath typePath, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -473,7 +473,7 @@ public abstract void visitTryCatchBlock(final Label start, final Label end,
      */
     public Printer visitTryCatchAnnotation(final int typeRef,
             final TypePath typePath, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**
@@ -491,7 +491,7 @@ public abstract void visitLocalVariable(final String name,
     public Printer visitLocalVariableAnnotation(final int typeRef,
             final TypePath typePath, final Label[] start, final Label[] end,
             final int[] index, final String desc, final boolean visible) {
-        throw new RuntimeException("Must be overriden");
+        throw new RuntimeException("Must be overridden");
     }
 
     /**

src/compiler/scala/tools/ant/Scalac.scala

@@ -479,7 +479,7 @@ class Scalac extends ScalaMatchingTask with ScalacShared {
 
   /** Tests if a file exists and prints a warning in case it doesn't. Always
    *  returns the file, even if it doesn't exist.
-   *  @param file A file to test for existance.
+   *  @param file A file to test for existence.
    *  @return     The same file. */
   protected def existing(file: File): File = {
     if (!file.exists)

src/compiler/scala/tools/nsc/Global.scala

@@ -234,7 +234,7 @@ class Global(var currentSettings: Settings, var reporter: Reporter)
 
   /** Called by ScalaDocAnalyzer when a doc comment has been parsed. */
   def signalParsedDocComment(comment: String, pos: Position) = {
-    // TODO: this is all very borken (only works for scaladoc comments, not regular ones)
+    // TODO: this is all very broken (only works for scaladoc comments, not regular ones)
     //       --> add hooks to parser and refactor Interactive global to handle comments directly
     //       in any case don't use reporter for parser hooks
     reporter.comment(pos, comment)
@@ -1461,7 +1461,7 @@ class Global(var currentSettings: Settings, var reporter: Reporter)
     }
 
 
-    /** Caching member symbols that are def-s in Defintions because they might change from Run to Run. */
+    /** Caching member symbols that are def-s in Definitions because they might change from Run to Run. */
     val runDefinitions: definitions.RunDefinitions = new definitions.RunDefinitions
 
     /** Compile list of source files,

src/compiler/scala/tools/nsc/PhaseAssembly.scala

@@ -18,7 +18,7 @@ trait PhaseAssembly {
 
   /**
    * Aux datastructure for solving the constraint system
-   * The depency graph container with helper methods for node and edge creation
+   * The dependency graph container with helper methods for node and edge creation
    */
   private class DependencyGraph {
 

src/compiler/scala/tools/nsc/backend/icode/GenICode.scala

@@ -1077,7 +1077,7 @@ abstract class GenICode extends SubComponent {
           ()
         case (_, UNIT) =>
           ctx.bb.emit(DROP(from), pos)
-        // otherwise we'd better be doing a primtive -> primitive coercion or there's a problem
+        // otherwise we'd better be doing a primitive -> primitive coercion or there's a problem
         case _ if !from.isRefOrArrayType && !to.isRefOrArrayType =>
           coerce(from, to)
         case _ =>

src/compiler/scala/tools/nsc/backend/icode/Primitives.scala

@@ -60,7 +60,7 @@ trait Primitives { self: ICodes =>
 
   // type : (buf,el) => buf
   // range: lf,rg <- { BOOL, Ix, Ux, Rx, REF, STR }
-  // jvm  : It should call the appropiate 'append' method on StringBuffer
+  // jvm  : It should call the appropriate 'append' method on StringBuffer
   case class StringConcat(el: TypeKind) extends Primitive
 
   /** Signals the beginning of a series of concatenations.

src/compiler/scala/tools/nsc/backend/icode/analysis/TypeFlowAnalysis.scala

@@ -332,13 +332,13 @@ abstract class TypeFlowAnalysis {
     `remainingCALLs` also caches info about the typestack just before the callsite, so as to spare computing them again at inlining time.
 
     Besides caching, a further optimization involves skipping those basic blocks whose in-flow and out-flow isn't needed anyway (as explained next).
-    A basic block lacking a callsite in `remainingCALLs`, when visisted by the standard algorithm, won't cause any inlining.
+    A basic block lacking a callsite in `remainingCALLs`, when visited by the standard algorithm, won't cause any inlining.
     But as we know from the way type-flows are computed, computing the in- and out-flow for a basic block relies in general on those of other basic blocks.
     In detail, we want to focus on that sub-graph of the CFG such that control flow may reach a remaining candidate callsite.
     Those basic blocks not in that subgraph can be skipped altogether. That's why:
        - `forwardAnalysis()` in `MTFAGrowable` now checks for inclusion of a basic block in `relevantBBs`
        - same check is performed before adding a block to the worklist, and as part of choosing successors.
-    The bookkeeping supporting on-the-fly pruning of irrelevant blocks requires overridding most methods of the dataflow-analysis.
+    The bookkeeping supporting on-the-fly pruning of irrelevant blocks requires overriding most methods of the dataflow-analysis.
 
     The rest of the story takes place in Inliner, which does not visit all of the method's basic blocks but only on those represented in `remainingCALLs`.
 

src/compiler/scala/tools/nsc/backend/jvm/BCodeSyncAndTry.scala

@@ -284,7 +284,7 @@ abstract class BCodeSyncAndTry extends BCodeBodyBuilder {
        * ------
        */
 
-      // a note on terminology: this is not "postHandlers", despite appearences.
+      // a note on terminology: this is not "postHandlers", despite appearances.
       // "postHandlers" as in the source-code view. And from that perspective, both (3.A) and (3.B) are invisible implementation artifacts.
       if (hasFinally) {
         nopIfNeeded(startTryBody)