Permalink
Browse files

Corrects links in API documentation

  • Loading branch information...
heathermiller committed May 16, 2012
1 parent 9968734 commit 37d6ffbdb0fe81f59a8b015e3beaa8b52033adca
@@ -37,7 +37,7 @@ object Function {
* @param f a function `T => Option[R]`
* @return a partial function defined for those inputs where
* f returns `Some(_)` and undefined where `f` returns `None`.
* @see [[scala.PartialFunction#lift]]
* @see [[scala.PartialFunction]], method `lift`.
*/
def unlift[T, R](f: T => Option[R]): PartialFunction[T, R] = PartialFunction.unlifted(f)
@@ -451,14 +451,14 @@ object Predef extends LowPriorityImplicits {
}
/** A type for which there is always an implicit value.
* @see fallbackCanBuildFrom in Array.scala
* @see [[scala.Array$]], method `fallbackCanBuildFrom`
*/
class DummyImplicit
object DummyImplicit {
/** An implicit value yielding a `DummyImplicit`.
* @see fallbackCanBuildFrom in Array.scala
* @see [[scala.Array$]], method `fallbackCanBuildFrom`
*/
implicit def dummyImplicit: DummyImplicit = new DummyImplicit
}
@@ -148,7 +148,7 @@ self =>
}
/** Partitions elements in fixed size ${coll}s.
* @see Iterator#grouped
* @see [[scala.collection.Iterator]], method `grouped`
*
* @param size the number of elements per group
* @return An iterator producing ${coll}s of size `size`, except the
@@ -163,7 +163,7 @@ self =>
/** Groups elements in fixed size blocks by passing a "sliding window"
* over them (as opposed to partitioning them, as is done in grouped.)
* @see Iterator#sliding
* @see [[scala.collection.Iterator]], method `sliding`
*
* @param size the number of elements per group
* @return An iterator producing ${coll}s of size `size`, except the
@@ -174,7 +174,7 @@ self =>
/** Groups elements in fixed size blocks by passing a "sliding window"
* over them (as opposed to partitioning them, as is done in grouped.)
* @see Iterator#sliding
* @see [[scala.collection.Iterator]], method `sliding`
*
* @param size the number of elements per group
* @param step the distance between the first elements of successive
@@ -824,7 +824,7 @@ trait Iterator[+A] extends TraversableOnce[A] {
/** Creates a buffered iterator from this iterator.
*
* @see BufferedIterator
* @see [[scala.collection.BufferedIterator]]
* @return a buffered iterator producing the same values as this iterator.
* @note Reuse: $consumesAndProducesIterator
*/
@@ -566,7 +566,7 @@ trait SeqLike[+A, +Repr] extends Any with IterableLike[A, Repr] with GenSeqLike[
/** Sorts this $Coll according to the Ordering which results from transforming
* an implicitly given Ordering with a transformation function.
* @see scala.math.Ordering
* @see [[scala.math.Ordering]]
* $willNotTerminateInf
* @param f the transformation function mapping elements
* to some other domain `B`.
@@ -591,7 +591,7 @@ trait SeqLike[+A, +Repr] extends Any with IterableLike[A, Repr] with GenSeqLike[
* The sort is stable. That is, elements that are equal (as determined by
* `lt`) appear in the same order in the sorted sequence as in the original.
*
* @see scala.math.Ordering
* @see [[scala.math.Ordering]]
*
* @param ord the ordering to be used to compare elements.
* @return a $coll consisting of the elements of this $coll
@@ -852,7 +852,7 @@ object SeqLike {
/** Finds a particular index at which one sequence occurs in another sequence.
* Like `indexOf`, but finds the latest occurrence rather than earliest.
*
* @see SeqLike#indexOf
* @see [[scala.collection.SeqLike], method `indexOf`
*/
def lastIndexOf[B](
source: Seq[B], sourceOffset: Int, sourceCount: Int,
@@ -20,7 +20,7 @@ import scala.annotation.implicitNotFound
* @tparam Elem the element type of the collection to be created.
* @tparam To the type of the collection to be created.
*
* @see Builder
* @see [[scala.collection.mutable.Builder]]
* @author Martin Odersky
* @author Adriaan Moors
* @since 2.8
@@ -16,7 +16,7 @@ import language.higherKinds
* represent an unconstrained higher-kinded type. Typically
* such classes inherit from trait `GenericTraversableTemplate`.
* @tparam CC The type constructor representing the collection class.
* @see GenericTraversableTemplate
* @see [[scala.collection.generic.GenericTraversableTemplate]]
* @author Martin Odersky
* @since 2.8
* @define coll collection
@@ -50,7 +50,7 @@ package object sys {
/** A bidirectional, mutable Map representing the current system Properties.
*
* @return a SystemProperties.
* @see `scala.sys.SystemProperties`
* @see [[scala.sys.SystemProperties]]
*/
def props: SystemProperties = new SystemProperties
@@ -19,7 +19,7 @@ import java.lang.Integer.{ rotateLeft => rotl }
* to remedy some weaknesses and improve performance. This represents the
* latest and supposedly final version of the algortihm (revision 136).
*
* @see http://code.google.com/p/smhasher
* @see [[http://code.google.com/p/smhasher]]
*/
class MurmurHash3 {
/** Mix in a block of data into an intermediate hash value. */
@@ -25,8 +25,8 @@ import scala.collection.mutable
* `delimiters` set.
*
* Usually this component is used to break character-based input into
* bigger tokens, which are then passed to a token-parser {@see
* [[scala.util.parsing.combinator.syntactical.TokenParsers]]}.
* bigger tokens, which are then passed to a token-parser (see
* [[scala.util.parsing.combinator.syntactical.TokenParsers]].)
*
* @author Martin Odersky
* @author Iulian Dragos
@@ -162,8 +162,6 @@ abstract class Node extends NodeSeq {
/**
* Same as `toString('''false''')`.
*
* @see <code><a href="#toString">toString(Boolean)</a></code>
*/
override def toString(): String = buildString(false)

0 comments on commit 37d6ffb

Please sign in to comment.