Merge pull request scala#552 from HairyFotr/fix-typos

Fix typos

Author: heathermiller

es/overviews/core/actors.md

@@ -113,7 +113,7 @@ El trait `ReplyReactor` extiende `Reactor[Any]` y sobrescribe y/o añade los sig
   vez se encuentre disponible; asimismo puede ser utilizada para comprobar si la respuesta
   está disponible sin la necesidad de bloquear el emisor. Existen dos versiones sobrecargadas.
   La versión que acepta dos parámetros recibe un argumento adicional de tipo
-  `PartialFuntion[Any, A]`. Esta función parcial es utilizada para realizar el post-procesado de
+  `PartialFunction[Any, A]`. Esta función parcial es utilizada para realizar el post-procesado de
   la respuesta del receptor. Básicamente, `!!` retorna un "future" que aplicará la anterior
   función parcial a la repuesta (una vez recibida). El resultado del "future" es el resultado
   de este post-procesado.

es/overviews/parallel-collections/custom-parallel-collections.md

@@ -151,7 +151,7 @@ string by appending all the string builders together. This way, elements are
 copied only once at the end instead of being copied every time `combine` is
 called. Ideally, we would like to parallelize this process and copy them in
 parallel (this is being done for parallel arrays), but without tapping into
-the internal represenation of strings this is the best we can do-- we have to
+the internal representation of strings this is the best we can do-- we have to
 live with this sequential bottleneck.
 
     private class ParStringCombiner extends Combiner[Char, ParString] {
@@ -206,7 +206,7 @@ ropes and various heaps are particularly suitable for such an approach.
 parallel hash tables, it assumes the elements can be efficiently
 partially sorted into concatenable buckets from which the final
 data-structure can be constructed in parallel. In the first phase
-different procesors populate these buckets independently and
+different processors populate these buckets independently and
 concatenate the buckets together. In the second phase, the data
 structure is allocated and different processors populate different
 parts of the datastructure in parallel using elements from disjoint

ko/tutorials/scala-for-java-programmers.md

@@ -677,6 +677,6 @@ Scala는 이 문제를 해결하기 위한 제네릭 클래스와 제네릭 함
 
 우리는 지금까지 Scala 언어의 간략한 소개와 몇가지의 예제를 살펴
 보았다. 흥미가 생겼다면 *Scala By Example*도 함께 읽어보자. 더 수준
-높고 다양한 예제를 만날 수 있다. 필요 할 때마다 *Scala Langauge
+높고 다양한 예제를 만날 수 있다. 필요 할 때마다 *Scala Language
 Specification*을 참고하는 것도 좋다.
 

overviews/core/_posts/2010-11-30-actors.md

@@ -227,7 +227,7 @@ return, we can use `andThen` to register the code which prints the
 greeting as the actor's continuation.
 
 Note that there is a *type ascription* that follows the `react`
-invocation (`: Unit`). Basically, it let's you treat the result of
+invocation (`: Unit`). Basically, it lets you treat the result of
 `react` as having type `Unit`, which is legal, since the result of an
 expression can always be dropped. This is necessary to do here, since
 `andThen` cannot be a member of type `Nothing` which is the result

overviews/core/_posts/2012-09-20-futures.md

@@ -80,7 +80,7 @@ and no computation can proceed.
 
 By default the `ExecutionContext.global` sets the parallelism level of its underlying fork-join pool to the amount of available processors 
 ([Runtime.availableProcessors](http://docs.oracle.com/javase/7/docs/api/java/lang/Runtime.html#availableProcessors%28%29)).
-This configuration can be overriden by setting one (or more) of the following VM attributes:
+This configuration can be overridden by setting one (or more) of the following VM attributes:
 
   * scala.concurrent.context.minThreads - defaults to `Runtime.availableProcessors`
   * scala.concurrent.context.numThreads - can be a number or a multiplier (N) in the form 'xN' ;  defaults to `Runtime.availableProcessors`

overviews/core/_posts/2012-11-08-actors-migration-guide.md

@@ -249,7 +249,7 @@ add the type parameter to all `receive` calls in your system. For example:
       receive[String] { case x: Int => "Number" }
 
 Additionally, to make the code compile, users must add the `override` keyword before the `act` method, and to create
-the empty `receive` method in the code. Method `act` needs to be overriden since its implementation in `ActWithStash`
+the empty `receive` method in the code. Method `act` needs to be overridden since its implementation in `ActWithStash`
 mimics the message processing loop of Akka. The changes are shown in the following example:
 
     class MyActor extends ActWithStash {

overviews/macros/roadmap.md

@@ -18,7 +18,7 @@ At the moment, we don't plan to introduce new reflection- or macro-related featu
 so the functionality of Scala 2.12 and Paradise 2.12 is going to be the same as Scala 2.11 and Paradise 2.11
 modulo bugfixes and stability improvements.
 
-Feature-wise, our main effort is currently targetted at [scala.meta](http://scalameta.org),
+Feature-wise, our main effort is currently targeted at [scala.meta](http://scalameta.org),
 the new foundation for metaprogramming Scala, which is simpler, more robust and much more suitable for portability
 than the current system based on scala.reflect. We hope that one day scala.meta will supersede scala.reflect
 and become the new standard way of doing metaprogramming in Scala.

overviews/parallel-collections/custom-parallel-collections.md

@@ -151,7 +151,7 @@ string by appending all the string builders together. This way, elements are
 copied only once at the end instead of being copied every time `combine` is
 called. Ideally, we would like to parallelize this process and copy them in
 parallel (this is being done for parallel arrays), but without tapping into
-the internal represenation of strings this is the best we can do-- we have to
+the internal representation of strings this is the best we can do-- we have to
 live with this sequential bottleneck.
 
     private class ParStringCombiner extends Combiner[Char, ParString] {

overviews/quasiquotes/expression-details.md

@@ -189,7 +189,7 @@ Similarly to type arguments, implicit value arguments are automatically inferred
 
 ## Assign and Update
 
-Assign and update are two related ways to explictly mutate a variable or collection:
+Assign and update are two related ways to explicitly mutate a variable or collection:
 
     scala> val assign = q"x = 2"
     assign: universe.Tree = x = 2

overviews/quasiquotes/intro.md

@@ -70,7 +70,7 @@ Each of this contexts is covered by separate interpolator:
  tq | [types](/overviews/quasiquotes/syntax-summary.html#types)
  pq | [patterns](/overviews/quasiquotes/syntax-summary.html#patterns)
 
-Syntactical similiarity between different contexts doesn\'t imply similarity between underlying trees:
+Syntactical similarity between different contexts doesn\'t imply similarity between underlying trees:
 
     scala> println(q"List[Int]" equalsStructure tq"List[Int]")
     false
@@ -90,7 +90,7 @@ Similarly patterns and expressions are not equivalent either:
 
 So it's extremely important to use the right interpolator for the job to construct a valid syntax tree.
 
-Additionally there are two auxilary interpolators that let you work with minor areas of scala syntax:
+Additionally there are two auxiliary interpolators that let you work with minor areas of scala syntax:
 
     | Used for
 ----|-------------------------------------