Softanza
StartFrançais
Softanza
The library documents itself · Numeric & optimization

stzPairOfNumbers

13 own methods · 0 forms written with extensions, listed under their method · Also inherits from stzPair (13) · stzList (885)

the source: base/number/stzPairOfNumbers.ring(opens in a new tab) · All classes · The area reference: Numeric & optimization

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; 9 were composed from each method's signature and run for this page, on a fresh object, for example o1 = new stzPairOfNumbers([ 2.07, 0.39 ]). 4 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
Content
(no comment in the source: the name reads as a sentence) contentalso written: PairOfNumberQCSXTZZZIBWU
Value
(no comment in the source: the name reads as a sentence) valueno extension
FirstNumber
(no comment in the source: the name reads as a sentence) first number
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.FirstNumber()
#--> 2.07
composed from the signature, run for this page
no extension
SecondNumber
(no comment in the source: the name reads as a sentence) second number
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.SecondNumber()
#--> 0.39
composed from the signature, run for this page
no extension
BothAreBetween
(no comment in the source: the name reads as a sentence) both are betweenalso written: AreBothBetween
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.BothAreBetween(2, 5)
#--> 0
composed from the signature, run for this page
no extension
LeastCommonMuliple
calculationg the least common multiple of the two numbers
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.LeastCommonMuliple()
#--> 807945773150267
composed from the signature, run for this page
no extension
CommonLeastMultiplier
calculationg the least common multiple of the two numbersno extension
GreatestCommonDividor
calculationg the greatest common dividor of the two numbersalso written: CommonGreatestDividor
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.GreatestCommonDividor()
#--> 0.00
composed from the signature, run for this page
no extension
SpeedUp
getting the speedup of the numbersalso written: SpeedUpX
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.SpeedUp()
#--> 5.31
composed from the signature, run for this page
no extension
GainFactor
getting the gain factor from number to numberalso written: GainX · PerfGainX
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.GainFactor()
#--> 0.19
composed from the signature, run for this page
no extension
PerfGain
getting the perfgain from the numbersalso written: PerfGain100
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.PerfGain()
#--> 81.16
composed from the signature, run for this page
no extension
Gain
getting the gain in percentage from number to numberalso written: Gain100 · RelativeGain
composed example
o1 = new stzPairOfNumbers([ 2.07, 0.39 ])
? o1.Gain()
#--> -430.77
composed from the signature, run for this page
no extension