|
Scala example source code file (HashSet.scala)
The HashSet.scala Scala example source code/* NSC -- new Scala compiler * Copyright 2005-2013 LAMP/EPFL * @author Martin Odersky */ package scala package reflect package internal.util object HashSet { def apply[T >: Null <: AnyRef](initialCapacity: Int): HashSet[T] = this("No Label", initialCapacity) def apply[T >: Null <: AnyRef](label: String, initialCapacity: Int): HashSet[T] = new HashSet[T](label, initialCapacity) } class HashSet[T >: Null <: AnyRef](val label: String, initialCapacity: Int) extends Set[T] with scala.collection.generic.Clearable { private var used = 0 private var table = new Array[AnyRef](initialCapacity) private def index(x: Int): Int = math.abs(x % table.length) def size: Int = used def clear() { used = 0 table = new Array[AnyRef](initialCapacity) } def findEntryOrUpdate(x: T): T = { var h = index(x.##) var entry = table(h) while (entry ne null) { if (x == entry) return entry.asInstanceOf[T] h = index(h + 1) entry = table(h) } table(h) = x used += 1 if (used > (table.length >> 2)) growTable() x } def findEntry(x: T): T = { var h = index(x.##) var entry = table(h) while ((entry ne null) && x != entry) { h = index(h + 1) entry = table(h) } entry.asInstanceOf[T] } def addEntry(x: T) { var h = index(x.##) var entry = table(h) while (entry ne null) { if (x == entry) return h = index(h + 1) entry = table(h) } table(h) = x used += 1 if (used > (table.length >> 2)) growTable() } def addEntries(xs: TraversableOnce[T]) { xs foreach addEntry } def iterator = new Iterator[T] { private var i = 0 def hasNext: Boolean = { while (i < table.length && (table(i) eq null)) i += 1 i < table.length } def next(): T = if (hasNext) { i += 1; table(i - 1).asInstanceOf[T] } else null } private def addOldEntry(x: T) { var h = index(x.##) var entry = table(h) while (entry ne null) { h = index(h + 1) entry = table(h) } table(h) = x } private def growTable() { val oldtable = table val growthFactor = if (table.length <= initialCapacity) 8 else if (table.length <= (initialCapacity * 8)) 4 else 2 table = new Array[AnyRef](table.length * growthFactor) var i = 0 while (i < oldtable.length) { val entry = oldtable(i) if (entry ne null) addOldEntry(entry.asInstanceOf[T]) i += 1 } } override def toString() = "HashSet %s(%d / %d)".format(label, used, table.length) } Other Scala source code examplesHere is a short list of links related to this Scala HashSet.scala source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.