SubStrings()

# length-4 substrings containing a heart pair
? @@( Q("..♥^^♥..^♥♥^..").SubStringsWF( func s { return Q(s).NumberOfChars() = 4 and Q(s).ContainsCS("♥♥", 1) } ) )

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

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())

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))

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())