class
CompressedArrayHistogram
extends ArrayHistogram
Instance Constructors
-
new
CompressedArrayHistogram
(counts: Array[Int], total: Int, vmin: Int, vmax: Int)
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
asInstanceOf
[T0]
: T0
-
def
clone
(): AnyRef
-
def
compress
(i: Int): Int
-
-
def
countItem
(i: Int, count: Int = 1): Unit
-
def
decompress
(i: Int): Int
-
val
divisor
: Int
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
generateStatistics
(): Statistics
-
def
getClass
(): java.lang.Class[_]
-
def
getEvenQuantiles
(num: Int): Array[Double]
-
def
getItemCount
(i: Int): Int
-
def
getMaxValue
: Int
-
def
getMinMaxValues
: (Int, Int)
-
def
getMinValue
: Int
-
def
getQuantileBreaks
(num: Int): Array[Int]
-
def
getTotalCount
: Int
-
def
getValues
: Array[Int]
-
def
hashCode
(): Int
-
def
isInstanceOf
[T0]
: Boolean
-
def
ne
(arg0: AnyRef): Boolean
-
def
normalizeExtremeValues
(num: Int, cutoff: Int): Unit
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
sparseString
: String
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toJSON
: String
-
def
toString
(): String
-
def
uncountItem
(i: Int): Unit
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Data object representing a histogram using an array for internal storage, which requires an initial minimum and maximum val and a specified number of 'breaks' which are used to group values together into ranges.