com.nicta.scoobi.core

Reduction

Related Docs: object Reduction | package core

trait Reduction[A] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Reduction
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class Associative extends AnyRef

    Encodes the associative law that reductions may satisfy.

Abstract Value Members

  1. abstract val reduce: (A, A) ⇒ A

    The binary operation.

Concrete Value Members

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. def ***[B](r: Reduction[B]): Reduction[(A, B)]

    Takes a pair of reductions to a reduction on pairs.

    Takes a pair of reductions to a reduction on pairs. Alias for zip.

  4. def -\(a1: A, a2: A): A

    The binary operation.

    The binary operation. Alias for apply.

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

    Definition Classes
    AnyRef → Any
  6. def apply: Apply[[a]A]

    Lift a reduction to an applicative environment.

  7. def apply(a1: A, a2: A): A

    The binary operation.

    The binary operation. Alias for -\.

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def associative: Associative

  10. def biject[B](b: scalaz.BijectionT.Bijection[A, B]): Reduction[B]

    Maps a bijection on a reduction to produce a function.

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def compose: Compose[[a, b]A]

    Lift a reduction to a composition of functors.

  13. def dual: Reduction[A]

    Swaps the arguments to the binary operation.

    Swaps the arguments to the binary operation. Alias for unary_~.

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

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  20. def left[B](r: ⇒ Reduction[B]): Reduction[\/[A, B]]

    Takes a pair of reductions to a reduction on a disjunction with left (A) bias.

  21. def lift[F[_]](implicit A: Apply[F]): Reduction[F[A]]

    Lifts this reduction to a reduction with an environment.

  22. def mapIn(g: (A) ⇒ A): Reduction[A]

    Maps a function on the inputs to a reduction to produce a reduction.

  23. def mapOut(f: (A) ⇒ A): Reduction[A]

    Maps a function on the output of a reduction to produce a reduction.

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

    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  27. def on(f: (A) ⇒ A): Reduction[A]

    Maps a function on the inputs and output of a reduction to produce a function.

  28. def option: Reduction[Option[A]]

    Takes a reduction and produces a reduction on Option, taking as many Some values as possible.

  29. def pair: (A) ⇒ A

    Return a unary operation that applies to both sides of the binary operation.

  30. def pairE: Endo[A]

    Return a unary operation that applies to both sides of the binary operation as an endomorphism.

  31. def pointwise[B]: Reduction[(B) ⇒ A]

    Takes a reduction to a reduction on a unary function.

  32. def pointwise2[B, C]: Reduction[(B, C) ⇒ A]

    Takes a reduction to a reduction on a binary function.

  33. def pointwise2C[Q[+_], B, C]: Reduction[Cokleisli[Q, (B, C), A]]

    Takes a reduction to a reduction on a binary function with an environment (Q) in argument position.

  34. def pointwise2K[Q[_], B, C](implicit A: Apply[Q]): Reduction[Kleisli[Q, (B, C), A]]

    Takes a reduction to a reduction on a binary function with an environment (Q) in return position.

  35. def pointwise3[B, C, D]: Reduction[(B, C, D) ⇒ A]

    Takes a reduction to a reduction on a ternary function.

  36. def pointwise3C[Q[+_], B, C, D]: Reduction[Cokleisli[Q, (B, C, D), A]]

    Takes a reduction to a reduction on a ternary function with an environment (Q) in argument position.

  37. def pointwise3K[Q[_], B, C, D](implicit A: Apply[Q]): Reduction[Kleisli[Q, (B, C, D), A]]

    Takes a reduction to a reduction on a ternary function with an environment (Q) in return position.

  38. def pointwise4[B, C, D, E]: Reduction[(B, C, D, E) ⇒ A]

    Takes a reduction to a reduction on an arity-4 function.

  39. def pointwise4C[Q[+_], B, C, D, E]: Reduction[Cokleisli[Q, (B, C, D, E), A]]

    Takes a reduction to a reduction on an arity-4 function with an environment (Q) in argument position.

  40. def pointwise4K[Q[_], B, C, D, E](implicit A: Apply[Q]): Reduction[Kleisli[Q, (B, C, D, E), A]]

    Takes a reduction to a reduction on an arity-4 function with an environment (Q) in return position.

  41. def pointwise5[B, C, D, E, F]: Reduction[(B, C, D, E, F) ⇒ A]

    Takes a reduction to a reduction on an arity-5 function.

  42. def pointwise5C[Q[+_], B, C, D, E, F]: Reduction[Cokleisli[Q, (B, C, D, E, F), A]]

    Takes a reduction to a reduction on an arity-5 function with an environment (Q) in argument position.

  43. def pointwise5K[Q[_], B, C, D, E, F](implicit A: Apply[Q]): Reduction[Kleisli[Q, (B, C, D, E, F), A]]

    Takes a reduction to a reduction on an arity-5 function with an environment (Q) in return position.

  44. def pointwiseC[Q[+_], B]: Reduction[Cokleisli[Q, B, A]]

    Takes a reduction to a reduction on a unary function with an environment (Q) in argument position.

  45. def pointwiseK[Q[_], B](implicit A: Apply[Q]): Reduction[Kleisli[Q, B, A]]

    Takes a reduction to a reduction on a unary function in an environment (Q).

  46. def reduceC: (A) ⇒ (A) ⇒ A

    The binary operation in curried form.

  47. def right[B](r: ⇒ Reduction[B]): Reduction[\/[A, B]]

    Takes a pair of reductions to a reduction on a disjunction with right (B) bias.

  48. def semigroup: Semigroup[A]

    Takes a reduction to a scalaz semigroup.

  49. def state[S]: Reduction[State[S, A]]

    Takes a reduction to a reduction on state.

  50. def store[B](r: Reduction[B]): Reduction[Store[A, B]]

    Takes a pair of reductions to a reduction on store (comonad).

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

    Definition Classes
    AnyRef
  52. def toString(): String

    Definition Classes
    AnyRef → Any
  53. def unary_~: Reduction[A]

    Swaps the arguments to the binary operation.

    Swaps the arguments to the binary operation. Alias for dual.

  54. def validation[B](b: Reduction[B]): Reduction[Validation[A, B]]

    Takes a reduction to a reduction on validation values with bias on success.

  55. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  57. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  58. def writer[W](implicit arg0: Semigroup[W]): Reduction[Writer[W, A]]

    Takes a reduction to a reduction on writer.

  59. def wzip[W](implicit S: Semigroup[W]): Reduction[(W, A)]

    Takes a reduction and a semigroup to a reduction on pairs.

  60. def wzip3[W, X](implicit SW: Semigroup[W], SX: Semigroup[X]): Reduction[(W, X, A)]

    Takes a reduction and two semigroups to a reduction on tuple-3.

  61. def wzip4[W, X, Y](implicit SW: Semigroup[W], SX: Semigroup[X], SY: Semigroup[Y]): Reduction[(W, X, Y, A)]

    Takes a reduction and three semigroups to a reduction on tuple-4.

  62. def wzip5[W, X, Y, Z](implicit SW: Semigroup[W], SX: Semigroup[X], SY: Semigroup[Y], SZ: Semigroup[Z]): Reduction[(W, X, Y, Z, A)]

    Takes a reduction and four semigroups to a reduction on tuple-5.

  63. def xmap[B](f: (A) ⇒ B, g: (B) ⇒ A): Reduction[B]

    Maps a pair of functions on a reduction to produce a reduction.

  64. def zip[B](r: Reduction[B]): Reduction[(A, B)]

    Takes a pair of reductions to a reduction on pairs.

    Takes a pair of reductions to a reduction on pairs. Alias for ***.

  65. def zip3[B, C](b: Reduction[B], c: Reduction[C]): Reduction[(A, B, C)]

    Takes three reductions to a reduction on tuple-3.

  66. def zip4[B, C, D](b: Reduction[B], c: Reduction[C], d: Reduction[D]): Reduction[(A, B, C, D)]

    Takes four reductions to a reduction on tuple-4.

  67. def zip5[B, C, D, E](b: Reduction[B], c: Reduction[C], d: Reduction[D], e: Reduction[E]): Reduction[(A, B, C, D, E)]

    Takes five reductions to a reduction on tuple-5.

  68. def zip6[B, C, D, E, F](b: Reduction[B], c: Reduction[C], d: Reduction[D], e: Reduction[E], f: Reduction[F]): Reduction[(A, B, C, D, E, F)]

    Takes six reductions to a reduction on tuple-6.

  69. def zip7[B, C, D, E, F, G](b: Reduction[B], c: Reduction[C], d: Reduction[D], e: Reduction[E], f: Reduction[F], g: Reduction[G]): Reduction[(A, B, C, D, E, F, G)]

    Takes seven reductions to a reduction on tuple-7.

  70. def zip8[B, C, D, E, F, G, H](b: Reduction[B], c: Reduction[C], d: Reduction[D], e: Reduction[E], f: Reduction[F], g: Reduction[G], h: Reduction[H]): Reduction[(A, B, C, D, E, F, G, H)]

    Takes eight reductions to a reduction on tuple-8.

Inherited from AnyRef

Inherited from Any

Ungrouped