scala3-compiler-bootstrapped/dotty.tools.dotc.util/SimpleIdentitySet

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.type

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 map[B <: AnyRef](f: Elem => B): SimpleIdentitySet[B]
def size: Int
def toList: List[Elem]

Concrete methods

def ++[E >: Elem <: AnyRef](that: SimpleIdentitySet[E]): SimpleIdentitySet[E]
def --[E >: Elem <: AnyRef](that: SimpleIdentitySet[E]): SimpleIdentitySet[E]
def filter(p: Elem => Boolean): SimpleIdentitySet[Elem]
def forall[E >: Elem <: AnyRef](p: E => Boolean): Boolean
def intersect: SimpleIdentitySet[E]
Extension method from SimpleIdentitySet
final def isEmpty: Boolean
override def toString: String
Definition Classes
Any