diff options
author | Sean McDirmid <sean.mcdirmid@gmail.com> | 2007-05-21 12:40:17 +0000 |
---|---|---|
committer | Sean McDirmid <sean.mcdirmid@gmail.com> | 2007-05-21 12:40:17 +0000 |
commit | e8447205a89f557cea8cf7a70f954db6848e91ee (patch) | |
tree | ba2fd51b483e9ffea82b9eae0a4bcf04ea45afac /src/library/scala/collection/SortedMap.scala | |
parent | 6c4a4d5de8bc23bc0457d9903e0fa9fc0979197d (diff) | |
download | scala-e8447205a89f557cea8cf7a70f954db6848e91ee.tar.gz scala-e8447205a89f557cea8cf7a70f954db6848e91ee.tar.bz2 scala-e8447205a89f557cea8cf7a70f954db6848e91ee.zip |
[1] upgraded buffered iterator to have unbounde...
[1] upgraded buffered iterator to have unbounded lookahead
[2] down-graded some custom iterators that could not implement this
behavior (compatible because the signatures only indicate Iterator)
[3] added RollBackIterator for iterators that can be backed up (useful
for scanning)
[4] DefaultBufferedIterator for a nice default implementaiton of
BufferedIterator
[5] Added RandomAccessSeq for Seq's that can be indexed in linear time
(e.g., Array), optimized seq methods for these seqs. Got the appropriate
classes to inherit from this trait
[6] Enhanced projections so they are iterables. An operation on a
projection is also a projection (if possible)
[7] Various small enhancements to the JCL
Diffstat (limited to 'src/library/scala/collection/SortedMap.scala')
-rw-r--r-- | src/library/scala/collection/SortedMap.scala | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/library/scala/collection/SortedMap.scala b/src/library/scala/collection/SortedMap.scala index 57649a84e2..f645c9d9ba 100644 --- a/src/library/scala/collection/SortedMap.scala +++ b/src/library/scala/collection/SortedMap.scala @@ -15,8 +15,8 @@ package scala.collection; * @author Sean McDirmid */ trait SortedMap[K,+E] extends Map[K,E] with Sorted[K,Tuple2[K,E]] { - override def first : K = elements.next._1; - override def last : K = { + override def firstKey : K = elements.next._1; + override def lastKey : K = { val i = elements; var last : K = i.next._1; while (i.hasNext) last = i.next._1; |