The library documents itself · Diagramming & graphs

stzMathDomain

18 own methods · 5 forms written with extensions, listed under their method

the source: base/graph/stzMathDiagram.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; 10 were composed from each method's signature and run for this page, on a fresh object, for example o1 = StzGraphDomain(). 8 methods have none yet. Examples run on 2026-10-03 20:23 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

Name_

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

composed example

o1 = StzGraphDomain()
? o1.Name_()
#--> graph

composed from the signature, run for this page

no extension

AddType

typesQCSXTZZZIBWU

AddSubtype

"Hydrogen <: Atom": wherever an Atom is expected, a Hydrogen matches.QCSXTZZZIBWU

HasType

(no comment in the source: the name reads as a sentence) has type

composed example

o1 = StzGraphDomain()
? o1.HasType("a")
#--> 0

composed from the signature, run for this page

no extension

Types

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

composed example

o1 = StzGraphDomain()
? @@( o1.Types() )
#--> [ "Vertex", "Edge", "Arc" ]

composed from the signature, run for this page

no extension

TypeMatches

TRUE when an object of pcActual may stand where pcWanted is asked for -- the same type, or a subtype of it, at any depth.

composed example

o1 = StzGraphDomain()
? o1.TypeMatches("a", "a")
#--> 1

composed from the signature, run for this page

no extension

AddPredicate

predicatesQCSXTZZZIBWU

AddSymmetricPredicate

Symmetric: Disjoint(A, B) IS Disjoint(B, A). Penrose restricts this to binary predicates over one type, and so does this.QCSXTZZZIBWU

HasPredicate

(no comment in the source: the name reads as a sentence) has predicate

composed example

o1 = StzGraphDomain()
? o1.HasPredicate("a")
#--> 0

composed from the signature, run for this page

no extension

PredicateArity

(no comment in the source: the name reads as a sentence) predicate arity

composed example

o1 = StzGraphDomain()
? o1.PredicateArity("a")
#--> -1

composed from the signature, run for this page

no extension

IsSymmetric

(no comment in the source: the name reads as a sentence) is symmetric

composed example

o1 = StzGraphDomain()
? o1.IsSymmetric("a")
#--> 0

composed from the signature, run for this page

no extension

Predicates

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

composed example

o1 = StzGraphDomain()
? @@( o1.Predicates() )
#--> [ "Highlighted" ]

composed from the signature, run for this page

no extension

AddFunction

functions and constructorsQCSXTZZZIBWU

AddConstructor

a constructor is a function whose name is its output typeno extension

HasFunction

(no comment in the source: the name reads as a sentence) has function

composed example

o1 = StzGraphDomain()
? o1.HasFunction("a")
#--> 0

composed from the signature, run for this page

no extension

FunctionOutputType

(no comment in the source: the name reads as a sentence) function output typeno extension

FunctionArity

(no comment in the source: the name reads as a sentence) function arity

composed example

o1 = StzGraphDomain()
? o1.FunctionArity("a")
#--> -1

composed from the signature, run for this page

no extension