IdOpsDeprecated

final def !=(arg0: Any): Boolean

final def ##(): Int

final def <|(f: (A) ⇒ Any): A

Alias for unsafeTap.

final def ==(arg0: Any): Boolean

final def ??(d: ⇒ A)(implicit ev: <:<[Null, A]): A

Returns self if it is non-null, otherwise returns d.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def doWhile(f: (A) ⇒ A, p: (A) ⇒ Boolean): A

Repeatedly apply f, seeded with self, checking after each iteration whether the predicate p holds.

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

def matchOrZero[B](pf: PartialFunction[A, B])(implicit arg0: Monoid[B]): B

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def squared: (A, A)

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

def toString(): String

final def unsafeTap(f: (A) ⇒ Any): A

Applies self to the provide function for its side effect, and returns self.

def visit[F[_]](p: PartialFunction[A, F[A]])(implicit arg0: Applicative[F]): F[A]

If the provided partial function is defined for self run this, otherwise lift self into F with the provided scalaz.Applicative.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def whileDo(f: (A) ⇒ A, p: (A) ⇒ Boolean): A

Repeatedly apply f, seeded with self, checking before each iteration whether the predicate p holds.

final def |>[B](f: (A) ⇒ B): B

Applies self to the provided function.

final def ▹[B](f: (A) ⇒ B): B

Applies self to the provided function.

final def ◃(f: (A) ⇒ Any): A

Alias for unsafeTap.

def left[B]: \/[A, B]

def right[B]: \/[B, A]

final def wrapNel: NonEmptyList[A]