The library documents itself · Diagramming & graphs

stzFaultTree

24 own methods · 2 forms written with extensions, listed under their method · Also inherits from stzDiagram (244) · stzGraph (289)

the source: base/graph/stzFaultTree.ring(opens in a new tab) · All classes · The area reference: Diagramming & graphs

Under each method, its extensions (Q CS XT Z ZZ IB W U): bold and ticked, it exists; struck, it does not. The extensions and what they mean

Examples: 0 come from the library's tests; 1 were composed from each method's signature and run for this page, on a fresh object, for example o1 = new stzFaultTree("repeated"). 23 methods have none yet. Examples run on 2026-10-03 12:54 inside the library at commit 0e72e2e2c.

Method

Explanation, as the source carries it

init

(no comment in the source: the name reads as a sentence) initno extension

AddTop

the eventsno extension

AddEvent

(no comment in the source: the name reads as a sentence) add eventno extension

AddBasic

a basic event whose probability is not yet known -- the third rule will say soQCSXTZZZIBWU

AddUndeveloped

(no comment in the source: the name reads as a sentence) add undevelopedno extension

AddNote

(no comment in the source: the name reads as a sentence) add noteQCSXTZZZIBWUXTT

AddGate

the gatesno extension

Under

Under(event, gate): the gate develops the eventno extension

Feed

Feed(gate, input): an event is an input of the gate. An event may feed several gates -- a repeated event -- which is why the cut sets are computed rather than read.no extension

Develop

Develop(event, kind, [ inputs ]): the gate is named after the eventQCSXTZZZIBWU

Events

(no comment in the source: the name reads as a sentence) eventsno extension

Gates

(no comment in the source: the name reads as a sentence) gatesno extension

Inputs

(no comment in the source: the name reads as a sentence) inputsno extension

GateOf

(no comment in the source: the name reads as a sentence) gate ofno extension

InputsOf

(no comment in the source: the name reads as a sentence) inputs ofno extension

TopEvent

(no comment in the source: the name reads as a sentence) top eventno extension

ProbabilityOf

the numbers -------------------------------------------------------- THE PROBABILITY OF AN EVENT OR A GATE, computed up from the leaves. AND multiplies, OR takes one minus the product of the complements; both assume independent inputs. Refused by name where a leaf has no number, where an event is undeveloped, or where a cause is among its own effects.no extension

TopProbability

(no comment in the source: the name reads as a sentence) top probabilityno extension

MinimalCutSets

THE MINIMAL CUT SETS of the top: the smallest sets of basic events that bring it about. Expanded down the tree -- an OR unions its inputs' sets, an AND crosses them -- then minimised: a set holding another is dropped, and duplicates fold. Each set is a list of basic ids in the order added; the sets come smallest first.no extension

CutSetProbability

THE EXACT PROBABILITY OF THE TOP, from the minimal cut sets by inclusion and exclusion over their unions -- the one number the gate arithmetic cannot give when a basic event is repeated. Every basic is still taken independent of every other. Refused above twelve cut sets, where the subsets outrun what a picture can mean.no extension

AsRuleGraph

the projection the rules readno extension

GovernanceFindings

(no comment in the source: the name reads as a sentence) governance findingsalso written: CheckRulesno extension

GovernanceIsSound

SOUND IS NO ERROR, not no finding: this tree's rules set their severity deliberately, and a warning says the picture may stand. StzFindingsAreSound is the house's one answer; GovernanceFindings() is still every finding, warnings included, for a caller who wants them.also written: RulesAreSound

composed example

o1 = new stzFaultTree("repeated")
? o1.GovernanceIsSound()
#--> 0

composed from the signature, run for this page

no extension

RenderProbabilities

the drawing ---------------------------------------------------------- what was written inside the basic events on the last render: [ id, p, x, y ], p = -1 where none was declaredno extension