geotrellis.statistics.ArrayHistogram

Instance Constructors

new ArrayHistogram(counts: Array[Int], total: Int)

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def copy: ArrayHistogram

Return a copy of this histogram.
Return a copy of this histogram.

Definition Classes
ArrayHistogram → Histogram
def countItem(i: Int, count: Int = 1): Unit

Note the occurance of 'item.
Note the occurance of 'item.
The optional parameter 'count' allows histograms to be built more efficiently. Negative counts can be used to remove a particular number of occurances of 'item'.

Definition Classes
ArrayHistogram → Histogram
val counts: Array[Int]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def foreach(f: (Int, Int) ⇒ Unit): Unit

Definition Classes
Histogram
def generateStatistics(): Statistics

Definition Classes
Histogram
final def getClass(): java.lang.Class[_]

Definition Classes
AnyRef → Any
def getEvenQuantiles(num: Int): Array[Double]

Return 'num' evenly spaced Doubles from 0.
Return 'num' evenly spaced Doubles from 0.0 to 1.0.

Definition Classes
Histogram
def getItemCount(i: Int): Int

Return the number of occurances for 'item'.
Return the number of occurances for 'item'.

Definition Classes
ArrayHistogram → Histogram
def getMaxValue: Int

Return the largest item seen.
Return the largest item seen.

Definition Classes
ArrayHistogram → Histogram
def getMinMaxValues: (Int, Int)

Return the smallest and largest items seen as a tuple.
Return the smallest and largest items seen as a tuple.

Definition Classes
Histogram
def getMinValue: Int

Return the smallest item seen.
Return the smallest item seen.

Definition Classes
ArrayHistogram → Histogram
def getQuantileBreaks(num: Int): Array[Int]

Definition Classes
Histogram
def getTotalCount: Int

Return the total number of occurances for all items.
Return the total number of occurances for all items.

Definition Classes
ArrayHistogram → Histogram
def getValues: Array[Int]

Definition Classes
ArrayHistogram → Histogram
def hashCode(): Int

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

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def normalizeExtremeValues(num: Int, cutoff: Int): Histogram

This is a heuristic used by getQuantileBreaks, which mutates the histogram.
This is a heuristic used by getQuantileBreaks, which mutates the histogram.

Definition Classes
Histogram
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def setItem(i: Int, count: Int): Unit

Definition Classes
ArrayHistogram → Histogram
def size: Int
def splitBreakIndices(b: Int, q: Int): Array[Int]

The basic idea here is to try to "evenly" split 'b' values across 'q' slots.
The basic idea here is to try to "evenly" split 'b' values across 'q' slots. The goal is to drop or duplicate values as evenly as possible. Here are some examples:
splitBreakIndices(1, 1) -> Array(0) splitBreakIndices(3, 5) -> Array(1,2,4) splitBreakIndices(4, 5) -> Array(0,1,3,4) splitBreakIndices(5, 5) -> Array(0,1,2,3,4) splitBreakIndices(7, 5) -> Array(0,1,1,2,3,3,4) splitBreakIndices(10,5) -> Array(0,0,1,1,2,2,3,3,4,4)

Definition Classes
Histogram
def splitBreaks(breaks: Array[Int], q: Int): Array[Int]

Take an existing array of class breaks (values that define the maximum for a particular class) and "stretch" them over a larger range.
Take an existing array of class breaks (values that define the maximum for a particular class) and "stretch" them over a larger range. The idea is that a user might want 6 classes, but only 4 could be created. In these cases we will streth the 4 breaks into 6 (with some breaks being unused) to better map onto a users' preferred colors.

Definition Classes
Histogram
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toJSON: String

Definition Classes
Histogram
def toString(): String

Definition Classes
AnyRef → Any
var total: Int
def uncountItem(i: Int): Unit

Forget all occurances of 'item'.
Forget all occurances of 'item'.

Definition Classes
ArrayHistogram → Histogram
def update(other: Histogram): Unit

Definition Classes
Histogram
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()

ArrayHistogram

class ArrayHistogram extends Histogram

Instance Constructors

new ArrayHistogram(counts: Array[Int], total: Int)

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def copy: ArrayHistogram

def countItem(i: Int, count: Int = 1): Unit

val counts: Array[Int]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foreach(f: (Int, Int) ⇒ Unit): Unit

def generateStatistics(): Statistics

final 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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def normalizeExtremeValues(num: Int, cutoff: Int): Histogram

final def notify(): Unit

final def notifyAll(): Unit

def setItem(i: Int, count: Int): Unit

def size: Int

def splitBreakIndices(b: Int, q: Int): Array[Int]

def splitBreaks(breaks: Array[Int], q: Int): Array[Int]

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

def toJSON: String

def toString(): String

var total: Int

def uncountItem(i: Int): Unit

def update(other: Histogram): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Histogram

Inherited from AnyRef

Inherited from Any