Object

org.atnos.origami

folds

Related Doc: package origami

Permalink

object folds

List of predefined Folds

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. folds
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 all[A](f: (A) ⇒ Boolean): FoldId[A, Boolean] { ... /* 2 definitions in type refinement */ }

    Permalink

    returns

    return true if the list is empty or if all elements are true, use a Either state to indicate early failure

  5. def any[A](f: (A) ⇒ Boolean): FoldId[A, Boolean] { ... /* 2 definitions in type refinement */ }

    Permalink

    returns

    return false if the list is empty or if all elements are false, use a Either state to indicate early success

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def average[A](implicit f: Fractional[A]): Fold[Id, A, A]

    Permalink

    returns

    the average of all elements

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def const[A, B](b: ⇒ B): Fold[[A]A, A, B] { ... /* 2 definitions in type refinement */ }

    Permalink

    constant fold returning the same value at the end

  10. def count[A]: FoldState[A, Int]

    Permalink

    returns

    fold to count elements

  11. def countLong[A]: FoldState[A, Long]

    Permalink

    returns

    fold to count elements

  12. def countLongOf[A](predicate: (A) ⇒ Boolean): FoldState[A, Long]

    Permalink

    returns

    fold to count elements

  13. def countOf[A](predicate: (A) ⇒ Boolean): FoldState[A, Int]

    Permalink

    returns

    fold to count elements

  14. def countUnique[A]: FoldId[A, Int]

    Permalink

    returns

    fold to count the number of unique elements

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def first[A]: FoldState[A, Option[A]]

    Permalink

    returns

    the first element

  19. def firstN[A](n: Int): FoldId[A, List[A]] { type S = scala.collection.mutable.ListBuffer[A] }

    Permalink

    returns

    the first n elements

  20. def flips[A]: FoldId[A, Int] { type S = Int }

    Permalink

    returns

    the number of times an element changes its value

  21. def flipsLong[A]: FoldId[A, Long] { type S = Long }

    Permalink

    returns

    the number of times an element changes its value

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

    Permalink
    Definition Classes
    AnyRef → Any
  23. def gradient[A, V](implicit arg0: Numeric[A], arg1: Numeric[V]): FoldId[(A, V), Double]

    Permalink

    returns

    gradient of a given variable A, compared to another V

  24. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  26. def last[A]: FoldState[A, Option[A]]

    Permalink

    returns

    the last element

  27. def lastN[A](n: Int): FoldId[A, List[A]] { type S = scala.collection.mutable.ListBuffer[A] }

    Permalink

    returns

    the last n elements

  28. def lift[A, U](f: (A) ⇒ U): Fold[[A]A, A, Option[U]] { ... /* 2 definitions in type refinement */ }

    Permalink

    lift a function to a fold that applies f to the last element

  29. def list[A]: FoldId[A, List[A]]

    Permalink

    returns

    a Fold which simply accumulates elements into a List

  30. def maximum[A](implicit arg0: Ordering[A]): FoldState[A, Option[A]]

    Permalink

    returns

    the minimum element

  31. def mean[N](implicit arg0: Fractional[N]): Fold[Id, N, N] { type S = (N, Int) }

    Permalink

    returns

    the mean of elements

  32. def minimum[A](implicit arg0: Ordering[A]): FoldState[A, Option[A]]

    Permalink

    returns

    the maximum element

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

    Permalink
    Definition Classes
    AnyRef
  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. def onlineStddev[N](implicit arg0: Fractional[N]): Fold[Id, N, (Int, N, Double)]

    Permalink

    returns

    the number of elements, mean and standard deviation

  37. def onlineUnbiasedVariance[N](implicit arg0: Fractional[N]): Fold[Id, N, (Int, N, N)]

    Permalink

    returns

    the number of elements, mean and unbiased variance

  38. def onlineVariance[N](implicit arg0: Fractional[N]): Fold[Id, N, (Int, N, N)]

    Permalink

    returns

    the number of elements, mean and variance

  39. def onlineVariation[N](implicit arg0: Fractional[N]): FoldId[N, (Int, N, N)]

    Permalink

    returns

    the number of elements, mean and variation

  40. def plus[N](implicit arg0: Numeric[N]): FoldState[N, N]

    Permalink

    returns

    a plus fold from a Num

  41. def plusBy[A, N](f: (A) ⇒ N)(implicit arg0: Numeric[N]): Fold[Id, A, N] { type S = N }

    Permalink

    returns

    a plus fold from a mapping to a Num

  42. def proportion[A](predicate: (A) ⇒ Boolean): Fold[Id, A, Double]

    Permalink

    returns

    the proportion of elements satisfying a given predicate

  43. def randomDouble[A]: FoldId[A, Option[Double]] { ... /* 2 definitions in type refinement */ }

    Permalink

    a fold where the current state is a random Double

  44. def randomDoubleWithSeed[A](seed: Long): FoldId[A, Option[Double]] { ... /* 2 definitions in type refinement */ }

    Permalink

    a fold where the current state is a random Double

  45. def randomInt[A]: FoldId[A, Option[Int]] { ... /* 2 definitions in type refinement */ }

    Permalink

    a fold where the current state is a random Int

  46. def randomIntWithSeed[A](seed: Long): FoldId[A, Option[Int]] { ... /* 2 definitions in type refinement */ }

    Permalink

    a fold where the current state is a random Int

  47. def randomWithGeneratorAndFunction[A, R](random: Random, f: (Random) ⇒ R): FoldId[A, Option[R]] { ... /* 2 definitions in type refinement */ }

    Permalink

    create a fold for a mutable Random object

  48. def reservoirSampling[A]: FoldId[A, Option[A]] { ... /* 2 definitions in type refinement */ }

    Permalink

    return an arbitrary streamed element so that each element has the same probability be chosen

  49. def stddev[N](implicit arg0: Fractional[N]): Fold[Id, N, Double]

    Permalink

    returns

    the number of elements, mean and standard deviation

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

    Permalink
    Definition Classes
    AnyRef
  51. def times[N](implicit arg0: Numeric[N]): FoldState[N, N]

    Permalink

    returns

    a times fold from a Num

  52. def timesBy[A, N](f: (A) ⇒ N)(implicit arg0: Numeric[N]): Fold[Id, A, N] { type S = N }

    Permalink

    returns

    a times fold from a mapping to a Num

  53. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  54. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped