IrregularlyBinning

Type Members

type Datum = DATUM

Type of data expected by fill.
Type of data expected by fill.

Definition Classes
IrregularlyBinning → Aggregation
type EdType = IrregularlyBinned[V.EdType, N.EdType]

The type of the immutable version of this container.
The type of the immutable version of this container.

Definition Classes
IrregularlyBinning → Container
type Type = IrregularlyBinning[DATUM, V, N]

Intended for the general user to copy a complex container's type into the as method of a container whose type is not known at compile-time.
Intended for the general user to copy a complex container's type into the as method of a container whose type is not known at compile-time.
Typical use: filledHistogram.as[initialHistogram.Type]

Definition Classes
IrregularlyBinning → Container

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
def *(factor: Double): IrregularlyBinning[DATUM, V, N]

Reweight the contents in all nested aggregators by a scalar factor, as though they had been filled with a different weight.
Reweight the contents in all nested aggregators by a scalar factor, as though they had been filled with a different weight.
If the container is mutable (with org.dianahep.histogrammar.Aggregation), the new one will be, too.
The original is unaffected.

Definition Classes
IrregularlyBinning → Container
def +(that: IrregularlyBinning[DATUM, V, N]): IrregularlyBinning[DATUM, V, N]

Add two containers of the same type.
Add two containers of the same type.
If these containers are mutable (with org.dianahep.histogrammar.Aggregation), the new one will be, too.
The originals are unaffected.

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

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

Definition Classes
Any
def as[OTHER <: Container[OTHER]]: OTHER

Cast the container to a given type.
Cast the container to a given type. Especially useful for containers reconstructed from JSON or stored in org.dianahep.histogrammar.UntypedLabeling/org.dianahep.histogrammar.UntypedLabeled.

Definition Classes
Container
final def asInstanceOf[T0]: T0

Definition Classes
Any
val bins: Seq[(Double, V)]

Lower thresholds and their associated containers, starting with negative infinity.
def checkForCrossReferences(memo: Set[Aggregation] = mutable.Set[Aggregation]()): Unit

Attributes
protected
Definition Classes
Aggregation
var checkedForCrossReferences: Boolean

List of sub-aggregators, to make it possible to walk the tree.
List of sub-aggregators, to make it possible to walk the tree.

Attributes
protected
Definition Classes
Aggregation
def children: List[Container[_ >: V with N <: Container[_ >: V with N <: Serializable with Aggregation] with Aggregation { type Datum >: DATUM }] with Aggregation { type Datum >: DATUM }]

List of sub-aggregators, to make it possible to walk the tree.
List of sub-aggregators, to make it possible to walk the tree.

Definition Classes
IrregularlyBinning → Container
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def copy: IrregularlyBinning[DATUM, V, N]

Copy this container, making a clone with no reference to the original.
Copy this container, making a clone with no reference to the original.
If these containers are mutable (with org.dianahep.histogrammar.Aggregation), the new one will be, too.

Definition Classes
Container
var entries: Double

Weighted number of entries (sum of all observed weights).
Weighted number of entries (sum of all observed weights).

Definition Classes
IrregularlyBinning → Container
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
IrregularlyBinning → AnyRef → Any
def factory: IrregularlyBin.type

Reference to the container's factory for runtime reflection.
Reference to the container's factory for runtime reflection.

Definition Classes
IrregularlyBinning → Container
def fill[SUB <: Datum](datum: SUB, weight: Double = 1.0): Unit

Entry point for the general user to pass data into the container for aggregation.
Entry point for the general user to pass data into the container for aggregation.
Usually all containers in a collection of histograms take the same input data by passing it recursively through the tree. Quantities to plot are specified by the individual container's lambda functions.
The container is changed in-place.

Definition Classes
IrregularlyBinning → Aggregation
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
val nanflow: N

Container for data that resulted in NaN.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val quantity: UserFcn[DATUM, Double]

Numerical quantity whose value is compared with the given thresholds.
Numerical quantity whose value is compared with the given thresholds.

Definition Classes
IrregularlyBinning → AnyQuantity
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def thresholds: Seq[Double]
def toImmutable: EdType

Convert any Container into a NoAggregation Container.
Convert any Container into a NoAggregation Container.

Definition Classes
Container
def toJson: Json

Convert this container to JSON (dropping its fill method, making it immutable).
Convert this container to JSON (dropping its fill method, making it immutable).
Note that the org.dianahep.histogrammar.json.Json object has a stringify method to serialize.

Definition Classes
Container
def toJsonFile(fileName: String): Unit

Definition Classes
Container
def toJsonFile(file: File): Unit

Definition Classes
Container
def toJsonFragment(suppressName: Boolean): JsonObject

Used internally to convert the container to JSON without its "type" header.
Used internally to convert the container to JSON without its "type" header.

Definition Classes
IrregularlyBinning → Container
def toJsonString: String

Definition Classes
Container
def toString(): String

Definition Classes
IrregularlyBinning → AnyRef → Any
val v: V

Attributes
protected
def values: Seq[V]
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( ... )
def zero: IrregularlyBinning[DATUM, V, N]

Create an empty container with the same parameters as this one.
Create an empty container with the same parameters as this one.
If this container is mutable (with org.dianahep.histogrammar.Aggregation), the new one will be, too.
The original is unaffected.

Definition Classes
IrregularlyBinning → Container

class IrregularlyBinning[DATUM, V <: Container[V] with Aggregation { type Datum >: DATUM }, N <: Container[N] with Aggregation { type Datum >: DATUM }] extends Container[IrregularlyBinning[DATUM, V, N]] with AggregationOnData with NumericalQuantity[DATUM]

Type Members

type Datum = DATUM

type EdType = IrregularlyBinned[V.EdType, N.EdType]

type Type = IrregularlyBinning[DATUM, V, N]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(factor: Double): IrregularlyBinning[DATUM, V, N]

def +(that: IrregularlyBinning[DATUM, V, N]): IrregularlyBinning[DATUM, V, N]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def as[OTHER <: Container[OTHER]]: OTHER

final def asInstanceOf[T0]: T0

val bins: Seq[(Double, V)]

def checkForCrossReferences(memo: Set[Aggregation] = mutable.Set[Aggregation]()): Unit

var checkedForCrossReferences: Boolean

def children: List[Container[_ >: V with N <: Container[_ >: V with N <: Serializable with Aggregation] with Aggregation { type Datum >: DATUM }] with Aggregation { type Datum >: DATUM }]

def clone(): AnyRef

def copy: IrregularlyBinning[DATUM, V, N]

var entries: Double

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def factory: IrregularlyBin.type

def fill[SUB <: Datum](datum: SUB, weight: Double = 1.0): Unit

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val nanflow: N

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val quantity: UserFcn[DATUM, Double]

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

def thresholds: Seq[Double]

def toImmutable: EdType

def toJson: Json

def toJsonFile(fileName: String): Unit

def toJsonFile(file: File): Unit

def toJsonFragment(suppressName: Boolean): JsonObject

def toJsonString: String

def toString(): String

val v: V

def values: Seq[V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zero: IrregularlyBinning[DATUM, V, N]

Inherited from NumericalQuantity[DATUM]

Inherited from AnyQuantity[DATUM, Double]

Inherited from AggregationOnData

Inherited from Aggregation

Inherited from Container[IrregularlyBinning[DATUM, V, N]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped