ReusableFn

A function that facilitates stability and reuse.

In effective usage of React, callbacks are passed around as component properties. Due to the ease of function creation in Scala if it often the case that functions are created inline and thus provide no means of determining whether a component can safely skip its update. This class exists as a solution.

Since: 0.9.0

Linear Supertypes

AbstractFunction1[A, B], (A) ⇒ B, AnyRef, Any

Abstract Value Members

abstract def apply(v1: A): B

Definition Classes
Function1

Concrete 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 andThen[A](g: (B) ⇒ A): (A) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
final def asInstanceOf[T0]: T0

Definition Classes
Any
def asVar(value: A)(implicit r: Reusability[A], ev: =:=[ReusableFn[A, B], ReusableFn[A, Callback]]): ReusableVar[A]
def asVarR(value: A, r: Reusability[A])(implicit ev: =:=[ReusableFn[A, B], ReusableFn[A, Callback]]): ReusableVar[A]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[A](g: (A) ⇒ A): (A) ⇒ B

Definition Classes
Function1
Annotations
@unspecialized()
def contramap[C](f: (C) ⇒ A): ~=>[C, B]
def dimap[C, D](f: ((A) ⇒ B) ⇒ (C) ⇒ D): ~=>[C, D]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fnA(a: A)(implicit ra: Reusability[A]): ReusableFnA[A, B]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def map[C](f: (B) ⇒ C): ~=>[A, C]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
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
@throws( ... )

Related Docs: object ReusableFn | package extra

sealed abstract class ReusableFn[A, B] extends AbstractFunction1[A, B]

Abstract Value Members

abstract def apply(v1: A): B

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[A](g: (B) ⇒ A): (A) ⇒ A

final def asInstanceOf[T0]: T0

def asVar(value: A)(implicit r: Reusability[A], ev: =:=[ReusableFn[A, B], ReusableFn[A, Callback]]): ReusableVar[A]

def asVarR(value: A, r: Reusability[A])(implicit ev: =:=[ReusableFn[A, B], ReusableFn[A, Callback]]): ReusableVar[A]

def clone(): AnyRef

def compose[A](g: (A) ⇒ A): (A) ⇒ B

def contramap[C](f: (C) ⇒ A): ~=>[C, B]

def dimap[C, D](f: ((A) ⇒ B) ⇒ (C) ⇒ D): ~=>[C, D]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fnA(a: A)(implicit ra: Reusability[A]): ReusableFnA[A, B]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[C](f: (B) ⇒ C): ~=>[A, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AbstractFunction1[A, B]

Inherited from (A) ⇒ B

Inherited from AnyRef

Inherited from Any

Ungrouped