Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
breeze.stats.hist.scala Maven / Gradle / Ivy
package breeze.stats
import breeze.generic.UFunc
import breeze.macros.expand
import breeze.linalg._
import breeze.linalg.support.{CanTraverseValues, CanZipAndTraverseValues}
import CanTraverseValues.ValuesVisitor
import CanZipAndTraverseValues.PairValuesVisitor
object hist extends UFunc {
trait Histogram[S] {
def hist: DenseVector[S]
def binEdges: DenseVector[Double]
}
private class HistogramImpl[S](val hist: DenseVector[S], start: Double, end: Double, bins: Double) extends Histogram[S] {
lazy val binEdges = DenseVector.rangeD(start, end + ((end-start)/bins), step=((end-start)/bins))
}
@expand
implicit def defaultHist[T, @expand.args(Int, Double, Float, Long) S](implicit iter: CanTraverseValues[T, S]): Impl[T, Histogram[S]] = new Impl[T,Histogram[S]] {
private val innerImpl = implicitly[Impl2[T, Int,Histogram[S]]]
def apply(v: T) = innerImpl.apply(v, 10)
}
@expand
implicit def defaultHistBins[T, @expand.args(Int, Double, Float, Long) S](implicit iter: CanTraverseValues[T, S]): Impl2[T, Int, Histogram[S]] = new Impl2[T,Int,Histogram[S]] {
private val innerImpl = implicitly[Impl3[T, Int, (Double,Double), Histogram[S]]]
def apply(v: T, bins: Int) = {
val minima = min(v).toDouble
val maxima = max(v).toDouble
innerImpl.apply(v, bins, (minima, maxima))
}
}
@expand
implicit def canTraverseValuesImpl[T, @expand.args(Int, Double, Float, Long) S](implicit iter: CanTraverseValues[T, S]): Impl3[T, Int, (Double,Double), Histogram[S]] = new Impl3[T, Int, (Double,Double), Histogram[S]] {
def apply(v: T, bins: Int, range: (Double,Double)): Histogram[S] = {
val (minima, maxima) = range
if (maxima <= minima) {
throw new IllegalArgumentException("Minima of a histogram must not be greater than the maxima")
}
val result = DenseVector.zeros[S](bins)
val visitor = new ValuesVisitor[S] {
def visit(a: S) = {
val ad = a.toDouble
val i: Int = math.floor(bins * ((ad-minima)/(maxima - minima))).toInt
if ((i >= 0) && (i < bins)) {
result(i) += 1
}
if (ad == maxima) { //Include the endpoint
result(bins-1) += 1
}
}
def zeros(numZero: Int, zeroValue: S): Unit = {
val i = math.floor(bins * ((zeroValue.toDouble-minima)/maxima)).toInt
if ((i >= 0) && (i < bins)) {
result(i) += numZero
}
}
}
iter.traverse(v, visitor)
new HistogramImpl(result, minima, maxima, bins)
}
}
@expand
implicit def defaultHistWeights[T, U, @expand.args(Int, Double, Float, Long) S](implicit iter: CanZipAndTraverseValues[T,U,S,S], iter2: CanTraverseValues[T,S]): Impl2[T,U, Histogram[S]] = new Impl2[T,U,Histogram[S]] {
private val innerImpl = implicitly[Impl3[T, Int, U, Histogram[S]]]
def apply(v: T, weights: U) = innerImpl.apply(v, 10, weights)
}
@expand
implicit def defaultHistBinsWeights[T, U, @expand.args(Int, Double, Float, Long) S](implicit iter: CanZipAndTraverseValues[T,U,S,S], iter2: CanTraverseValues[T,S]): Impl3[T, Int, U, Histogram[S]] = new Impl3[T,Int,U, Histogram[S]] {
private val innerImpl = implicitly[Impl4[T, Int, (Double,Double), U, Histogram[S]]]
def apply(v: T, bins: Int, weights: U) = {
val minima = min(v).toDouble
val maxima = max(v).toDouble
innerImpl.apply(v, bins, (minima, maxima), weights)
}
}
@expand
implicit def canTraverseValuesImplWeighted[T, U, @expand.args(Int, Double, Float, Long) S](implicit iter: CanZipAndTraverseValues[T,U,S,S]): Impl4[T, Int, (Double,Double), U, Histogram[S]] = new Impl4[T, Int, (Double,Double), U, Histogram[S]] {
def apply(v: T, bins: Int, range: (Double,Double), weights: U): Histogram[S] = {
val (minima, maxima) = range
if (maxima <= minima) {
throw new IllegalArgumentException("Minima of a histogram must not be greater than the maxima")
}
val result = DenseVector.zeros[S](bins)
val visitor = new PairValuesVisitor[S,S] {
def visit(a: S, w: S) = {
val ad = a.toDouble
val i: Int = math.floor(bins * ((ad-minima)/(maxima - minima))).toInt
if ((i >= 0) && (i < bins)) {
result(i) += w
}
if (ad == maxima) { //Include the endpoint
result(bins-1) += w
}
}
}
iter.traverse(v, weights, visitor)
new HistogramImpl(result, minima, maxima, bins)
}
}
}
