Object

quasar.precog.util.ByteBufferPool

ByteBufferPoolMonad

Related Doc: package ByteBufferPool

Permalink

implicit object ByteBufferPoolMonad extends ByteBufferMonad[ByteBufferPoolS] with Monad[ByteBufferPoolS]

Linear Supertypes
ByteBufferMonad[ByteBufferPoolS], Monad[ByteBufferPoolS], Bind[ByteBufferPoolS], BindParent[ByteBufferPoolS], Applicative[ByteBufferPoolS], ApplicativeParent[ByteBufferPoolS], Apply[ByteBufferPoolS], ApplyParent[ByteBufferPoolS], Functor[ByteBufferPoolS], InvariantFunctor[ByteBufferPoolS], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ByteBufferPoolMonad
  2. ByteBufferMonad
  3. Monad
  4. Bind
  5. BindParent
  6. Applicative
  7. ApplicativeParent
  8. Apply
  9. ApplyParent
  10. Functor
  11. InvariantFunctor
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Permalink
    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Permalink
    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Permalink
    Definition Classes
    Bind

  4. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  5. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

  6. trait MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw

    Permalink
    Definition Classes
    Monad

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. def ap[A, B](fa: ⇒ ByteBufferPoolS[A])(f: ⇒ ByteBufferPoolS[(A) ⇒ B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Bind → Apply

  5. def ap2[A, B, C](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B])(f: ByteBufferPoolS[(A, B) ⇒ C]): ByteBufferPoolS[C]

    Permalink
    Definition Classes
    Apply

  6. def ap3[A, B, C, D](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C])(f: ByteBufferPoolS[(A, B, C) ⇒ D]): ByteBufferPoolS[D]

    Permalink
    Definition Classes
    Apply

  7. def ap4[A, B, C, D, E](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D])(f: ByteBufferPoolS[(A, B, C, D) ⇒ E]): ByteBufferPoolS[E]

    Permalink
    Definition Classes
    Apply

  8. def ap5[A, B, C, D, E, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E])(f: ByteBufferPoolS[(A, B, C, D, E) ⇒ R]): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  9. def ap6[A, B, C, D, E, FF, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF])(f: ByteBufferPoolS[(A, B, C, D, E, FF) ⇒ R]): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  10. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G])(f: ByteBufferPoolS[(A, B, C, D, E, FF, G) ⇒ R]): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  11. def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H])(f: ByteBufferPoolS[(A, B, C, D, E, FF, G, H) ⇒ R]): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  12. def apF[A, B](f: ⇒ ByteBufferPoolS[(A) ⇒ B]): (ByteBufferPoolS[A]) ⇒ ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Apply

  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

  14. val applicativeSyntax: ApplicativeSyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    Applicative

  15. def apply[A, B](fa: ByteBufferPoolS[A])(f: (A) ⇒ B): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Functor

  16. def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H], fi: ⇒ ByteBufferPoolS[I], fj: ⇒ ByteBufferPoolS[J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  17. def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H], fi: ⇒ ByteBufferPoolS[I], fj: ⇒ ByteBufferPoolS[J], fk: ⇒ ByteBufferPoolS[K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  18. def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H], fi: ⇒ ByteBufferPoolS[I], fj: ⇒ ByteBufferPoolS[J], fk: ⇒ ByteBufferPoolS[K], fl: ⇒ ByteBufferPoolS[L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  19. def apply2[A, B, C](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B])(f: (A, B) ⇒ C): ByteBufferPoolS[C]

    Permalink
    Definition Classes
    Applicative → Apply

  20. def apply3[A, B, C, D](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C])(f: (A, B, C) ⇒ D): ByteBufferPoolS[D]

    Permalink
    Definition Classes
    Apply

  21. def apply4[A, B, C, D, E](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D])(f: (A, B, C, D) ⇒ E): ByteBufferPoolS[E]

    Permalink
    Definition Classes
    Apply

  22. def apply5[A, B, C, D, E, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E])(f: (A, B, C, D, E) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  23. def apply6[A, B, C, D, E, FF, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF])(f: (A, B, C, D, E, FF) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  24. def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G])(f: (A, B, C, D, E, FF, G) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  25. def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  26. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E], ff: ⇒ ByteBufferPoolS[FF], fg: ⇒ ByteBufferPoolS[G], fh: ⇒ ByteBufferPoolS[H], fi: ⇒ ByteBufferPoolS[I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  27. def applyApplicative: Applicative[[α]\/[ByteBufferPoolS[α], α]]

    Permalink
    Definition Classes
    Apply

  28. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

  29. val applySyntax: ApplySyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    Apply

  30. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  31. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]ByteBufferPoolS[G[α, β]]]

    Permalink
    Definition Classes
    Functor

  32. def bind[A, B](fa: ByteBufferPoolS[A])(f: (A) ⇒ ByteBufferPoolS[B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    ByteBufferPoolMonad → Bind

  33. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  34. val bindSyntax: BindSyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    Bind

  35. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  36. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]ByteBufferPoolS[G[α]]]

    Permalink
    Definition Classes
    Applicative

  37. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]ByteBufferPoolS[G[α]]]

    Permalink
    Definition Classes
    Apply

  38. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]ByteBufferPoolS[G[α]]]

    Permalink
    Definition Classes
    Functor

  39. def counzip[A, B](a: \/[ByteBufferPoolS[A], ByteBufferPoolS[B]]): ByteBufferPoolS[\/[A, B]]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  41. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  42. def filterM[A](l: List[A])(f: (A) ⇒ ByteBufferPoolS[Boolean]): ByteBufferPoolS[List[A]]

    Permalink
    Definition Classes
    Applicative

  43. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  44. def flip: Applicative[ByteBufferPoolS]

    Permalink
    Definition Classes
    Applicative → ApplicativeParent

  45. def forever[A, B](fa: ByteBufferPoolS[A]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Bind → BindParent

  46. def fpair[A](fa: ByteBufferPoolS[A]): ByteBufferPoolS[(A, A)]

    Permalink
    Definition Classes
    Functor

  47. def fproduct[A, B](fa: ByteBufferPoolS[A])(f: (A) ⇒ B): ByteBufferPoolS[(A, B)]

    Permalink
    Definition Classes
    Functor

  48. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  49. val functorSyntax: FunctorSyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    Functor

  50. def getBuffer(min: Int): ByteBufferPoolS[ByteBuffer]

    Permalink
    Definition Classes
    ByteBufferPoolMonad → ByteBufferMonad

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

    Permalink
    Definition Classes
    AnyRef → Any

  52. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  53. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]ByteBufferPoolS[G[α]]]

    Permalink
    Definition Classes
    Functor

  54. def ifM[B](value: ByteBufferPoolS[Boolean], ifTrue: ⇒ ByteBufferPoolS[B], ifFalse: ⇒ ByteBufferPoolS[B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Bind

  55. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  56. val invariantFunctorSyntax: InvariantFunctorSyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    InvariantFunctor

  57. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  58. def iterateUntil[A](f: ByteBufferPoolS[A])(p: (A) ⇒ Boolean): ByteBufferPoolS[A]

    Permalink
    Definition Classes
    Monad

  59. def iterateWhile[A](f: ByteBufferPoolS[A])(p: (A) ⇒ Boolean): ByteBufferPoolS[A]

    Permalink
    Definition Classes
    Monad

  60. def join[A](ffa: ByteBufferPoolS[ByteBufferPoolS[A]]): ByteBufferPoolS[A]

    Permalink
    Definition Classes
    Bind

  61. def lift[A, B](f: (A) ⇒ B): (ByteBufferPoolS[A]) ⇒ ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Functor

  62. def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G], ByteBufferPoolS[H], ByteBufferPoolS[I], ByteBufferPoolS[J]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  63. def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G], ByteBufferPoolS[H], ByteBufferPoolS[I], ByteBufferPoolS[J], ByteBufferPoolS[K]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  64. def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G], ByteBufferPoolS[H], ByteBufferPoolS[I], ByteBufferPoolS[J], ByteBufferPoolS[K], ByteBufferPoolS[L]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  65. def lift2[A, B, C](f: (A, B) ⇒ C): (ByteBufferPoolS[A], ByteBufferPoolS[B]) ⇒ ByteBufferPoolS[C]

    Permalink
    Definition Classes
    Apply

  66. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C]) ⇒ ByteBufferPoolS[D]

    Permalink
    Definition Classes
    Apply

  67. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D]) ⇒ ByteBufferPoolS[E]

    Permalink
    Definition Classes
    Apply

  68. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  69. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  70. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  71. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G], ByteBufferPoolS[H]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  72. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (ByteBufferPoolS[A], ByteBufferPoolS[B], ByteBufferPoolS[C], ByteBufferPoolS[D], ByteBufferPoolS[E], ByteBufferPoolS[FF], ByteBufferPoolS[G], ByteBufferPoolS[H], ByteBufferPoolS[I]) ⇒ ByteBufferPoolS[R]

    Permalink
    Definition Classes
    Apply

  73. def map[A, B](fa: ByteBufferPoolS[A])(f: (A) ⇒ B): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Monad → Applicative → Functor

  74. def mapply[A, B](a: A)(f: ByteBufferPoolS[(A) ⇒ B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Functor

  75. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  76. val monadSyntax: MonadSyntax[ByteBufferPoolS]

    Permalink
    Definition Classes
    Monad

  77. def mproduct[A, B](fa: ByteBufferPoolS[A])(f: (A) ⇒ ByteBufferPoolS[B]): ByteBufferPoolS[(A, B)]

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    AnyRef

  79. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  80. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  81. def point[A](a: ⇒ A): ByteBufferPoolS[A]

    Permalink
    Definition Classes
    ByteBufferPoolMonad → Applicative

  82. def product[G[_]](implicit G0: Monad[G]): Monad[[α](ByteBufferPoolS[α], G[α])]

    Permalink
    Definition Classes
    Monad

  83. def product[G[_]](implicit G0: Bind[G]): Bind[[α](ByteBufferPoolS[α], G[α])]

    Permalink
    Definition Classes
    Bind

  84. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](ByteBufferPoolS[α], G[α])]

    Permalink
    Definition Classes
    Applicative

  85. def product[G[_]](implicit G0: Apply[G]): Apply[[α](ByteBufferPoolS[α], G[α])]

    Permalink
    Definition Classes
    Apply

  86. def product[G[_]](implicit G0: Functor[G]): Functor[[α](ByteBufferPoolS[α], G[α])]

    Permalink
    Definition Classes
    Functor

  87. final def pure[A](a: ⇒ A): ByteBufferPoolS[A]

    Permalink
    Definition Classes
    Applicative

  88. def replicateM[A](n: Int, fa: ByteBufferPoolS[A]): ByteBufferPoolS[List[A]]

    Permalink
    Definition Classes
    Applicative

  89. def replicateM_[A](n: Int, fa: ByteBufferPoolS[A]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Applicative

  90. def sequence[A, G[_]](as: G[ByteBufferPoolS[A]])(implicit arg0: Traverse[G]): ByteBufferPoolS[G[A]]

    Permalink
    Definition Classes
    Applicative

  91. def sequence1[A, G[_]](as: G[ByteBufferPoolS[A]])(implicit arg0: Traverse1[G]): ByteBufferPoolS[G[A]]

    Permalink
    Definition Classes
    Apply

  92. def strengthL[A, B](a: A, f: ByteBufferPoolS[B]): ByteBufferPoolS[(A, B)]

    Permalink
    Definition Classes
    Functor

  93. def strengthR[A, B](f: ByteBufferPoolS[A], b: B): ByteBufferPoolS[(A, B)]

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef

  95. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  96. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ ByteBufferPoolS[B])(implicit G: Traverse[G]): ByteBufferPoolS[G[B]]

    Permalink
    Definition Classes
    Applicative

  97. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ ByteBufferPoolS[B])(implicit G: Traverse1[G]): ByteBufferPoolS[G[B]]

    Permalink
    Definition Classes
    Apply

  98. def tuple2[A, B](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B]): ByteBufferPoolS[(A, B)]

    Permalink
    Definition Classes
    Apply

  99. def tuple3[A, B, C](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C]): ByteBufferPoolS[(A, B, C)]

    Permalink
    Definition Classes
    Apply

  100. def tuple4[A, B, C, D](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D]): ByteBufferPoolS[(A, B, C, D)]

    Permalink
    Definition Classes
    Apply

  101. def tuple5[A, B, C, D, E](fa: ⇒ ByteBufferPoolS[A], fb: ⇒ ByteBufferPoolS[B], fc: ⇒ ByteBufferPoolS[C], fd: ⇒ ByteBufferPoolS[D], fe: ⇒ ByteBufferPoolS[E]): ByteBufferPoolS[(A, B, C, D, E)]

    Permalink
    Definition Classes
    Apply

  102. def unlessM[A](cond: Boolean)(f: ⇒ ByteBufferPoolS[A]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Applicative

  103. def untilM[G[_], A](f: ByteBufferPoolS[A], cond: ⇒ ByteBufferPoolS[Boolean])(implicit G: MonadPlus[G]): ByteBufferPoolS[G[A]]

    Permalink
    Definition Classes
    Monad

  104. def untilM_[A](f: ByteBufferPoolS[A], cond: ⇒ ByteBufferPoolS[Boolean]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Monad

  105. def void[A](fa: ByteBufferPoolS[A]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Functor

  106. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  109. def whenM[A](cond: Boolean)(f: ⇒ ByteBufferPoolS[A]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Applicative

  110. def whileM[G[_], A](p: ByteBufferPoolS[Boolean], body: ⇒ ByteBufferPoolS[A])(implicit G: MonadPlus[G]): ByteBufferPoolS[G[A]]

    Permalink
    Definition Classes
    Monad

  111. def whileM_[A](p: ByteBufferPoolS[Boolean], body: ⇒ ByteBufferPoolS[A]): ByteBufferPoolS[Unit]

    Permalink
    Definition Classes
    Monad

  112. def widen[A, B](fa: ByteBufferPoolS[A])(implicit ev: <~<[A, B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Functor

  113. def xmap[A, B](fa: ByteBufferPoolS[A], f: (A) ⇒ B, g: (B) ⇒ A): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    Functor → InvariantFunctor

  114. def xmapb[A, B](ma: ByteBufferPoolS[A])(b: Bijection[A, B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    InvariantFunctor

  115. def xmapi[A, B](ma: ByteBufferPoolS[A])(iso: scalaz.Isomorphism.<=>[A, B]): ByteBufferPoolS[B]

    Permalink
    Definition Classes
    InvariantFunctor

Inherited from ByteBufferMonad[ByteBufferPoolS]

Inherited from Monad[ByteBufferPoolS]

Inherited from Bind[ByteBufferPoolS]

Inherited from BindParent[ByteBufferPoolS]

Inherited from Applicative[ByteBufferPoolS]

Inherited from ApplicativeParent[ByteBufferPoolS]

Inherited from Apply[ByteBufferPoolS]

Inherited from ApplyParent[ByteBufferPoolS]

Inherited from Functor[ByteBufferPoolS]

Inherited from InvariantFunctor[ByteBufferPoolS]

Inherited from AnyRef

Inherited from Any

Ungrouped