Softanza
StartFrançais
Softanza
StartFrançais
Reference · stzString

NumberOfSubStrings()

How many substrings the string yields.

also written: HowManySubStrings

Basic examples (2)

Softanza
o1 = new stzString("..ONE..TWO..ONE..")
# all substrings
? o1.NumberOfSubStrings()
# unique substrings
? o1.NumberOfUniqueSubStrings()
Output
153
120

run on 2026-10-02 04:24 inside the library at commit 0e72e2e2c; taken from 366_findsubstringsw.ring(opens in a new tab)

Softanza
o1 = new stzString("RINGORIALAND")
# there are 12*13/2 = 78 substrings
? o1.NumberOfSubStrings()
# SubStrings() returns that many
? len( o1.SubStrings() )
Output
78
78

run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from 125_numberofsubstrings.ring(opens in a new tab)

Scope (2)

Softanza
oA = new stzString("a")
s = new stzString( oA.Repeated(1000) )
# NumberOfSubStrings is 500,500 (L(L+1)/2)
? s.NumberOfSubStrings()
# SubStrings() enumerates all 500,500
? len(s.SubStrings())
# SubStringsU() distinct is 1,000 (a^1..a^1000)
? len(s.SubStringsU())
Output
500500
500500
1000

run on 2026-10-02 04:24 inside the library at commit 0e72e2e2c; taken from 998_engine_string_largedata_narrated.ring(opens in a new tab)

Softanza
oA = new stzString("a")
s = new stzString( oA.Repeated(100) )
# NumberOfSubStrings is 5,050
? s.NumberOfSubStrings()
# SubStrings() enumerates 5,050
? len(s.SubStrings())
# SubStringsU() is 100
? len(s.SubStringsU())
# DuplicatesCS(1) is 50
? len(s.DuplicatesCS(1))
# ConsecutiveSubStrings is 3,775
? len(s.ConsecutiveSubStrings())
# FindDupSecutiveChars is 99
? len(s.FindDupSecutiveChars())
Output
5050
5050
100
50
3775
99

run on 2026-10-02 04:24 inside the library at commit 0e72e2e2c; taken from 998_engine_string_largedata_narrated.ring(opens in a new tab)

The extensions of this method

Each extension, and whether it exists for this method; an extension that exists combines with the others (FindSTCS).

Extension
Exists
What it adds · The names
Q
no
does what the method does, then returns the object, so the call can be chained
QQ
no
chains on the next, more specific type of object (the Q ladder)
QQQ
no
chains on the most specific type of object (the Q ladder)
QRT
no
returns the result as an object of the requested type
CS
yes
takes a case-sensitivity flag · NumberOfSubStringsCS
ST
no
takes the position to start from (StartingAt)
IB
no
takes bounds that are included (IncludingBounds)
XT
no
the extended form: more parameters than the base method
XTT
no
yet another extension: a further extended form, after XT
Z
no
includes the position in what it returns
ZZ
no
returns positions as sections, [start, end]
W
no
selects by a condition
WF
no
selects by a condition, with the expressive keywords (@NextItem, @PreviousItem...)
D
no
takes a direction, forward or backward (Directional)
F
no
takes a function (the condition or the update is given as a function); the forms document also uses F for the future form, which defers the action
Many
no
works on a collection of items instead of one (the plural form)
Except
no
takes exceptions, what to leave out (the exceptional form)
U
yes
returns the result without duplication · NumberOfSubStringsU

Every example is a test file of the library, run inside the library for this page; only those whose output kept every promise their file wrote are shown.

See also