Enrico Siragusa
Enrico Siragusa
@h-2 Could you please write something more about this use case? What would you like to do with the masked sequence? Maybe masking could be better represented at container level...
@h-2 Okay, you would like to have a StringSet "view" that collects only unmasked infixes, and then let an online/offline algorithm consider only that parts, right? I was asking for...
@weese Do you mean to reuse the Repeat struct to store information about repeats, or the repeat finding algorithms? Hmm I as far as I understood, @h-2 only wanted to...
@h2 The seeding algorithm would work on the unmasked infixes, while the extension algorithm would work on the original container. I don't know how useful would that be, you'll have...
@h-2 With the alphabet encoding, checking if position i is unmasked would take constant time, but checking where the masking boundary starts/ends would take linear time.
@weese That's exactly how I was thinking to represent masking! :+1:
@h-2 I renamed the issue to mention only the feature you requested.
It would be more sinful to disable the Packed String spec on non-packable types. For that, it suffices to introduce PackableAlphabetConcept refining AlphabetConcept, then decorate the PackedString implementation with concept...
The quick and dirty fix could be to convert/treat e.g. 6S as 6M.
@h-2 this flag triggers tons of warnings...