IdOps

Value Members

1. final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   Definition Classes

   AnyRef → Any

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

   Alias for unsafeTap.

4. final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

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

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

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. 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.

9. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    Definition Classes

    AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    returns

    the result of pf(value) if defined, otherwise the the Zero element of type B.

16. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

17. final def notify(): Unit

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    Definition Classes

    AnyRef

19. final def squared: (A, A)

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

    Definition Classes

    AnyRef

21. def toString(): String

    Definition Classes

    AnyRef → Any

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

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

    Applies self to the provide function for its side effect, and returns self. The Kestrel combinator. Mostly for use with dodgy libraries that give you values that need additional initialization or mutation before they're valid to use.

    The name tap comes from the Ruby method: http://ruby-doc.org/core-2.0.0/Object.html#method-i-tap which allows you to "tap into" a method call chain, in order to perform operations on intermediate results within the chain. unsafe because it enables side effects.

23. 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.

24. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. 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.

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

    Applies self to the provided function.

    Applies self to the provided function. The Thrush combinator.

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

    Applies self to the provided function.

    Applies self to the provided function. The Thrush combinator.

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

    Alias for unsafeTap.