Reduction

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. object Product

   

   Reductions that perform multiplication.

5. object Sum

   

   Reductions that perform addition.

6. def and: Reduction[Boolean]

   

   A reduction that takes the conjunction of its two arguments.

7. def apply[A](f: (A, A) ⇒ A): Reduction[A]

   

   Construct a reduction from the given binary operation.

8. def array[A](implicit arg0: ClassTag[A]): Reduction[Array[A]]

   

   A reduction on arrays by appending.

9. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

11. def comparable[A]: Reduction[Comparable[A]]

    

    A reduction on comparable values by first looking for 0.

12. def comparator[A]: Reduction[Comparator[A]]

    

    A reduction on comparator values by first looking for 0.

13. def constant[A](a: ⇒ A): Reduction[A]

    

    Construct a reduction that ignores its argument pair.

14. def differenceList[A]: Reduction[DList[A]]

    

    A reduction on difference lists by appending.

15. def endo[A]: Reduction[(A) ⇒ A]

    

    A reduction that composes two functions.

16. def endoE[A]: Reduction[Endo[A]]

    

    A reduction that composes two endomorphisms.

17. def ephemeralStream[A]: Reduction[EphemeralStream[A]]

    

    A reduction on ephemeral streams by appending.

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

    

    Definition Classes

    AnyRef

19. def equal[A](r: Reduction[Boolean]): Reduction[Equal[A]]

    

    Takes a boolean reduction to a reduction on equal instances.

20. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

21. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

22. def first[A]: Reduction[A]

    

    A reduction that returns the first argument.

23. def firstOption[A]: Reduction[Option[A]]

    

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

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

    

    Definition Classes

    AnyRef → Any

25. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

26. def hashmap[A, B]: Reduction[HashMap[A, B]]

    

    A reduction on hash maps by appending.

27. def hashset[A]: Reduction[HashSet[A]]

    

    A reduction on hash sets by appending.

28. def intmap[A]: Reduction[IntMap[A]]

    

    A reduction on int maps by appending.

29. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

30. def last[A]: Reduction[A]

    

    A reduction that returns the last argument.

31. def lastOption[A]: Reduction[Option[A]]

    

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

32. def list[A]: Reduction[List[A]]

    

    A reduction on lists by appending.

33. def listmap[A, B]: Reduction[ListMap[A, B]]

    

    A reduction on list maps by appending.

34. def listset[A]: Reduction[ListSet[A]]

    

    A reduction on list sets by appending.

35. def longmap[A]: Reduction[LongMap[A]]

    

    A reduction on long maps by appending.

36. def maximum[A](implicit O: Order[A]): Reduction[A]

    

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

37. def maximumS[A](implicit O: Ordering[A]): Reduction[A]

    

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

38. def minimum[A](implicit O: Order[A]): Reduction[A]

    

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

39. def minimumS[A](implicit O: Ordering[A]): Reduction[A]

    

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

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

    

    Definition Classes

    AnyRef

41. def nodeseq: Reduction[NodeSeq]

    

    A reduction on xml node sequences by appending.

42. def nonEmptyList[A]: Reduction[NonEmptyList[A]]

    

    A reduction on non-empty lists by appending.

43. final def notify(): Unit

    

    Definition Classes

    AnyRef

44. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

45. def or: Reduction[Boolean]

    

    A reduction that takes the disjunction of its two arguments.

46. def order[A](r: Reduction[Ordering]): Reduction[Order[A]]

    

    Takes an ordering reduction to a reduction on order instances.

47. def ordering: Reduction[Ordering]

    

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

48. def orderingS[A]: Reduction[Ordering[A]]

    

    A reduction on scala ordering by first looking for 0.

49. def queue[A]: Reduction[Queue[A]]

    

    A reduction on queues by appending.

50. def semigroup[A](implicit arg0: Semigroup[A]): Reduction[A]

    

    A reduction on values having a Semigroup instance

51. def split1[A](f: (A) ⇒ A): Reduction[A]

    

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

52. def split1E[A](e: Endo[A]): Reduction[A]

    

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

53. def split2[A](f: (A) ⇒ A): Reduction[A]

    

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

54. def split2E[A](e: Endo[A]): Reduction[A]

    

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

55. def stream[A]: Reduction[Stream[A]]

    

    A reduction on streams by appending.

56. def string: Reduction[String]

    

    A reduction on strings by appending.

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

    

    Definition Classes

    AnyRef

58. def toString(): String

    

    Definition Classes

    AnyRef → Any

59. def treemap[A, B]: Reduction[TreeMap[A, B]]

    

    A reduction on tree maps by appending.

60. def treeset[A]: Reduction[TreeSet[A]]

    

    A reduction on tree sets by appending.

61. def unequal[A](r: Reduction[Boolean]): Reduction[Equal[A]]

    

    Takes a boolean reduction to a reduction on unequal instances.

62. def unit: Reduction[Unit]

    

    A reduction that cancels.

63. def vector[A]: Reduction[Vector[A]]

    

    A reduction on vectors by appending.

64. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )