Code: Select all
red`nblue`ngreen`nred`nblack
(Otherwise, an extra loop is not that hard ..)
Code: Select all
red`nblue`ngreen`nred`nblack
Code: Select all
f1(haystack, needle){ ; finds duplicates without considering a delimiter
local
return (p := instr(haystack, needle)) && instr(haystack, needle,, p + 1)
}
f2(haystack, needle, del := "`n"){ ; for when haystack is a delimited list
local
needle := del . needle . del
haystack := del . haystack . del
return (p := instr(haystack, needle)) && instr(haystack, needle,, p + 1)
}