mgo.tools

package mgo.tools

Type members

Classlikes

implicit
class ArrayDecorator[A](array: Array[A])
object Breeze
object CanBeNaN
Companion
class
trait CanBeNaN[T]
Companion
object
object EmptyTree extends KDTree
final implicit
class GroupByOrderedImplicitImpl[A](val t: Iterable[A]) extends AnyVal
implicit
class IterableDecorator[A](t: Iterable[A])
implicit
class IteratorDecorator[A](i: Iterator[A])
trait KDTree

KD-Tree algorithm from https://en.wikipedia.org/wiki/Kd-tree 5-5-2014

KD-Tree algorithm from https://en.wikipedia.org/wiki/Kd-tree 5-5-2014

Companion
object
object KDTree
Companion
class
class Lazy[T](t: => T)
Companion
class
Companion
object
implicit
Companion
class
class RejectionSampler(_sample: () => (Vector[Double], Lazy[Double]), val accept: Vector[Double] => Boolean)

Rejection sampler with a predicate and a state.

Rejection sampler with a predicate and a state.

Companion
object
implicit
class ScalaToApacheRng(rng: Random) extends RandomGenerator
implicit
class VectorDecorator[A](xs: Vector[A])
object stats

Types

type Point2D = (Double, Double)

Value members

Concrete methods

def add(x: Vector[Double], y: Vector[Double]): Vector[Double]
def allEquals(i: Iterable[Double], in: Vector[Iterable[Double]]): Boolean
def allTheSame(i1: Vector[Iterable[Double]], i2: Vector[Iterable[Double]]): Boolean
def allTheSameSorted(i1: Vector[Iterable[Double]], i2: Vector[Iterable[Double]]): Boolean
def apacheRandom(random: Random): RandomGenerator
def average(sequence: Vector[Double]): Double
def centroid(e: Vector[Vector[Double]]): Vector[Double]
def clamp(value: Double, min_v: Double, max_v: Double): Double
def euclideanNorm(p1: Point2D, p2: Point2D): Double
def findInterval[A : Ordering](s: Vector[A], v: A): Int
def integral(points: Vector[Point2D]): Double
def isUpper(line1: Point2D, line2: Point2D, c: Point2D): Boolean
def mse(sequence: Vector[Double]): Double
def multinomialDraw[T](s: Vector[(Double, T)], rng: Random): (T, List[(Double, T)])
def randomInt(random: Random, discrete: D): Int
def rndmChoice[T](t1: T, t2: T)(implicit rng: Random): T
def same(i1: Iterable[Double], i2: Iterable[Double]): Boolean
def squareDist(x: Vector[Double], y: Vector[Double]): Double
def surface(a: Double, b: Double, c: Double): Double
def surface(p1: Point2D, p2: Point2D, p3: Point2D): Double
def time[R](label: String, block: => R): (R, Long)

Concrete fields

val epsilon: Double

Implicits

Implicits

final implicit
def ArrayDecorator[A](array: Array[A]): ArrayDecorator[A]
final implicit
final implicit
def IterableDecorator[A](t: Iterable[A]): IterableDecorator[A]
final implicit
def IteratorDecorator[A](i: Iterator[A]): IteratorDecorator[A]
final implicit
final implicit
final implicit
def VectorDecorator[A](xs: Vector[A]): VectorDecorator[A]