@xpqz It would. Now I want to know if this actually arrives as 7 separate magnets. If so, then I can make a single image which becomes a bunch of separate glyph magnets.
@Adám Nice video! Question: at 15:20 you said "..tradfns and dfns. We are not going to deal with fully tacit functions and operators in this webinar". You seem to suggest that tacit operators can exist, but I thought operators CANNOT be defined tacitly
@Richard Oh, that's too bad. I think it is only open if you join after the stream starts. I'm happy to answer questions here or through comments on the video.
@pitr Dyalog currently only supports one type of fully tacit operator, namely a monadic operator derived from a dyadic operator with a right operand: ⋄ _Twice←⍣2 ⋄ 1+_Twice 10
The appeal of a string is the number of distinct characters found in the string.
For example, the appeal of "abbca" is 3 because it has 3 distinct characters: 'a', 'b', and 'c'.
Given a string s, return the total appeal of all of its substrings.