summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorAntonio Cunei <antonio.cunei@epfl.ch>2009-11-04 17:33:41 +0000
committerAntonio Cunei <antonio.cunei@epfl.ch>2009-11-04 17:33:41 +0000
commit1f075b56f8d727e4e1b924f8a4e464522fc26abc (patch)
tree8769989f0cb7ac683d2651ffc2e12ecb9e0d4f7f /src
parent7cbc06ed2073df58f1af272c0c038aed087eebf9 (diff)
downloadscala-1f075b56f8d727e4e1b924f8a4e464522fc26abc.tar.gz
scala-1f075b56f8d727e4e1b924f8a4e464522fc26abc.tar.bz2
scala-1f075b56f8d727e4e1b924f8a4e464522fc26abc.zip
Clarification to scaladoc comments for "sort".
Diffstat (limited to 'src')
-rw-r--r--src/library/scala/collection/SeqLike.scala6
-rw-r--r--src/library/scala/collection/immutable/List.scala6
2 files changed, 6 insertions, 6 deletions
diff --git a/src/library/scala/collection/SeqLike.scala b/src/library/scala/collection/SeqLike.scala
index 3c8eaec9a2..3b7efd11d2 100644
--- a/src/library/scala/collection/SeqLike.scala
+++ b/src/library/scala/collection/SeqLike.scala
@@ -522,9 +522,9 @@ trait SeqLike[+A, +Repr] extends IterableLike[A, Repr] { self =>
}
/** Sort the sequence according to the comparison function
- * <code>&lt;(e1: a, e2: a) =&gt; Boolean</code>,
- * which should be true iff <code>e1</code> is smaller than
- * <code>e2</code>.
+ * <code>lt(e1: a, e2: a) =&gt; Boolean</code>,
+ * which should be true iff <code>e1</code> precedes
+ * <code>e2</code> in the desired ordering.
* The sort is stable. That is elements that are equal wrt `lt` appear in the
* same order in the sorted sequence as in the original.
*
diff --git a/src/library/scala/collection/immutable/List.scala b/src/library/scala/collection/immutable/List.scala
index 59a5bfdf3a..c3f3ff6232 100644
--- a/src/library/scala/collection/immutable/List.scala
+++ b/src/library/scala/collection/immutable/List.scala
@@ -355,9 +355,9 @@ sealed abstract class List[+A] extends LinearSeq[A]
/** <p>
* Sort the list according to the comparison function
- * <code>&lt;(e1: a, e2: a) =&gt; Boolean</code>,
- * which should be true iff <code>e1</code> is smaller than
- * <code>e2</code>.
+ * <code>lt(e1: a, e2: a) =&gt; Boolean</code>,
+ * which should be true iff <code>e1</code> precedes
+ * <code>e2</code> in the desired ordering.
* !!! todo: move sorting to IterableLike
* </p>
*