fixed a bunch of dead links

My editor, Atom, is also making a bunch of changes related to
whitespace. :-(

contribute.md

@@ -88,7 +88,7 @@ The rest of the document should, of course, be written in [Markdown](http://en.w
 
 At the moment, `RELEVANT-CATEGORY` corresponds to only a single category, "core," because we are currently focusing on building up documentation of core libraries. However, expect more categories here in the future.
 
-If your document consists of **multiple** pages, like the [Collections]({{ site.baseurl }}/overviews/collections/index.html) overview, an ordering must be specified, by numbering documents in their logical order with `num`, and a name must be assigned to the collection of pages using `partof`. For example, the following header might be used for a document in the collections overview:
+If your document consists of **multiple** pages, like the [Collections]({{ site.baseurl }}/overviews/collections/introduction.html) overview, an ordering must be specified, by numbering documents in their logical order with `num`, and a name must be assigned to the collection of pages using `partof`. For example, the following header might be used for a document in the collections overview:
 
     ---
     layout: overview-large

es/overviews/parallel-collections/overview.md

@@ -59,7 +59,7 @@ Usando un `map` paralelizado para transformar una colección de elementos tipo `
 
     scala> val apellidos = List("Smith","Jones","Frankenstein","Bach","Jackson","Rodin").par
     apellidos: scala.collection.parallel.immutable.ParSeq[String] = ParVector(Smith, Jones, Frankenstein, Bach, Jackson, Rodin)
-    
+
     scala> apellidos.map(_.toUpperCase)
     res0: scala.collection.parallel.immutable.ParSeq[String] = ParVector(SMITH, JONES, FRANKENSTEIN, BACH, JACKSON, RODIN)
 
@@ -69,7 +69,7 @@ Sumatoria mediante `fold` en un `ParArray`:
 
     scala> val parArray = (1 to 1000000).toArray.par
     parArray: scala.collection.parallel.mutable.ParArray[Int] = ParArray(1, 2, 3, ...
-    
+
     scala> parArray.fold(0)(_ + _)
     res0: Int = 1784293664
 
@@ -80,7 +80,7 @@ Usando un filtrado mediante `filter` paralelizado para seleccionar los apellidos
 
     scala> val apellidos = List("Smith","Jones","Frankenstein","Bach","Jackson","Rodin").par
     apellidos: scala.collection.parallel.immutable.ParSeq[String] = ParVector(Smith, Jones, Frankenstein, Bach, Jackson, Rodin)
-    
+
     scala> apellidos.filter(_.head >= 'J')
     res0: scala.collection.parallel.immutable.ParSeq[String] = ParVector(Smith, Jones, Jackson, Rodin)
 
@@ -104,11 +104,11 @@ Lo que es importante desarrollar aquí son estos métodos para la conversión de
 _Nota:_ Las colecciones que son inherentemente secuenciales (en el sentido que sus elementos deben ser accedidos uno a uno), como las listas, colas y streams (a veces llamados flujos), son convertidos a sus contrapartes paralelizadas al copiar los todos sus elementos. Un ejemplo es la clase `List` --es convertida a una secuencia paralelizada inmutable común, que es un `ParVector`. Por supuesto, el tener que copiar los elementos para estas colecciones involucran una carga más de trabajo que no se sufre con otros tipos como: `Array`, `Vector`, `HashMap`, etc.
 
 For more information on conversions on parallel collections, see the
-[conversions]({{ site.baseurl }}/overviews/parallel-collections/converesions.html)
-and [concrete parallel collection classes]({{ site.baseurl }}/overviews/parallel-collections/concrete-parallel-collections.html) 
+[conversions]({{ site.baseurl }}/overviews/parallel-collections/conversions.html)
+and [concrete parallel collection classes]({{ site.baseurl }}/overviews/parallel-collections/concrete-parallel-collections.html)
 sections of thise guide.
 
-Para más información sobre la conversión de colecciones paralelizadas, véase los artículos sobre [conversiones]({{ site.baseurl }}/es/overviews/parallel-collections/converesions.html) y [clases concretas de colecciones paralelizadas]({{ site.baseurl }}/es/overviews/parallel-collections/concrete-parallel-collections.html) de esta misma serie.
+Para más información sobre la conversión de colecciones paralelizadas, véase los artículos sobre [conversiones]({{ site.baseurl }}/es/overviews/parallel-collections/conversions.html) y [clases concretas de colecciones paralelizadas]({{ site.baseurl }}/es/overviews/parallel-collections/concrete-parallel-collections.html) de esta misma serie.
 
 ## Entendiendo las colecciones paralelizadas
 
@@ -138,19 +138,19 @@ Veamos un ejemplo:
 
     scala> val list = (1 to 1000).toList.par
     list: scala.collection.parallel.immutable.ParSeq[Int] = ParVector(1, 2, 3,…
-    
+
     scala> list.foreach(sum += _); sum
     res01: Int = 467766
-    
+
     scala> var sum = 0
     sum: Int = 0
-    
+
     scala> list.foreach(sum += _); sum
     res02: Int = 457073
-    
+
     scala> var sum = 0
     sum: Int = 0
-    
+
     scala> list.foreach(sum += _); sum
     res03: Int = 468520
 
@@ -171,13 +171,13 @@ Dado este funcionamiento "fuera de orden", también se debe ser cuidadoso de rea
 
     scala> val list = (1 to 1000).toList.par
     list: scala.collection.parallel.immutable.ParSeq[Int] = ParVector(1, 2, 3,…
-    
+
     scala> list.reduce(_-_)
     res01: Int = -228888
-    
+
     scala> list.reduce(_-_)
     res02: Int = -61000
-    
+
     scala> list.reduce(_-_)
     res03: Int = -331818
 
@@ -186,8 +186,8 @@ En el ejemplo anterior invocamos reduce sobre un `ParVector[Int]` pasándole `_-
 _Nota:_ Generalmente se piensa que, al igual que las operaciones no asociativas, las operaciones no conmutativas pasadas a un función de orden superior también generan resultados extraños (no deterministas). En realidad esto no es así, un simple ejemplo es la concatenación de Strings (cadenas de caracteres). -- una operación asociativa, pero no conmutativa:
 
     scala> val strings = List("abc","def","ghi","jk","lmnop","qrs","tuv","wx","yz").par
-    strings: scala.collection.parallel.immutable.ParSeq[java.lang.String] = ParVector(abc, def, ghi, jk, lmnop, qrs, tuv, wx, yz) 
-    
+    strings: scala.collection.parallel.immutable.ParSeq[java.lang.String] = ParVector(abc, def, ghi, jk, lmnop, qrs, tuv, wx, yz)
+
     scala> val alfabeto = strings.reduce(_++_)
     alfabeto: java.lang.String = abcdefghijklmnopqrstuvwxyz
 

es/tutorials/tour/default-parameter-values.md

@@ -15,8 +15,8 @@ En Java, uno tiende a ver muchos métodos sobrecargados que solamente sirven par
 
     public class HashMap<K,V> {
       public HashMap(Map<? extends K,? extends V> m);
-      /** Create a new HashMap with default capacity (16) 
-        * and loadFactor (0.75) 
+      /** Create a new HashMap with default capacity (16)
+        * and loadFactor (0.75)
         */
       public HashMap();
       /** Create a new HashMap with default loadFactor (0.75) */
@@ -33,8 +33,8 @@ Más problemático es que los valores usados para ser por defecto están tanto e
       public static final float DEFAULT_LOAD_FACTOR = 0.75;
 
       public HashMap(Map<? extends K,? extends V> m);
-      /** Create a new HashMap with default capacity (16) 
-        * and loadFactor (0.75) 
+      /** Create a new HashMap with default capacity (16)
+        * and loadFactor (0.75)
         */
       public HashMap();
       /** Create a new HashMap with default loadFactor (0.75) */
@@ -62,4 +62,4 @@ Scala cuenta con soporte directo para esto:
     // mediante parametros nombrados
     val m4 = new HashMap[String,Int](loadFactor = 0.8)
 
-Nótese cómo podemos sacar ventaja de cualquier valor por defecto al utilizar [parámetros nombrados]({{ site.baseurl }}/tutorials/tour/named_parameters.html).
+Nótese cómo podemos sacar ventaja de cualquier valor por defecto al utilizar [parámetros nombrados]({{ site.baseurl }}/tutorials/tour/named-parameters.html).

es/tutorials/tour/tour-of-scala.md

@@ -23,7 +23,7 @@ Además, la noción de reconocimiento de patrones de Scala se puede extender nat
 Scala cuenta con un expresivo sistema de tipado que fuerza estáticamente las abstracciones a ser usadas en una manera coherente y segura. En particular, el sistema de tipado soporta:
 * [Clases genéricas](generic-classes.html)
 * [anotaciones variables](variances.html),
-* límites de tipado [superiores](upper-type-bounds.html) e [inferiores](lower-type-bouunds.html),
+* límites de tipado [superiores](upper-type-bounds.html) e [inferiores](lower-type-bounds.html),
 * [clases internas](inner-classes.html) y [tipos abstractos](abstract-types.html) como miembros de objetos,
 * [tipos compuestos](compound-types.html)
 * [auto-referencias explicitamente tipadas](explicitly-typed-self-references.html)

ja/overviews/index.md

@@ -28,7 +28,7 @@ title: ガイドと概要
      * [Scala 2.7 からの移行](/ja/overviews/collections/migrating-from-scala-27.html)
    * [文字列の補間](/ja/overviews/core/string-interpolation.html) <span class="label success">New in 2.10</span>
    * [値クラスと汎用トレイト](/ja/overviews/core/value-classes.html) <span class="label success">New in 2.10</span>
- 
+
  <div class="page-header-index">
    <h2>並列および並行プログラミング</h2>
  </div>
@@ -39,7 +39,7 @@ title: ガイドと概要
      * [並列コレクションへの変換](/ja/overviews/parallel-collections/conversions.html)
      * [並行トライ](/ja/overviews/parallel-collections/ctries.html)
      * [並列コレクションライブラリのアーキテクチャ](/ja/overviews/parallel-collections/architecture.html)
-     * [カスタム並列コレクションの作成](/ja/overviews/parallel-collections/custom-parallel-collections.*tml)
+     * [カスタム並列コレクションの作成](/ja/overviews/parallel-collections/custom-parallel-collections.html)
      * [並列コレクションの設定](/ja/overviews/parallel-collections/configuration.html)
      * [性能の測定](/ja/overviews/parallel-collections/performance.html)
 

overviews/collections/migrating-from-scala-27.md

@@ -38,7 +38,7 @@ Generally, the old functionality of Scala 2.7 collections has been left in place
 
 There are two parts of the old libraries which have been replaced wholesale, and for which deprecation warnings were not feasible.
 
-1. The previous `scala.collection.jcl` package is gone. This package tried to mimick some of the Java collection library design in Scala, but in doing so broke many symmetries. Most people who wanted Java collections bypassed `jcl` and used `java.util` directly. Scala 2.8 offers automatic conversion mechanisms between both collection libraries in the [JavaConversions]({{ site.baseurl }}/overviews/collections/conversions-between-java-and-scala-collections.md) object which replaces the `jcl` package.
+1. The previous `scala.collection.jcl` package is gone. This package tried to mimick some of the Java collection library design in Scala, but in doing so broke many symmetries. Most people who wanted Java collections bypassed `jcl` and used `java.util` directly. Scala 2.8 offers automatic conversion mechanisms between both collection libraries in the [JavaConversions]({{ site.baseurl }}/overviews/collections/conversions-between-java-and-scala-collections.html) object which replaces the `jcl` package.
 2. Projections have been generalized and cleaned up and are now available as views. It seems that projections were used rarely, so not much code should be affected by this change.
 
 So, if your code uses either `jcl` or projections there might be some minor rewriting to do.

overviews/reflection/symbols-trees-types.md

@@ -384,9 +384,9 @@ as ASTs.
 
 In Scala reflection, APIs that produce or use trees are the following:
 
-1. Scala annotations, which use trees to represent their arguments, exposed in `Annotation.scalaArgs` (for more, see the [Annotations]({{ site.baseurl }}/overviews/reflection/names-exprs-scopes-more.html) section of this guide).
+1. Scala annotations, which use trees to represent their arguments, exposed in `Annotation.scalaArgs` (for more, see the [Annotations]({{ site.baseurl }}/overviews/reflection/annotations-names-scopes.html) section of this guide).
 2. `reify`, a special method that takes an expression and returns an AST that represents this expression.
-3. Compile-time reflection with macros (outlined in the [Macros guide]({{ site.baseurl }}/macros/overview.html)) and runtime compilation with toolboxes both use trees as their program representation medium.
+3. Compile-time reflection with macros (outlined in the [Macros guide]({{ site.baseurl }}/overviews/macros/overview.html)) and runtime compilation with toolboxes both use trees as their program representation medium.
 
 It's important to note that trees are immutable except for three fields--
 `pos` (`Position`), `symbol` (`Symbol`), and `tpe` (`Type`), which are
@@ -441,7 +441,7 @@ expression:
 
 Here, `reify` simply takes the Scala expression it was passed, and returns a
 Scala `Expr`, which is simply wraps a `Tree` and a `TypeTag` (see the
-[Expr]({{ site.baseurl }}/overviews/reflection/names-exprs-scopes-more.html)
+[Expr]({{ site.baseurl }}/overviews/reflection/annotations-names-scopes.html)
 section of this guide for more information about `Expr`s). We can obtain
 the tree that `expr` contains by:
 

sips/minutes/_posts/2016-07-15-sip-minutes.md

@@ -58,19 +58,19 @@ Minutes were taken by Jorge Vicente Cantero, acting secretary.
 
 Attendees Present:
 
-* Martin Odersky ([@odersky](github.com/odersky)), EPFL
-* Adriaan Moors ([@adriaanm](github.com/adriaanm)), Lightbend
-* Heather Miller ([@heathermiller](github.com/heathermiller)), Scala Center
-* Sébastien Doeraene ([@sjrd](github.com/sjrd)), EPFL
-* Eugene Burmako ([@xeno-by](github.com/xeno-by)), EPFL
-* Andrew Marki ([@som-snytt](github.com/som-snytt)), independent
-* Josh Suereth ([@jsuereth](github.com/jsuereth)), Google
-* Dmitry Petrashko ([@DarkDimius](github.com/DarkDimius)), as a guest
-* Jorge Vicente Cantero ([@jvican](github.com/jvican)), Process Lead
+* Martin Odersky ([@odersky](https://github.com/odersky)), EPFL
+* Adriaan Moors ([@adriaanm](https://github.com/adriaanm)), Lightbend
+* Heather Miller ([@heathermiller](https://github.com/heathermiller)), Scala Center
+* Sébastien Doeraene ([@sjrd](https://github.com/sjrd)), EPFL
+* Eugene Burmako ([@xeno-by](https://github.com/xeno-by)), EPFL
+* Andrew Marki ([@som-snytt](https://github.com/som-snytt)), independent
+* Josh Suereth ([@jsuereth](https://github.com/jsuereth)), Google
+* Dmitry Petrashko ([@DarkDimius](https://github.com/DarkDimius)), as a guest
+* Jorge Vicente Cantero ([@jvican](https://github.com/jvican)), Process Lead
 
 ## Guests
 
-* Dmitry Petrashko ([@DarkDimius](github.com/DarkDimius)), EPFL (guest)
+* Dmitry Petrashko ([@DarkDimius](https://github.com/DarkDimius)), EPFL (guest)
 
 ## Proceedings
 

sips/minutes/_posts/2016-08-16-sip-10th-august-minutes.md

@@ -39,18 +39,18 @@ Minutes were taken by Jorge Vicente Cantero, acting secretary.
 
 Attendees Present:
 
-* Seth Tisue ([@SethTisue](github.com/SethTisue)), EPFL
-* Adriaan Moors ([@adriaanm](github.com/adriaanm)), Lightbend
-* Heather Miller ([@heathermiller](github.com/heathermiller)), Scala Center
-* Eugene Burmako ([@xeno-by](github.com/xeno-by)), EPFL
-* Andrew Marki ([@som-snytt](github.com/som-snytt)), independent
-* Josh Suereth ([@jsuereth](github.com/jsuereth)), Google
-* Jorge Vicente Cantero ([@jvican](github.com/jvican)), Process Lead
+* Seth Tisue ([@SethTisue](https://github.com/SethTisue)), EPFL
+* Adriaan Moors ([@adriaanm](https://github.com/adriaanm)), Lightbend
+* Heather Miller ([@heathermiller](https://github.com/heathermiller)), Scala Center
+* Eugene Burmako ([@xeno-by](https://github.com/xeno-by)), EPFL
+* Andrew Marki ([@som-snytt](https://github.com/som-snytt)), independent
+* Josh Suereth ([@jsuereth](https://github.com/jsuereth)), Google
+* Jorge Vicente Cantero ([@jvican](https://github.com/jvican)), Process Lead
 
 ## Apologies
 
-* Martin Odersky ([@odersky](github.com/odersky)), EPFL
-* Sébastien Doeraene ([@sjrd](github.com/sjrd)), EPFL
+* Martin Odersky ([@odersky](https://github.com/odersky)), EPFL
+* Sébastien Doeraene ([@sjrd](https://github.com/sjrd)), EPFL
 
 ## Proceedings
 ### Opening Remarks

tutorials/FAQ/finding-symbols.md

@@ -159,7 +159,7 @@ supertypes (`AnyRef` or `Any`) or a type parameter. In this case, we find
 avaialable on all types.
 
 Other implicit conversions may be visible in your scope depending on imports, extended types or
-self-type annotations. See [Finding implicits](tutorials/FAQ/finding-implicits.md) for details.
+self-type annotations. See [Finding implicits](tutorials/FAQ/finding-implicits.html) for details.
 
 Syntactic sugars/composition
 -----------------------------