Packages

  • package root
    Definition Classes
    root
  • package info
    Definition Classes
    root
  • package kwarc
    Definition Classes
    info
  • package mmt
    Definition Classes
    kwarc
  • package api

    This is the main package of the MMT API.

    This is the main package of the MMT API.

    It holds subpackages for all data structures, data containers, and the central algorithms and services.

    Classes directly defined in the package

    Some minor classes that are used throughout MMT are defined in this package, in particular:

    • MMT URIs in the class Path and Namespace
    • processing and content errors in the class Error

    The package also contains root classes for certain types that are subclassed throughout the package. Most importantly:

    • StructuralElement: structure-level (= named) parts in the data structures for the MMT language: documents, theories, constants, ...
    • MMTTask: tasks for a single object: parsing, checking, ...
    • Rule: object-level part of the MMT language that is written in Scala

    Subpackages

    Data structures for the MMT language

    The data structures for the MMT languages are defined in 4 packages corresponding to the 4 levels: - documents: Documents and all other NarrativeElements - modules: Modules (= the toplevel declarations), in particular Theorys and Views - symbols: all Declarations inside modules, in particular Constants - objects: all anonymous Objects (e.g., formulas, functions, etc.), in particular Contexts and Terms

    The former 3 levels are jointly called 'structural' levels. All elements subclass StructuralElement, have an MMT URI, and carry an MMT URI referring to their parent in the MMT abstract syntax tree.

    Structural elements are extensible (via DerivedModules and DerivedDeclarations), and the package patterns defines declaration patterns as a built-in extension.

    All structural elements are mutable and implement the ContainerElement interface for changing their children. Objects, by contrast, are represented as immutable inductive types.(except for carrying metadata.Metadata and objects.ClientProperties). The boundary between structural elements and objects is mediated by ComponentContainers: these are mutable, owned by structural elements, and maintain objects.

    A few auxiliary data structures shifted to separate packages: - opaque: external (i.e., informal, computation) content - informal: partially outdated informal data structures - metadata: metadata annotations to all structural elements or objects

    The MMT main class and its internal state

    The package frontend contains the class Controller, which owns all state relevant for running MMT. Typically, each application creates a single instance of this class. The package also defines several other essential classes, most importantly MMT's extension (=plug-in, add-on) interfaces via the Extension class.

    The package libraries maintains the instances of MMT language data structures, in particular the Library class. Controller owns a Library, which stores all structural elements that have been loaded into memory.

    User interfaces

    The package frontend also contains the main executable classes, in particular the Shell class.

    The package gui collects all classes for building graphical user interfaces. This includes auxiliary classes for use in IDE plugins.

    The package web collects all classes for the HTTP interface of MMT.

    Physical storage of the MMT language files

    The package archives defines MMT Archives (= projects) as well as classes for building and working with archives. The latter include in particular the BuildManager and BuildTarget. Build targets include Importers and [Exporter]]s that translate between MMT and other formats.

    The package backend defines classes for maintaining archives and translating between the MMT URIs of structural elements and their physical storage locations.

    The central algorithms for processing MMT content

    The processing model of MMT consists of several major algorithms. - parser: read strings into MMT data structures - checking: check and refine MMT data structures - uom: pure computation on MMT data structures - proving: theorem proving on MMT data structures (in very early state)) - execution: imperative computation (in very, very early state) - presentation: rendering MMT data structures in user-facing formats (including HTML+presentation MathML)

    All algorithms are defined in Extensions coupled with default implementations. Moreover, all algorithms are split into two separate levels, one for structural elements and objects. See LeveledExtension.

    The package notations maintains the common code for parsing and presentation.

    The package valuebases maintains mathematical databases as a part of MMT.

    Other algorithms on the MMT data structures

    The package ontology contains a relational, semantic web-style ontology and query engine for it.

    The package moc contains change management.

    The package refactoring contains refactoring principles.

    General purpose utility functions

    The package utils defines general purpose APIs for files, URIs, HTML building, etc.

    Definition Classes
    mmt
  • package proving

    The algorithm for proving theorems about MMT content.

    The algorithm for proving theorems about MMT content. This is very premature and experimental.

    See api for an overview of the algorithms.

    The main interfaces are - Prover: object level proving

    Structure level proving does not exist yet.

    The main implementations are - RuleBasedProver for object-level proving

    The latter creates a Searcher for each proving task, which applies search rules to find MMT objects.

    Definition Classes
    api
  • package imperative
    Definition Classes
    proving
  • Alternative
  • ApplicableTactic
  • Atom
  • AtomicShape
  • BackwardInvertible
  • BackwardSearch
  • BoundShape
  • ComplexShape
  • EquivalenceClass
  • EquivalenceRelation
  • Fact
  • Facts
  • ForwardInvertible
  • ForwardSearch
  • Goal
  • InvertibleTactic
  • Prover
  • ProvingUnit
  • RuleBasedProver
  • Searcher
  • Shape
  • ShapeIndexedSet
  • Tactic
  • Wildcard
