dotty.tools.dotc.core.Uniques

RefinedUniques

Related Doc: package Uniques

final class RefinedUniques extends HashSet[RefinedType] with Hashable

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RefinedUniques
  2. Hashable
  3. HashSet
  4. Set
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RefinedUniques()

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  4. final def addDelta(elemHash: Int, delta: Int): Int

    Attributes
    protected
    Definition Classes
    Hashable
  5. def addEntries(xs: TraversableOnce[RefinedType]): Unit

    Add all entries in xs to set

    Add all entries in xs to set

    Definition Classes
    HashSet
  6. def addEntry(x: RefinedType): Unit

    Add entry x to set

    Add entry x to set

    Definition Classes
    HashSetSet
  7. def addEntryAfterScan(x: RefinedType): RefinedType

    Privileged access: Add entry x at the last position where an unsuccsessful findEntryByHash or nextEntryByhash operation returned.

    Privileged access: Add entry x at the last position where an unsuccsessful findEntryByHash or nextEntryByhash operation returned. Needs to immediately follow a findEntryByhash or nextEntryByHash operation that was unsucessful, i.e. that returned null.

    Attributes
    protected
    Definition Classes
    HashSet
  8. def apply(x: RefinedType): Boolean

    Definition Classes
    Set
  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  10. def clear(): Unit

    Remove all elements from this set and set back to initial configuration

    Remove all elements from this set and set back to initial configuration

    Definition Classes
    HashSetSet
  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def contains(x: RefinedType): Boolean

    Definition Classes
    Set
  13. final def doHash(x1: Int, x2: Int): Int

    Attributes
    protected
    Definition Classes
    Hashable
  14. final def doHash(x1: Any, tp2: Type, tps3: List[Type]): Int

    Attributes
    protected
    Definition Classes
    Hashable
  15. final def doHash(tp1: Type, tps2: List[Type]): Int

    Attributes
    protected
    Definition Classes
    Hashable
  16. final def doHash(x1: Any, tp2: Type, tp3: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  17. final def doHash(tp1: Type, tp2: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  18. final def doHash(x1: Any, tp2: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  19. final def doHash(tp: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  20. final def doHash(x: Any): Int

    Attributes
    protected
    Definition Classes
    Hashable
  21. def enterIfNew(rt: RefinedType): RefinedType

  22. def enterIfNew(parent: Type, refinedName: Name, refinedInfo: Type): RefinedType

  23. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  24. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  25. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. def findEntry(x: RefinedType): RefinedType

    The entry in the set such that x equals entry, or else null.

    The entry in the set such that x equals entry, or else null.

    Definition Classes
    HashSetSet
  27. def findEntryByHash(hashCode: Int): RefinedType

    Privileged access: Find first entry with given hashcode

    Privileged access: Find first entry with given hashcode

    Attributes
    protected
    Definition Classes
    HashSet
  28. def findEntryOrUpdate(x: RefinedType): RefinedType

    Find entry such that x equals entry.

    Find entry such that x equals entry. If it exists, return it. If not, enter x in set and return x.

    Definition Classes
    HashSet
  29. def finishHash(seed: Int, arity: Int, tp: Type, tps: List[Type]): Int

    Attributes
    protected
    Definition Classes
    Hashable
  30. def finishHash(seed: Int, arity: Int, tps: List[Type]): Int

    Attributes
    protected
    Definition Classes
    Hashable
  31. def finishHash(seed: Int, arity: Int, tp1: Type, tp2: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  32. def finishHash(seed: Int, arity: Int, tp: Type): Int

    Attributes
    protected
    Definition Classes
    Hashable
  33. final def finishHash(hashCode: Int, arity: Int): Int

    Attributes
    protected
    Definition Classes
    Hashable
  34. def foreach[U](f: (RefinedType) ⇒ U): Unit

    Definition Classes
    Set
  35. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  36. def hash(x: RefinedType): Int

    Hashcode, can be overridden

    Hashcode, can be overridden

    Definition Classes
    RefinedUniquesHashSet
  37. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  38. val hashSeed: Int

    Definition Classes
    RefinedUniquesHashable
  39. final def identityHash: Int

    Definition Classes
    Hashable
  40. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  41. def iterator: Iterator[RefinedType]

    The iterator of all elements in the set

    The iterator of all elements in the set

    Definition Classes
    HashSetSet
  42. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  43. def nextEntryByHash(hashCode: Int): RefinedType

    Privileged access: Find next entry with given hashcode.

    Privileged access: Find next entry with given hashcode. Needs to immediately follow a findEntryByhash or nextEntryByHash operation.

    Attributes
    protected
    Definition Classes
    HashSet
  44. final def notify(): Unit

    Definition Classes
    AnyRef
  45. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  46. def size: Int

    The number of elements in the set

    The number of elements in the set

    Definition Classes
    HashSet
  47. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  48. def toList: List[RefinedType]

    Definition Classes
    Set
  49. def toString(): String

    Definition Classes
    HashSet → AnyRef → Any
  50. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Hashable

Inherited from HashSet[RefinedType]

Inherited from Set[RefinedType]

Inherited from AnyRef

Inherited from Any

Ungrouped