I'm playing with Data::PowerSet. It creates all subsets of a list of elements.
I personally believe that before proceeding you should clarify your terms, especially those I highligheted above, since Mathematics is based upon precise definitions. You start talking about sets, and subsets, then mix them arbitrarily with lists. But sets and lists are different mathematical objects, albeit relatively similar ones. For sets, you cannot speak of "adjacency" while for lists you can.
Now, unless I'm grossly mistaken, it seems to me that your problem may be translated into an equivalent but simpler one, namely that of finding all of the substrings of a given string, perhaps with a constraint on their lenght, as per your example. HTH.
In reply to Re: Subsets and adjacent values
by blazar
in thread Subsets and adjacent values
by andreas1234567
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |