BinOp

abstract def applySeq(x: A, y: A): R

Called as part of graph interpretation to execute the given binary operation.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(lhs: Scalan.Ref[A], rhs: Scalan.Ref[A]): Scalan.Ref[R]

Builds a new graph node by applying this operation to the given arguments.

def applyLazy(lhs: Scalan.Ref[A], rhs: Scalan.Ref[Scalan.Thunk[A]]): Scalan.Ref[R]

Builds a new graph node by applying this operation to the given arguments.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit val eResult: Scalan.Elem[R]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val opName: String

def shouldPropagate(lhs: A, rhs: A): Boolean

Whether the constants should be propagated through this operations by rewriting.

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