o

# Util 

#### object Util

Source
Util.scala
Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. Util
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### 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. def aggToFold[A, B, C](agg: MonoidAggregator[A, B, C]): Fold[A, C]

And a helper function that will let me test this out with monoid aggregators, like the ones I wrote to walk trajectories.

5. def allMaxBy[A, B](as: Set[A])(f: (A) ⇒ B)(implicit arg0: Ordering[B]): Set[A]
6. final def asInstanceOf[T0]: T0
Definition Classes
Any
7. def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
8. def confine[A](a: A, min: A, max: A)(implicit ord: Ordering[A]): A
9. def diff[A](as: TraversableOnce[A], lf: (A) ⇒ Double, rf: (A) ⇒ Double, combine: (Double, Double) ⇒ Double): Double

Accumulates differences between the two for every A in the supplied sequence.

Accumulates differences between the two for every A in the supplied sequence. The combine function is used to aggregate the differences.

I recommend using max or +.

10. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
11. def equals(arg0: Any): Boolean
Definition Classes
AnyRef → Any
12. def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
13. def foldUntilM[M[_], A, B, C](init: A, fold: Fold[B, C])(f: (A) ⇒ M[(A, B)])(p: (A) ⇒ Boolean)(implicit M: Monad[M]): M[(A, C)]

A version of iterateUntilM that uses a Fold to store the auxiliary results kicked out by the step function.

14. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
15. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()

Cats helpers.

17. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
18. def iterateM[M[_], A](n: Int)(a: A)(f: (A) ⇒ M[A])(implicit M: Monad[M]): M[A]
19. def iterateUntilM[M[_], A, B, C, D](init: A, agg: MonoidAggregator[B, C, D])(f: (A) ⇒ M[(A, B)])(p: (A) ⇒ Boolean)(implicit M: Monad[M]): M[(A, D)]

A version of iterateUntilM that uses an aggregator to store the auxiliary results kicked out by the step function.

20. def iterateWhileM[M[_], A, B, C, D](init: A, agg: MonoidAggregator[B, C, D])(f: (A) ⇒ M[(A, B)])(p: (A) ⇒ Boolean)(implicit arg0: Monad[M]): M[(A, D)]

A version of iterateWhileM that uses an aggregator to store the auxiliary results kicked out by the step function.

21. def makeMap[K, V](keys: Set[K])(f: (K) ⇒ V): Map[K, V]
22. def makeMapUnsafe[K, V](keys: TraversableOnce[K])(f: (K) ⇒ V): Map[K, V]
23. def maxKeys[A, B](m: Map[A, B])(implicit arg0: Ordering[B]): Set[A]
24. def mergeV[K, V](m: Map[K, V], k: K, delta: V)(implicit arg0: Semigroup[V]): Map[K, V]
26. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
27. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
28. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
29. def runUntilM[M[_], S, A, B, C](state: StateT[M, S, A], agg: MonoidAggregator[A, B, C])(p: (S) ⇒ Boolean)(implicit arg0: Monad[M]): StateT[M, S, C]

Unused for now...

Unused for now... TODO try this out, get the interface going in state monad style!

30. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
31. def toString(): String
Definition Classes
AnyRef → Any
32. def updateWith[K, V](m: Map[K, V], k: K)(f: (Option[V]) ⇒ V): Map[K, V]

Update the key in the supplied map using the function - the function handles both cases, when the item is there and when it's not.

33. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
34. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
35. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
36. object