NamedTypeUniques

trait Hashable
class Object
trait Matchable
class Any

Type members

Inherited types

type This = WeakHashSet[A]
Inherited from:
WeakHashSet

Value members

Concrete methods

def enterIfNew(prefix: Type, designator: Designator, isTerm: Boolean)(using Context): NamedType
override def hash(x: NamedType): Int
Definition Classes

Inherited methods

Inherited from:
MutableSet
def +=(elem: NamedType): Unit

Add element x to the set

Add element x to the set

Inherited from:
WeakHashSet
Inherited from:
MutableSet
def -=(elem: NamedType): Unit

Remove element x from the set

Remove element x from the set

Inherited from:
WeakHashSet
def clear(): Unit
Inherited from:
WeakHashSet
Inherited from:
ReadOnlySet
def foreach[U](f: NamedType => U): Unit
Inherited from:
ReadOnlySet
Inherited from:
Hashable
Inherited from:
ReadOnlySet
override def iterator: Iterator[NamedType]
Definition Classes
Inherited from:
WeakHashSet
def lookup(elem: NamedType): NamedType | Null

The entry in the set such that isEqual(x, entry), or else null.

The entry in the set such that isEqual(x, entry), or else null.

Inherited from:
WeakHashSet
def put(elem: NamedType): NamedType

Like += but return existing element equal to x of it exists, x itself otherwise.

Like += but return existing element equal to x of it exists, x itself otherwise.

Inherited from:
WeakHashSet
def size: Int
Inherited from:
WeakHashSet
Inherited from:
ReadOnlySet
final def typeHash(bs: Binders, tp: Type): Int
Inherited from:
Hashable