summaryrefslogtreecommitdiff
path: root/src/library/scala/collection/mutable/FlatHashTable.scala
diff options
context:
space:
mode:
authormichelou <michelou@epfl.ch>2007-06-08 12:08:26 +0000
committermichelou <michelou@epfl.ch>2007-06-08 12:08:26 +0000
commit540c308ca6d7ef2370bfaa8d1b0870003a2c1037 (patch)
treed60f80b7f2f3ecd0033e97e9645a0f23bd9c2e16 /src/library/scala/collection/mutable/FlatHashTable.scala
parent278f89bf2ffe945028056d8d4e120bae47598e09 (diff)
downloadscala-540c308ca6d7ef2370bfaa8d1b0870003a2c1037.tar.gz
scala-540c308ca6d7ef2370bfaa8d1b0870003a2c1037.tar.bz2
scala-540c308ca6d7ef2370bfaa8d1b0870003a2c1037.zip
removed primitive type aliases from the standar...
removed primitive type aliases from the standard library
Diffstat (limited to 'src/library/scala/collection/mutable/FlatHashTable.scala')
-rw-r--r--src/library/scala/collection/mutable/FlatHashTable.scala20
1 files changed, 12 insertions, 8 deletions
diff --git a/src/library/scala/collection/mutable/FlatHashTable.scala b/src/library/scala/collection/mutable/FlatHashTable.scala
index 4cf1e8f5aa..80150e6e47 100644
--- a/src/library/scala/collection/mutable/FlatHashTable.scala
+++ b/src/library/scala/collection/mutable/FlatHashTable.scala
@@ -1,8 +1,12 @@
-/* NSC -- new Scala compiler
- * Copyright 2005-2007 LAMP/EPFL
- * @author Martin Odersky
- */
-// $Id: HashSet.scala 9235 2006-11-13 14:59:18 +0000 (Mon, 13 Nov 2006) mihaylov $
+/* __ *\
+** ________ ___ / / ___ Scala API **
+** / __/ __// _ | / / / _ | (c) 2003-2007, LAMP/EPFL **
+** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
+** /____/\___/_/ |_/____/_/ | | **
+** |/ **
+\* */
+
+// $Id: $
package scala.collection.mutable
@@ -72,7 +76,7 @@ trait FlatHashTable[A] {
def removeEntry(elem: A) {
if (tableDebug) checkConsistent()
- def precedes(i: int, j: int) = {
+ def precedes(i: Int, j: Int) = {
val d = table.length >> 1
if (i <= j) j - i < d
else i - j > d
@@ -106,11 +110,11 @@ trait FlatHashTable[A] {
def elements = new Iterator[A] {
private var i = 0
def hasNext: Boolean = {
- while (i < table.length && (null == table(i))) i = i + 1;
+ while (i < table.length && (null == table(i))) i += 1;
i < table.length
}
def next(): A =
- if (hasNext) { i = i + 1; table(i - 1).asInstanceOf[A] }
+ if (hasNext) { i += 1; table(i - 1).asInstanceOf[A] }
else Iterator.empty.next
}