SimpleIdentitySet

abstract class SimpleIdentitySet[+Elem <: AnyRef]

A simple linked set with eq as the comparison, optimized for small sets. It has linear complexity for contains, +, and -.

Companion
object
class Object
trait Matchable
class Any
object empty

Value members

Abstract methods

def +[E >: Elem <: AnyRef](x: E): SimpleIdentitySet[E]
def -[E >: Elem <: AnyRef](x: E): SimpleIdentitySet[Elem]
def /:[A, E >: Elem <: AnyRef](z: A)(f: (A, E) => A): A
def contains[E >: Elem <: AnyRef](x: E): Boolean
def exists[E >: Elem <: AnyRef](p: E => Boolean): Boolean
def foreach(f: Elem => Unit): Unit
def size: Int

Concrete methods

def ++[E >: Elem <: AnyRef](that: SimpleIdentitySet[E]): SimpleIdentitySet[E]
def --[E >: Elem <: AnyRef](that: SimpleIdentitySet[E]): SimpleIdentitySet[E]
final def isEmpty: Boolean
override def toString: String
Definition Classes
Any