HomologyState

org.appliedtopology.tda4j.homology.CellularHomologyContext.HomologyState
class HomologyState(boundaries: Map[CellularHomologyContext.this.CellT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT]], generators: Map[CellularHomologyContext.this.CellT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT]], val positives: Map[CellularHomologyContext.this.CellT, (CellularHomologyContext.this.FiltrationT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT])], stream: CellStream[CellularHomologyContext.this.CellT, CellularHomologyContext.this.FiltrationT], var current: CellularHomologyContext.this.FiltrationT, barcode: ArrayDeque[(Int, CellularHomologyContext.this.FiltrationT, CellularHomologyContext.this.FiltrationT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT])])

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def advanceAll(): Unit
def advanceOne(): Unit
def advanceTo(f: CellularHomologyContext.this.FiltrationT): Unit
def barcodeAt(f: CellularHomologyContext.this.FiltrationT): List[PersistenceBar[CellularHomologyContext.this.FiltrationT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT]]]
def diagramAt(f: CellularHomologyContext.this.FiltrationT): List[(Int, CellularHomologyContext.this.FiltrationT, CellularHomologyContext.this.FiltrationT)]
def diagramWithGeneratorsAt(f: CellularHomologyContext.this.FiltrationT): List[(Int, CellularHomologyContext.this.FiltrationT, CellularHomologyContext.this.FiltrationT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT])]

Full diagram at f, each bar annotated with its representative cycle (the class's generator at birth for a finished bar; the still-open generator for an essential class).

Full diagram at f, each bar annotated with its representative cycle (the class's generator at birth for a finished bar; the still-open generator for an essential class).

Query values across successive calls must be non-decreasing: this mutates state by advancing the underlying stream, never rewinding it, so diagramAt(3.0) followed by diagramAt(1.0) does not recompute the state as of 1.0 -- it reports whatever was still open at 3.0 as if newly queried at 1.0. Pre-existing behavior, inherited unchanged from the algorithm this replaces.

Attributes

Concrete fields

val cellIterator: BufferedIterator[CellularHomologyContext.this.CellT]
val chainRM: RingModule { type R = CellularHomologyContext.this.CoefficientT; type Self = Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT]; }
var current: CellularHomologyContext.this.FiltrationT
val negativeVCols: Map[CellularHomologyContext.this.CellT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT]]
val positives: Map[CellularHomologyContext.this.CellT, (CellularHomologyContext.this.FiltrationT, Chain[CellularHomologyContext.this.CellT, CellularHomologyContext.this.CoefficientT])]
val processingOrder: Ordering[CellularHomologyContext.this.CellT]

Givens

Givens

given given_Ordering_CellT: Ordering[CellularHomologyContext.this.CellT]