|
Scala 2.1.6
|
class
INode
[ A , B ]
extends
scala.collection.immutable.InsertTree[A,B] with
scala.ScalaObject with
scala.CaseClassConstructor Summary | |
def
this
( t1 : scala.collection.immutable.GBTree[A,B] , height : scala.Int , size : scala.Int ) ( view$3 : (A) => scala.Ordered[A] )
|
Def Summary | |
final override
|
def
$tag
: scala.Int
|
protected
|
def
balance_p
( t : scala.collection.immutable.GBTree[A,B] , subtree : scala.collection.immutable.GBTree[A,B] )
: scala.collection.immutable.InsertTree[A,B]
|
final override
|
def
caseArity
: scala.Int
|
final override
|
def
caseElement
( x$1 : scala.Int )
: scala.Any
|
final override
|
def
caseName
: java.lang.String
|
override
|
def
equals
( x$1 : scala.Any )
: scala.Boolean
|
override
|
def
hashCode
: scala.Int
|
def
insertLeft
( key : A , value : B , bigger : scala.collection.immutable.GBTree[A,B] )
: scala.collection.immutable.InsertTree[A,B]
|
|
def
insertRight
( key : A , value : B , smaller : scala.collection.immutable.GBTree[A,B] )
: scala.collection.immutable.InsertTree[A,B]
|
|
def
node
: scala.collection.immutable.GBTree[A,B]
|
|
override
|
def
toString
: java.lang.String
|
Constructor Detail |
def
this
( t1 : scala.collection.immutable.GBTree[A,B] , height : scala.Int , size : scala.Int ) ( view$3 : (A) => scala.Ordered[A] )
Def Detail |
def
$tag
: scala.Int
def
balance_p
( t : scala.collection.immutable.GBTree[A,B] , subtree : scala.collection.immutable.GBTree[A,B] ) : scala.collection.immutable.InsertTree[A,B]
def
caseArity
: scala.Int
def
caseElement
( x$1 : scala.Int ) : scala.Any
def
caseName
: java.lang.String
def
equals
( x$1 : scala.Any ) : scala.Boolean
def
hashCode
: scala.Int
def
insertLeft
( key : A , value : B , bigger : scala.collection.immutable.GBTree[A,B] ) : scala.collection.immutable.InsertTree[A,B]
def
insertRight
( key : A , value : B , smaller : scala.collection.immutable.GBTree[A,B] ) : scala.collection.immutable.InsertTree[A,B]
def
node
: scala.collection.immutable.GBTree[A,B]
def
toString
: java.lang.String