AppliedUniques

dotty.tools.dotc.core.Uniques.AppliedUniques

Attributes

Graph
Supertypes
trait Hashable
class Object
trait Matchable
class Any
Show all

Members list

Type members

Inherited types

type This = WeakHashSet[A]

Attributes

Inherited from:
WeakHashSet

Value members

Concrete methods

def enterIfNew(tycon: Type, args: List[Type]): AppliedType
override def hash(x: AppliedType): Int

Attributes

Definition Classes

Inherited methods

Attributes

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

Add element x to the set

Add element x to the set

Attributes

Inherited from:
WeakHashSet

Attributes

Inherited from:
MutableSet
def -=(elem: AppliedType): Unit

Remove element x from the set

Remove element x from the set

Attributes

Inherited from:
WeakHashSet
def clear(resetToInitial: Boolean): Unit

Remove all elements from this set.

Remove all elements from this set.

Value parameters

resetToInitial

If true, set back to initial configuration, which includes reallocating tables.

Attributes

Inherited from:
WeakHashSet

Attributes

Inherited from:
ReadOnlySet
def foreach[U](f: AppliedType => U): Unit

Attributes

Inherited from:
ReadOnlySet

Attributes

Inherited from:
Hashable

Attributes

Inherited from:
ReadOnlySet
override def iterator: Iterator[A]

Attributes

Definition Classes
Inherited from:
WeakHashSet
def lookup(elem: AppliedType): A | 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.

Attributes

Inherited from:
WeakHashSet
def put(elem: AppliedType): A

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.

Attributes

Inherited from:
WeakHashSet
def size: Int

Attributes

Inherited from:
WeakHashSet
def toList: List[T]

Attributes

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

Attributes

Inherited from:
Hashable