com.nicta.scoobi.core

Reduction

object Reduction extends Reductions

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

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. object Product

    Reductions that perform multiplication.

  7. object Sum

    Reductions that perform addition.

  8. def and: Reduction[Boolean]

    A reduction that takes the conjunction of its two arguments.

    A reduction that takes the conjunction of its two arguments.

    Definition Classes
    Reductions
  9. def apply[A](f: (A, A) ⇒ A): Reduction[A]

    Construct a reduction from the given binary operation.

    Construct a reduction from the given binary operation.

    Definition Classes
    Reductions
  10. def array[A](implicit arg0: ClassTag[A]): Reduction[Array[A]]

    A reduction on arrays by appending.

    A reduction on arrays by appending.

    Definition Classes
    Reductions
  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  12. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  13. def comparable[A]: Reduction[Comparable[A]]

    A reduction on comparable values by first looking for 0.

    A reduction on comparable values by first looking for 0.

    Definition Classes
    Reductions
  14. def comparator[A]: Reduction[Comparator[A]]

    A reduction on comparator values by first looking for 0.

    A reduction on comparator values by first looking for 0.

    Definition Classes
    Reductions
  15. def constant[A](a: ⇒ A): Reduction[A]

    Construct a reduction that ignores its argument pair.

    Construct a reduction that ignores its argument pair.

    Definition Classes
    Reductions
  16. def differenceList[A]: Reduction[DList[A]]

    A reduction on difference lists by appending.

    A reduction on difference lists by appending.

    Definition Classes
    Reductions
  17. def endo[A]: Reduction[(A) ⇒ A]

    A reduction that composes two functions.

    A reduction that composes two functions.

    Definition Classes
    Reductions
  18. def endoE[A]: Reduction[Endo[A]]

    A reduction that composes two endomorphisms.

    A reduction that composes two endomorphisms.

    Definition Classes
    Reductions
  19. def ephemeralStream[A]: Reduction[EphemeralStream[A]]

    A reduction on ephemeral streams by appending.

    A reduction on ephemeral streams by appending.

    Definition Classes
    Reductions
  20. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. def equal[A](r: Reduction[Boolean]): Reduction[Equal[A]]

    Takes a boolean reduction to a reduction on equal instances.

    Takes a boolean reduction to a reduction on equal instances.

    Definition Classes
    Reductions
  22. def equals(arg0: Any): Boolean

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  24. def first[A]: Reduction[A]

    A reduction that returns the first argument.

    A reduction that returns the first argument.

    Definition Classes
    Reductions
  25. def firstOption[A]: Reduction[Option[A]]

    A reduction that tries the first option for Some, otherwise the last.

    A reduction that tries the first option for Some, otherwise the last.

    Definition Classes
    Reductions
  26. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  28. def hashmap[A, B]: Reduction[HashMap[A, B]]

    A reduction on hash maps by appending.

    A reduction on hash maps by appending.

    Definition Classes
    Reductions
  29. def hashset[A]: Reduction[HashSet[A]]

    A reduction on hash sets by appending.

    A reduction on hash sets by appending.

    Definition Classes
    Reductions
  30. def intmap[A]: Reduction[IntMap[A]]

    A reduction on int maps by appending.

    A reduction on int maps by appending.

    Definition Classes
    Reductions
  31. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  32. def last[A]: Reduction[A]

    A reduction that returns the last argument.

    A reduction that returns the last argument.

    Definition Classes
    Reductions
  33. def lastOption[A]: Reduction[Option[A]]

    A reduction that tries the last option for Some, otherwise the first.

    A reduction that tries the last option for Some, otherwise the first.

    Definition Classes
    Reductions
  34. def list[A]: Reduction[List[A]]

    A reduction on lists by appending.

    A reduction on lists by appending.

    Definition Classes
    Reductions
  35. def listmap[A, B]: Reduction[ListMap[A, B]]

    A reduction on list maps by appending.

    A reduction on list maps by appending.

    Definition Classes
    Reductions
  36. def listset[A]: Reduction[ListSet[A]]

    A reduction on list sets by appending.

    A reduction on list sets by appending.

    Definition Classes
    Reductions
  37. def longmap[A]: Reduction[LongMap[A]]

    A reduction on long maps by appending.

    A reduction on long maps by appending.

    Definition Classes
    Reductions
  38. def maximum[A](implicit O: Order[A]): Reduction[A]

    A reduction that produces the maximum value of its two arguments.

    A reduction that produces the maximum value of its two arguments.

    Definition Classes
    Reductions
  39. def maximumS[A](implicit O: Ordering[A]): Reduction[A]

    A reduction that produces the maximum value of its two arguments.

    A reduction that produces the maximum value of its two arguments.

    Definition Classes
    Reductions
  40. def minimum[A](implicit O: Order[A]): Reduction[A]

    A reduction that produces the minimum value of its two arguments.

    A reduction that produces the minimum value of its two arguments.

    Definition Classes
    Reductions
  41. def minimumS[A](implicit O: Ordering[A]): Reduction[A]

    A reduction that produces the minimum value of its two arguments.

    A reduction that produces the minimum value of its two arguments.

    Definition Classes
    Reductions
  42. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  43. def nodeseq: Reduction[NodeSeq]

    A reduction on xml node sequences by appending.

    A reduction on xml node sequences by appending.

    Definition Classes
    Reductions
  44. def nonEmptyList[A]: Reduction[NonEmptyList[A]]

    A reduction on non-empty lists by appending.

    A reduction on non-empty lists by appending.

    Definition Classes
    Reductions
  45. final def notify(): Unit

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

    Definition Classes
    AnyRef
  47. def or: Reduction[Boolean]

    A reduction that takes the disjunction of its two arguments.

    A reduction that takes the disjunction of its two arguments.

    Definition Classes
    Reductions
  48. def order[A](r: Reduction[Ordering]): Reduction[Order[A]]

    Takes an ordering reduction to a reduction on order instances.

    Takes an ordering reduction to a reduction on order instances.

    Definition Classes
    Reductions
  49. def ordering: Reduction[Ordering]

    A reduction on ordering (3) values by first looking for EQ.

    A reduction on ordering (3) values by first looking for EQ.

    Definition Classes
    Reductions
  50. def orderingS[A]: Reduction[Ordering[A]]

    A reduction on scala ordering by first looking for 0.

    A reduction on scala ordering by first looking for 0.

    Definition Classes
    Reductions
  51. def queue[A]: Reduction[Queue[A]]

    A reduction on queues by appending.

    A reduction on queues by appending.

    Definition Classes
    Reductions
  52. def semigroup[A](implicit arg0: Semigroup[A]): Reduction[A]

    A reduction on values having a Semigroup instance

    A reduction on values having a Semigroup instance

    Definition Classes
    Reductions
  53. def split1[A](f: (A) ⇒ A): Reduction[A]

    Construct a reduction that applies its first argument to the given function.

    Construct a reduction that applies its first argument to the given function.

    Definition Classes
    Reductions
  54. def split1E[A](e: Endo[A]): Reduction[A]

    Construct a reduction that applies its first argument to the given endomorphism.

    Construct a reduction that applies its first argument to the given endomorphism.

    Definition Classes
    Reductions
  55. def split2[A](f: (A) ⇒ A): Reduction[A]

    Construct a reduction that applies its second argument to the given function.

    Construct a reduction that applies its second argument to the given function.

    Definition Classes
    Reductions
  56. def split2E[A](e: Endo[A]): Reduction[A]

    Construct a reduction that applies its second argument to the given endomorphism.

    Construct a reduction that applies its second argument to the given endomorphism.

    Definition Classes
    Reductions
  57. def stack[A]: Reduction[Stack[A]]

    A reduction on stacks by appending.

    A reduction on stacks by appending.

    Definition Classes
    Reductions
  58. def stream[A]: Reduction[Stream[A]]

    A reduction on streams by appending.

    A reduction on streams by appending.

    Definition Classes
    Reductions
  59. def string: Reduction[String]

    A reduction on strings by appending.

    A reduction on strings by appending.

    Definition Classes
    Reductions
  60. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  61. def toString(): String

    Definition Classes
    AnyRef → Any
  62. def treemap[A, B]: Reduction[TreeMap[A, B]]

    A reduction on tree maps by appending.

    A reduction on tree maps by appending.

    Definition Classes
    Reductions
  63. def treeset[A]: Reduction[TreeSet[A]]

    A reduction on tree sets by appending.

    A reduction on tree sets by appending.

    Definition Classes
    Reductions
  64. def unequal[A](r: Reduction[Boolean]): Reduction[Equal[A]]

    Takes a boolean reduction to a reduction on unequal instances.

    Takes a boolean reduction to a reduction on unequal instances.

    Definition Classes
    Reductions
  65. def unit: Reduction[Unit]

    A reduction that cancels.

    A reduction that cancels.

    Definition Classes
    Reductions
  66. def vector[A]: Reduction[Vector[A]]

    A reduction on vectors by appending.

    A reduction on vectors by appending.

    Definition Classes
    Reductions
  67. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Reductions

Inherited from AnyRef

Inherited from Any

Ungrouped