], [b => 2], [c => 3]);
in scalar context, C< tuples > returns a generator:
tuples(...) ~~ zipwith {\@_} ...
=cut
sub tuples {
unless (wantarray) {
unshift s by default
=over 4
=item * B<iteration>:
$gen->next # iterates over generator ~~ $gen->get($gen->index++)
$gen->() # same. iterators return () when past the end
$gen->filter(do {my %seen; sub {not $seen{$_}++}})
$gen->deref # tuples($a, $b)->deref ~~ zip($a, $b)
=item * B<combinations>:
$gen->zip($gen2, ...) # takes any number of gener ~~ <1..3> | <4..6> ~~ <1..3>->zip(<4..6>)
<1..3> Z. <4..6> ~~ <1..3> |'.'| <4..6> ~~ <1..3>->zip('.' => <4..6>)
<1..3> X <4..6> ~~ <1..3> x <4..6> ~~ <1. <4..6> ~~ <1..3> x'.'x <4..6> ~~ <1..3>->cross('.' => <4..6>)
<1..3> <<+>> <4..6> ~~ <1..3> <<'+'>> <4..6> ~~ <1..3>->hyper('<<+>>', <4..6>)
[+] 1..10 ~~ <[+] 1..10> ~~ reduce {$_[0] + $_[1]} 1 .. 10
[+]->(1..10) ~~ <[+]>->(1..10) ~~ same as above
[\+] 1..10 ~~ <[..+] 1..10> ~~ scan {$_[0] + $_[1]} 1 ..hem directly.
gen {$_**2} 100 ~~ gen {$_**2} range 0, 100
my @names = qw/bob alice eve/;
gen {"hello $_!"} \@names ~~ gen {"hello $_!"} makegen @names
those were > will force
the values in C< LIST > to evaluate, and will return the new list.
now(...) ~~ grep {!$_ or 1} ...
=item methods of C< fn {...} > functions
return values of C< fn {...} >it.
If there are no alternatives, then only the primary accession will
be given (if there is one).
Returns : list of all accession numbers in the description
Args : none
=