c

info.kwarc.mmt.api.proving

ShapeIndexedSet

class ShapeIndexedSet[A] extends ComplexHashSet[Shape, A]

a hash set using shapes of a certain height as keys

Source
Shape.scala
Linear Supertypes
ComplexHashSet[Shape, A], Set[A], SetLike[A, Set[A]], Cloneable[Set[A]], Cloneable, Cloneable, Shrinkable[A], Builder[A, Set[A]], Growable[A], Clearable, Scriptable[A], Set[A], SetLike[A, Set[A]], Subtractable[A, Set[A]], GenSet[A], GenericSetTemplate[A, Set], GenSetLike[A, Set[A]], (A) ⇒ Boolean, Iterable[A], Iterable[A], IterableLike[A, Set[A]], Equals, GenIterable[A], GenIterableLike[A, Set[A]], Traversable[A], Mutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Set], TraversableLike[A, Set[A]], GenTraversableLike[A, Set[A]], Parallelizable[A, ParSet[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Set[A]], HasNewBuilder[A, scala.collection.mutable.Set[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Known Subclasses
EquivalenceClass
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ShapeIndexedSet
  2. ComplexHashSet
  3. Set
  4. SetLike
  5. Cloneable
  6. Cloneable
  7. Cloneable
  8. Shrinkable
  9. Builder
  10. Growable
  11. Clearable
  12. Scriptable
  13. Set
  14. SetLike
  15. Subtractable
  16. GenSet
  17. GenericSetTemplate
  18. GenSetLike
  19. Function1
  20. Iterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. GenIterable
  25. GenIterableLike
  26. Traversable
  27. Mutable
  28. Traversable
  29. GenTraversable
  30. GenericTraversableTemplate
  31. TraversableLike
  32. GenTraversableLike
  33. Parallelizable
  34. TraversableOnce
  35. GenTraversableOnce
  36. FilterMonadic
  37. HasNewBuilder
  38. AnyRef
  39. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ShapeIndexedSet(levels: Int, key: (A) ⇒ Term)

Type Members

  1. type Self = Set[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[A]): Set[A]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[A]): Set[A]
    Definition Classes
    GenSetLike
  5. def +(elem1: A, elem2: A, elems: A*): Set[A]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  6. def +(elem: A): Set[A]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def ++(xs: GenTraversableOnce[A]): Set[A]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

  8. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[A]): ShapeIndexedSet.this.type
    Definition Classes
    Growable
  12. def +=(a: A): ShapeIndexedSet.this.type
    Definition Classes
    ComplexHashSet → SetLike → Builder → Growable
  13. def +=(elem1: A, elem2: A, elems: A*): ShapeIndexedSet.this.type
    Definition Classes
    Growable
  14. def -(elem1: A, elem2: A, elems: A*): Set[A]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  15. def -(elem: A): Set[A]
    Definition Classes
    SetLike → SetLike → Subtractable → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  16. def --(xs: GenTraversableOnce[A]): Set[A]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

  17. def --=(xs: TraversableOnce[A]): ShapeIndexedSet.this.type
    Definition Classes
    Shrinkable
  18. def -=(a: A): ShapeIndexedSet.this.type
    Definition Classes
    ComplexHashSet → SetLike → Shrinkable
  19. def -=(elem1: A, elem2: A, elems: A*): ShapeIndexedSet.this.type
    Definition Classes
    Shrinkable
  20. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. def add(elem: A): Boolean
    Definition Classes
    SetLike
  24. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  26. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  27. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  29. def apply(elem: A): Boolean
    Definition Classes
    GenSetLike → Function1
  30. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  31. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  32. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  33. def clone(): Set[A]
    Definition Classes
    SetLike → Cloneable → AnyRef
  34. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  36. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  37. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  38. def contains(a: A): Boolean
    Definition Classes
    ComplexHashSet → SetLike → GenSetLike
  39. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  43. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def diff(that: GenSet[A]): Set[A]
    Definition Classes
    SetLike → GenSetLike
  45. def drop(n: Int): Set[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  46. def dropRight(n: Int): Set[A]
    Definition Classes
    IterableLike
  47. def dropWhile(p: (A) ⇒ Boolean): Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def empty: ComplexHashSet[Shape, A]
    Definition Classes
    ComplexHashSet → SetLike → GenericSetTemplate
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  51. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def filter(p: (A) ⇒ Boolean): Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def filterNot(p: (A) ⇒ Boolean): Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  55. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  57. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  58. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  61. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  62. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    ComplexHashSet → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  63. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  64. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  65. def groupBy[K](f: (A) ⇒ K): Map[K, Set[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def grouped(size: Int): Iterator[Set[A]]
    Definition Classes
    IterableLike
  67. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  68. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  69. def head: A
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  70. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def init: Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def inits: Iterator[Set[A]]
    Definition Classes
    TraversableLike
  73. def intersect(that: GenSet[A]): Set[A]
    Definition Classes
    GenSetLike
  74. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  75. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  76. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  77. def iterator: Iterator[A]
    Definition Classes
    ComplexHashSet → GenSetLike → IterableLike → GenIterableLike
  78. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  81. def mapResult[NewTo](f: (Set[A]) ⇒ NewTo): Builder[A, NewTo]
    Definition Classes
    Builder
  82. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  90. def newBuilder: Builder[A, Set[A]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  91. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  93. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  94. def par: ParSet[A]
    Definition Classes
    Parallelizable
  95. def parCombiner: Combiner[A, ParSet[A]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  96. def partition(p: (A) ⇒ Boolean): (Set[A], Set[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  100. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  103. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def remove(elem: A): Boolean
    Definition Classes
    SetLike
  105. def repr: Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def result(): Set[A]
    Definition Classes
    SetLike → Builder
  107. def retain(p: (A) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  108. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  109. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  110. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Set[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  113. def seq: Set[A]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  114. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  116. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  117. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  118. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  119. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  120. def slice(from: Int, until: Int): Set[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  121. def sliding(size: Int, step: Int): Iterator[Set[A]]
    Definition Classes
    IterableLike
  122. def sliding(size: Int): Iterator[Set[A]]
    Definition Classes
    IterableLike
  123. def span(p: (A) ⇒ Boolean): (Set[A], Set[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def splitAt(n: Int): (Set[A], Set[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def stringPrefix: String
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike
  126. def subsetOf(that: GenSet[A]): Boolean
    Definition Classes
    GenSetLike
  127. def subsets(): Iterator[Set[A]]
    Definition Classes
    SetLike
  128. def subsets(len: Int): Iterator[Set[A]]
    Definition Classes
    SetLike
  129. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  131. def tail: Set[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def tails: Iterator[Set[A]]
    Definition Classes
    TraversableLike
  133. def take(n: Int): Set[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  134. def takeRight(n: Int): Set[A]
    Definition Classes
    IterableLike
  135. def takeWhile(p: (A) ⇒ Boolean): Set[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  136. def thisCollection: Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  137. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  138. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  140. def toCollection(repr: Set[A]): Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  141. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  143. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  144. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toSeq: Seq[A]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  147. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  149. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  150. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  151. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  153. def union(that: GenSet[A]): Set[A]
    Definition Classes
    SetLike → GenSetLike
  154. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  155. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  156. def update(elem: A, included: Boolean): Unit
    Definition Classes
    SetLike
  157. def view(from: Int, until: Int): IterableView[A, Set[A]]
    Definition Classes
    IterableLike → TraversableLike
  158. def view: IterableView[A, Set[A]]
    Definition Classes
    IterableLike → TraversableLike
  159. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  160. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  161. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  162. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Set[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  163. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  164. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  165. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Set[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  166. def |(that: GenSet[A]): Set[A]
    Definition Classes
    GenSetLike

Deprecated Value Members

  1. def <<(cmd: scala.collection.script.Message[A]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

Inherited from ComplexHashSet[Shape, A]

Inherited from Set[A]

Inherited from SetLike[A, Set[A]]

Inherited from Cloneable[Set[A]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, Set[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, Set[A]]

Inherited from Subtractable[A, Set[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, Set]

Inherited from GenSetLike[A, Set[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, Set[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, Set[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Set]

Inherited from TraversableLike[A, Set[A]]

Inherited from GenTraversableLike[A, Set[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, Set[A]]

Inherited from HasNewBuilder[A, scala.collection.mutable.Set[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped