diff options
author | Martin Odersky <odersky@gmail.com> | 2009-02-13 11:59:49 +0000 |
---|---|---|
committer | Martin Odersky <odersky@gmail.com> | 2009-02-13 11:59:49 +0000 |
commit | 04840e2ed4530df9a5ca59b984bf2b37a976dc70 (patch) | |
tree | 61394762e202f8ab60e0d3a8e8ac688404241bc3 /src/library/scalax/collection/immutable/DefaultSet.scala | |
parent | 708baf94764e2a839e24ca6204060a8d0664d88c (diff) | |
download | scala-04840e2ed4530df9a5ca59b984bf2b37a976dc70.tar.gz scala-04840e2ed4530df9a5ca59b984bf2b37a976dc70.tar.bz2 scala-04840e2ed4530df9a5ca59b984bf2b37a976dc70.zip |
new version of collection libraries
Diffstat (limited to 'src/library/scalax/collection/immutable/DefaultSet.scala')
-rw-r--r-- | src/library/scalax/collection/immutable/DefaultSet.scala | 45 |
1 files changed, 45 insertions, 0 deletions
diff --git a/src/library/scalax/collection/immutable/DefaultSet.scala b/src/library/scalax/collection/immutable/DefaultSet.scala new file mode 100644 index 0000000000..a9ce3fb3df --- /dev/null +++ b/src/library/scalax/collection/immutable/DefaultSet.scala @@ -0,0 +1,45 @@ +/* __ *\ +** ________ ___ / / ___ Scala API ** +** / __/ __// _ | / / / _ | (c) 2003-2009, LAMP/EPFL ** +** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ ** +** /____/\___/_/ |_/____/_/ | | ** +** |/ ** +\* */ + +// $Id: HashSet.scala 16884 2009-01-09 16:52:09Z cunei $ + +package scalax.collection.immutable + +import generic.SetTemplate + +/** A default implementation of immutable sets. + * This is currently implemented as a proxy for an immutable HashSet, + * except that its builder returns specialized representations EmptySet,Set1,..., Set4 + * for sets of size <= 4. + */ +class DefaultSet[A] private (hset: HashSet[A]) + extends Set[A] + with SetTemplate[Set, A] { + + def this() = this(new HashSet[A]) + + def contains(elem: A): Boolean = hset.contains(elem) + + def + (elem: A): Set[A] = hset + elem + + /** Keeps underlying HashSet representation, but switches back to EmptySet if + * result does not contain any elements + */ + def - (elem: A): Set[A] = { + val hset1 = hset - elem + if (hset1.isEmpty) new EmptySet[A] + else new DefaultSet(hset) + } + + def size: Int = hset.size + + def elements: Iterator[A] = hset.elements + + override def foreach(f: A => Unit): Unit = hset.foreach(f) +} + |