Softanza
StartFrançais
Softanza
Reference · stzString

Duplicates()

Duplicates(): every duplicated SUBSTRING (not just chars), deduped, in (i,j) scan order -- matches the original DuplicatesCS. e.g. "RINGORIALAND" -> [ "R","I","A","N", ...multi-char dups... ]. (For a string with no repeated multi-char run, this coincides with the duplicated chars.)

Basic examples (2)

Softanza
oA = new stzString("a")
s = new stzString( oA.Repeated(1000) )
# DuplicatesCS(1) is 500 (a^k, k<=500)
? len(s.DuplicatesCS(1))
# SubStringsOccuringNTimes(2) is 500 (count >= 2)
? len(s.SubStringsOccuringNTimes(2))
# SubStringsOccurringOnlyNTimes(1) is 500 (count == 1)
? len(s.SubStringsOccurringOnlyNTimes(1))
Output
500
500
500

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")
m = new stzString("aA")
big = new stzString( m.Repeated(50) )
# SubStringsCS(1) exact-distinct is 199
? len(big.SubStringsCS(1))
# SubStringsU() folds all case -> 100 (like a^100)
? len(big.SubStringsU())
# DuplicatesCS(1) exact is 99
? len(big.DuplicatesCS(1))
# DuplicatesCS(0) case-insensitive dedup is 50
? len(big.DuplicatesCS(0))
Output
199
100
99
50

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)

Scope (1)

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 · DuplicatesCS
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
yes
includes the position in what it returns · DuplicatesZ
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
no
returns the result without duplication

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