class BaseTypeSeq extends AnyRef
Note: constructor is protected to force everyone to use the factory method newBaseTypeSeq instead. This is necessary because when run from reflection every base type sequence needs to have a SynchronizedBaseTypeSeq as mixin.
- Self Type
- SymbolTable.BaseTypeSeq
- Alphabetic
- By Inheritance
- BaseTypeSeq
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
BaseTypeSeq(parents: List[SymbolTable.Type], elems: Array[SymbolTable.Type])
- Attributes
- protected[scala.reflect]
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(i: Int): SymbolTable.Type
The type at i'th position in this sequence; lazy types are returned evaluated.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def baseTypeIndex(sym: SymbolTable.Symbol): Int
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def copy(head: SymbolTable.Type, offset: Int): SymbolTable.BaseTypeSeq
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def exists(p: (SymbolTable.Type) ⇒ Boolean): Boolean
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lateMap(f: (SymbolTable.Type) ⇒ SymbolTable.Type): SymbolTable.BaseTypeSeq
-
def
length: Int
The number of types in the sequence
-
def
map(f: (SymbolTable.Type) ⇒ SymbolTable.Type): SymbolTable.BaseTypeSeq
Compute new base type sequence where every element is mapped with function
f
.Compute new base type sequence where every element is mapped with function
f
. Lazy types are mapped but not evaluated - lazy val maxDepth: Depth
-
def
maxDepthOfElems: Depth
- Attributes
- protected
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
prepend(tp: SymbolTable.Type): SymbolTable.BaseTypeSeq
Compute new base type sequence with
tp
prepended to this sequence - def rawElem(i: Int): SymbolTable.Type
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toList: List[SymbolTable.Type]
Return all evaluated types in this sequence as a list
-
def
toString(): String
- Definition Classes
- BaseTypeSeq → AnyRef → Any
-
def
typeSymbol(i: Int): SymbolTable.Symbol
The type symbol of the type at i'th position in this sequence
-
def
updateHead(tp: SymbolTable.Type): SymbolTable.BaseTypeSeq
Compute new base type sequence with
tp
replacing the head of this sequence -
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( ... )