| OVERVIEW | PACKAGE | CONSTR | FIELDS | METHODS | FRAMES NO FRAMES | INHERITED |
case class Positive[+ P](val x : P)
extends
Bistate[P, Nothing] with Product
def this(x : P)
|
| negValue |
def negValue
|
None | |
| posValue |
def posValue
|
Some[P] | |
| productArity |
override def productArity
|
Int | |
| productPrefix |
override def productPrefix
|
String |
| != |
final def !=(arg0 : Object)
|
Boolean | AnyRef |
| != |
final def !=(arg0 : Any)
|
Boolean | Any |
| == |
final def ==(arg0 : Any)
|
Boolean | Any |
| == |
final def ==(arg0 : Object)
|
Boolean | AnyRef |
| asInstanceOf |
final def asInstanceOf[T0]
|
T0 | Any |
| clone |
protected def clone
|
Object | AnyRef |
| eq |
final def eq(arg0 : Object)
|
Boolean | AnyRef |
| equals |
override def equals(arg0 : Any)
|
Boolean | |
| finalize |
protected def finalize
|
Unit | AnyRef |
| getClass |
final def getClass
|
Class[Any] | AnyRef |
| hashCode |
override def hashCode
|
Int | |
| isInstanceOf |
final def isInstanceOf[T0]
|
Boolean | Any |
| ne |
final def ne(arg0 : Object)
|
Boolean | AnyRef |
| negFlatmap |
def negFlatmap[A >: P, B](f : (Nothing) => Bistate[A, B])
|
Positive[P] | |
| negMap |
def negMap[A](f : (Nothing) => A)
|
Positive[P] | |
| notify |
final def notify
|
Unit | AnyRef |
| notifyAll |
final def notifyAll
|
Unit | AnyRef |
| posFlatmap |
def posFlatmap[A >: P, B](f : (P) => Bistate[A, B])
|
Bistate[A, B] | |
| posMap |
def posMap[A](f : (P) => A)
|
Positive[A] | |
| productElement |
override def productElement(arg0 : Int)
|
Any | |
| synchronized |
final def synchronized[T0](arg0 : T0)
|
T0 | AnyRef |
| toString |
override def toString
|
String | |
| wait |
final def wait(arg0 : Long, arg1 : Int)
|
Unit | AnyRef |
| wait |
final def wait
|
Unit | AnyRef |
| wait |
final def wait(arg0 : Long)
|
Unit | AnyRef |
| OVERVIEW | PACKAGE | CONSTR | FIELDS | METHODS | FRAMES NO FRAMES | INHERITED |