case class Node[T](next: Map[Label, DiscrTree[T]]) extends DiscrTree[T] with Product with Serializable
- Source
- indexing.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Node
- Serializable
- Serializable
- Product
- Equals
- DiscrTree
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Node[T], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
elements: Vector[T]
- Definition Classes
- DiscrTree
- def ensuring(cond: (Node[T]) ⇒ Boolean, msg: ⇒ Any): Node[T]
- def ensuring(cond: (Node[T]) ⇒ Boolean): Node[T]
- def ensuring(cond: Boolean, msg: ⇒ Any): Node[T]
- def ensuring(cond: Boolean): Node[T]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
filter(p: (T) ⇒ Boolean): DiscrTree[T]
- Definition Classes
- DiscrTree
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
foreach(f: (T) ⇒ Unit): Unit
- Definition Classes
- DiscrTree
- def formatted(fmtstr: String): String
-
def
generalizations(e: TermString): Vector[T]
- Definition Classes
- DiscrTree
-
def
generalizations(e: Expr): Vector[T]
- Definition Classes
- DiscrTree
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
insert[S >: T](e: TermString, t: S): DiscrTree[S]
- Definition Classes
- DiscrTree
-
def
insert[S >: T](e: Expr, t: S): DiscrTree[S]
- Definition Classes
- DiscrTree
-
def
insert[S >: T](es: Iterable[Expr], t: S): DiscrTree[S]
- Definition Classes
- DiscrTree
-
def
insert[S >: T](es: Iterable[(Expr, S)]): DiscrTree[S]
- Definition Classes
- DiscrTree
-
def
isEmpty: Boolean
- Definition Classes
- DiscrTree
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
jump(n: Int = 1): Vector[DiscrTree[T]]
- Definition Classes
- DiscrTree
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val next: Map[Label, DiscrTree[T]]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
remove[S >: T](t: S): DiscrTree[T]
- Definition Classes
- DiscrTree
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
unifiable(e: TermString): Vector[T]
- Definition Classes
- DiscrTree
-
def
unifiable(e: Expr): Vector[T]
- Definition Classes
- DiscrTree
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def →[B](y: B): (Node[T], B)
This is the API documentation for GAPT.
The main package is gapt.