sealed class IdOps[A] extends AnyRef
- Alphabetic
- By Inheritance
- IdOps
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new IdOps(self: A)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
<|(f: (A) ⇒ Any): A
Alias for
unsafeTap. -
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
??(d: ⇒ A)(implicit ev: <:<[Null, A]): A
Returns
selfif it is non-null, otherwise returnsd. -
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
doWhile(f: (A) ⇒ A, p: (A) ⇒ Boolean): A
Repeatedly apply
f, seeded withself, checking after each iteration whether the predicatepholds. -
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] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
matchOrZero[B](pf: PartialFunction[A, B])(implicit arg0: Monoid[B]): B
- returns
the result of pf(value) if defined, otherwise the Zero element of type B.
-
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 squared: (A, A)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
unsafeTap(f: (A) ⇒ Any): A
Applies
selfto the provide function for its side effect, and returnsself.Applies
selfto the provide function for its side effect, and returnsself. 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
tapcomes 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.unsafebecause it enables side effects. -
def
visit[F[_]](p: PartialFunction[A, F[A]])(implicit arg0: Applicative[F]): F[A]
If the provided partial function is defined for
selfrun this, otherwise liftselfintoFwith the provided scalaz.Applicative. -
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( ... )
-
final
def
whileDo(f: (A) ⇒ A, p: (A) ⇒ Boolean): A
Repeatedly apply
f, seeded withself, checking before each iteration whether the predicatepholds. -
final
def
|>[B](f: (A) ⇒ B): B
Applies
selfto the provided function.Applies
selfto the provided function. The Thrush combinator. -
final
def
▹[B](f: (A) ⇒ B): B
Applies
selfto the provided function.Applies
selfto the provided function. The Thrush combinator. -
final
def
◃(f: (A) ⇒ Any): A
Alias for
unsafeTap.