Scala Library: scala.collection.mutable.LinkedHashSet
scala.collection.mutable.LinkedHashSet
object LinkedHashSet extends MutableSetFactory[LinkedHashSet] with SerializableThis object provides a set of operations needed to create LinkedHashSet
values.
Type Members
type Coll = LinkedHashSet[_]
The underlying collection type with unknown element type
- Attributes
- protected[this]
- Definition Classes
- GenericCompanion
Value Members From scala.collection.generic.GenSetFactory
def setCanBuildFrom[A]: CanBuildFrom[LinkedHashSet[_], A, LinkedHashSet[A]]
The standard CanBuildFrom instance for Set objects.
- Definition Classes
- GenSetFactory
(defined at scala.collection.generic.GenSetFactory)
Value Members From scala.collection.generic.GenericCompanion
def apply[A](elems: A*): LinkedHashSet[A]
Creates a collection with the specified elements.
- A
- the type of the collection’s elements
- elems
- the elements of the created collection
- returns
- a new collection with elements
elems
- a new collection with elements
- Definition Classes
- GenericCompanion
(defined at scala.collection.generic.GenericCompanion)
Value Members From scala.collection.generic.MutableSetFactory
def newBuilder[A]: Builder[A, LinkedHashSet[A]]
The default builder for Set objects.
- A
- the type of the set’s elements
- Definition Classes
- MutableSetFactory → GenSetFactory → GenericCompanion
(defined at scala.collection.generic.MutableSetFactory)
Value Members From scala.collection.mutable.LinkedHashSet
implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinkedHashSet[A]]
(defined at scala.collection.mutable.LinkedHashSet)
def empty[A]: LinkedHashSet[A]
An empty collection of type LinkedHashSet[A]
- A
- the type of the linked hash set’s elements
- Definition Classes
- LinkedHashSet → GenericCompanion (defined at scala.collection.mutable.LinkedHashSet)
Full Source:
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2005-2013, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
package scala
package collection
package mutable
import generic._
/** This class implements mutable sets using a hashtable.
* The iterator and all traversal methods of this class visit elements in the order they were inserted.
*
* @author Matthias Zenger
* @author Martin Odersky
* @author Pavel Pavlov
* @version 2.0, 31/12/2006
* @since 1
*
* @tparam A the type of the elements contained in this set.
*
* @define Coll `LinkedHashSet`
* @define coll linked hash set
* @define thatinfo the class of the returned collection. In the standard library configuration,
* `That` is always `LinkedHashSet[B]` because an implicit of type `CanBuildFrom[LinkedHashSet, B, LinkedHashSet[B]]`
* is defined in object `LinkedHashSet`.
* @define bfinfo an implicit value of class `CanBuildFrom` which determines the
* result class `That` from the current representation type `Repr`
* and the new element type `B`. This is usually the `canBuildFrom` value
* defined in object `LinkedHashSet`.
* @define mayNotTerminateInf
* @define willNotTerminateInf
* @define orderDependent
* @define orderDependentFold
*/
@SerialVersionUID(1L)
class LinkedHashSet[A] extends AbstractSet[A]
with Set[A]
with GenericSetTemplate[A, LinkedHashSet]
with SetLike[A, LinkedHashSet[A]]
with HashTable[A, LinkedHashSet.Entry[A]]
with Serializable
{
override def companion: GenericCompanion[LinkedHashSet] = LinkedHashSet
type Entry = LinkedHashSet.Entry[A]
@transient protected var firstEntry: Entry = null
@transient protected var lastEntry: Entry = null
override def size: Int = tableSize
def contains(elem: A): Boolean = findEntry(elem) ne null
@deprecatedOverriding("+= should not be overridden so it stays consistent with add.", "2.11.0")
def += (elem: A): this.type = { add(elem); this }
@deprecatedOverriding("-= should not be overridden so it stays consistent with remove.", "2.11.0")
def -= (elem: A): this.type = { remove(elem); this }
override def add(elem: A): Boolean = findOrAddEntry(elem, null) eq null
override def remove(elem: A): Boolean = {
val e = removeEntry(elem)
if (e eq null) false
else {
if (e.earlier eq null) firstEntry = e.later
else e.earlier.later = e.later
if (e.later eq null) lastEntry = e.earlier
else e.later.earlier = e.earlier
true
}
}
def iterator: Iterator[A] = new AbstractIterator[A] {
private var cur = firstEntry
def hasNext = cur ne null
def next =
if (hasNext) { val res = cur.key; cur = cur.later; res }
else Iterator.empty.next()
}
override def foreach[U](f: A => U) {
var cur = firstEntry
while (cur ne null) {
f(cur.key)
cur = cur.later
}
}
protected override def foreachEntry[U](f: Entry => U) {
var cur = firstEntry
while (cur ne null) {
f(cur)
cur = cur.later
}
}
protected def createNewEntry[B](key: A, dummy: B): Entry = {
val e = new Entry(key)
if (firstEntry eq null) firstEntry = e
else { lastEntry.later = e; e.earlier = lastEntry }
lastEntry = e
e
}
override def clear() {
clearTable()
firstEntry = null
lastEntry = null
}
private def writeObject(out: java.io.ObjectOutputStream) {
serializeTo(out, { e => out.writeObject(e.key) })
}
private def readObject(in: java.io.ObjectInputStream) {
firstEntry = null
lastEntry = null
init(in, createNewEntry(in.readObject().asInstanceOf[A], null))
}
}
/** $factoryInfo
* @define Coll `LinkedHashSet`
* @define coll linked hash set
*/
object LinkedHashSet extends MutableSetFactory[LinkedHashSet] {
implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinkedHashSet[A]] = setCanBuildFrom[A]
override def empty[A]: LinkedHashSet[A] = new LinkedHashSet[A]
/** Class for the linked hash set entry, used internally.
* @since 2.10
*/
private[scala] final class Entry[A](val key: A) extends HashEntry[A, Entry[A]] with Serializable {
var earlier: Entry[A] = null
var later: Entry[A] = null
}
}Interested in Scala?
I send out weekly, personalized emails with articles and conference talks.
Subscribe now.