Skip to content

Commit f64f3cf

Browse files
committed
Merge pull request #62 from edwinst/master
A couple of edits for "Sets, Bags, and Mixes"
2 parents 103c676 + bb4d9b3 commit f64f3cf

File tree

1 file changed

+5
-6
lines changed

1 file changed

+5
-6
lines changed

lib/Language/setbagmix.pod

Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ only C<Set> arguments.
8282
multi sub infix:<(elem)>($a, Any $b --> Bool)
8383
multi sub infix:<(elem)>($a, Set $b --> Bool)
8484
85-
Returns C<True> if C<$a> is an B<element> of C<$b> as an element.
85+
Returns C<True> if C<$a> is an B<element> of C<$b>.
8686
8787
=head4 infix ∈
8888
@@ -257,15 +257,14 @@ Equivalent to L«(V<|>)».
257257
only sub infix:<(&)>(**@p)
258258
259259
Returns the B<intersection> of all of its arguments. Generally, this creates
260-
a new C<Set> that contains only the elements that all of its arguments
261-
contain.
260+
a new C<Set> that contains only the elements common to all of the arguments.
262261
263262
<a b c> (&) <b c d> === set <b c>
264263
<a b c d> (&) <b c d e> (&) <c d e f> === set <c d>
265264
266-
If any of its arguments are C<Baggy>, this creates a new C<Bag> that
267-
contains only the elements that all of the arguments contain, each weighted
268-
by the maximum weight all of the arguments share for that element.
265+
If any of the arguments are C<Baggy>, the result is a new C<Bag> containing
266+
the common elements, each weighted by the largest I<common> weight (which
267+
is the minimum of the weights of that element over all arguments).
269268
270269
bag(<a a b c a>) (&) bag(<a a b c c>) === bag(<a a b c>)
271270

0 commit comments

Comments
 (0)