File tree Expand file tree Collapse file tree 1 file changed +5
-6
lines changed Expand file tree Collapse file tree 1 file changed +5
-6
lines changed Original file line number Diff line number Diff line change @@ -82,7 +82,7 @@ only C<Set> arguments.
82
82
multi sub infix:<(elem)>($a, Any $b --> Bool)
83
83
multi sub infix:<(elem)>($a, Set $b --> Bool)
84
84
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 > .
86
86
87
87
= head4 infix ∈
88
88
@@ -257,15 +257,14 @@ Equivalent to L«(V<|>)».
257
257
only sub infix:<(&)>(**@p)
258
258
259
259
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.
262
261
263
262
<a b c> (&) <b c d> === set <b c>
264
263
<a b c d> (&) <b c d e> (&) <c d e f> === set <c d>
265
264
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) .
269
268
270
269
bag(<a a b c a>) (&) bag(<a a b c c>) === bag(<a a b c>)
271
270
You can’t perform that action at this time.
0 commit comments