Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

Comment on

( #3333=superdoc: print w/replies, xml ) Need Help??
In hopes of better understanding what you were doing, I implemented powersets first as a recursive function and then as an iterator that tries to parallel the recursive version. I thought you might be interested to see what I came up with.
# Powerset: the set of all subsets -- (for illustration only, not used + below) sub powerset { my ($car, @cdr) = @_; my @cdr_powerset = @cdr ? powerset(@cdr) : (); return ([$car], map([$car, @$_], @cdr_powerset), @cdr_powerset); } sub iter_powerset { my ($car, @cdr) = @_; my $cdr_power_iter = @cdr ? iter_powerset(@cdr) : (); my $mode = 0; return sub { if ($mode == 0) { ++$mode; return [$car]; } elsif ($mode == 1) { my $tail = $cdr_power_iter ? $cdr_power_iter->() : []; if (@$tail) { return [$car, @$tail]; } else { ++$mode; } } my $tail = $cdr_power_iter ? $cdr_power_iter->() : []; if (@$tail) { return [@$tail]; } else { $mode = 0; return []; } } } my $iter = iter_powerset(2,3,5,7,11); print "@$_\n" while (@{$_ = $iter->()});
The recursive version returns a list of three sub-lists: the first element, the first element mapped onto all the powerset of the tail, and the powerset of the tail. These are the three modes that an iterator can be in.

My iterator factory begins by recursively calling itself, creating an iterator for the tail of the list, then it returns a closure. The code in the closure checks the mode and uses the tail-iterator (if necessary) to generate the appropriate set: In Mode 0, just the first element is returned; in Mode 1, the first element and the next powerset of the tail; Mode 1 may "fall through" into Mode 2, where just the next powerset of the tail is returned. Upon reaching the end of its powerset, the iterator returns an empty arrayref, and resets the mode to 0 so it can be re-run.

The recursive use of the factory simplifies bookkeeping quite a bit, I think, and it only generates N iterators for a list of N elements, so it's in keeping with the no-explosive-growth objective of having iterators. It also begins cranking out results immediately, even when called with 1..45 as arguments, unlike the recursive version.

Caution: Contents may have been coded under pressure.

In reply to Re^3: Generating powerset with progressive ordering by Roy Johnson
in thread Generating powerset with progressive ordering by Limbic~Region

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?

    What's my password?
    Create A New User
    [erix]: swedes in winter have too much time on their hands

    How do I use this? | Other CB clients
    Other Users?
    Others chanting in the Monastery: (7)
    As of 2018-02-22 15:33 GMT
    Find Nodes?
      Voting Booth?
      When it is dark outside I am happiest to see ...

      Results (294 votes). Check out past polls.