@@ -33,10 +33,10 @@ TODO: Partial type graph showing only QuantHash, Setty, Baggy, Mixy, Set,
33
33
SetHash, Bag, BagHash, Mix, MixHash.
34
34
35
35
The six collection classes C < Set > , C < SetHash > , C < Bag > , C < BagHash > , C < Mix > ,
36
- C < MixHash > , all share similar semantics:
36
+ C < MixHash > , all share similar semantics.
37
37
38
38
For one thing, as far as they are concerned, identical objects refer to the same
39
- element - where identity is determined using the L < WHICH > methods (i.e. the same
39
+ element -- where identity is determined using the L < WHICH > methods (i.e. the same
40
40
way that the L < === > operator checks identity). For value types like C < Str > , this
41
41
means having the same value; for reference types like C < Array > , it means
42
42
referring to the same object instance.
@@ -124,7 +124,7 @@ not contain C<$b>.
124
124
multi sub infix:<<(<=)>>(Setty $a, Setty $b --> Bool)
125
125
126
126
Returns C < True > if C < $a > is a B < subset > or is equal to C < $b > , i.e., if all the
127
- elements of C < $a > are elements of C < $b > , and C < $a > is a smaller or equal
127
+ elements of C < $a > are elements of C < $b > and C < $a > is a smaller or equal
128
128
sized set than C < $b > .
129
129
130
130
= head4 infix ⊆
@@ -145,7 +145,7 @@ Equivalent to C«!(<=)».
145
145
multi sub infix:<<(<)>>(Setty $a, Setty $b --> Bool)
146
146
147
147
Returns C < True > if C < $a > is a B < strict subset > of C < $b > , i.e., that all the
148
- elements of C < $a > are elements of C < $b > , but C < $a > is a smaller set than
148
+ elements of C < $a > are elements of C < $b > but C < $a > is a smaller set than
149
149
C < $b > .
150
150
151
151
= head4 infix ⊂
@@ -236,7 +236,7 @@ Equivalent to L«(+>)».
236
236
237
237
only sub infix:<(|)>(**@p)
238
238
239
- Returns the B < union > of all of its arguments. Generally, this creates a new
239
+ Returns the B < union > of all its arguments. Generally, this creates a new
240
240
C < Set > that contains all the elements its arguments contain.
241
241
242
242
<a a b c d> (|) <h g f e d c> (|) <i j> === set <a b c d e f g h i j>
@@ -266,7 +266,7 @@ arguments contain.
266
266
267
267
If any of its arguments are C < Baggy > , this creates a new C < Bag > that
268
268
contains only the elements that all of the arguments contain, each
269
- weighted the max weight all of the arguments share for that element.
269
+ weighted by the maximum weight all of the arguments share for that element.
270
270
271
271
bag(<a a b c a>) (&) bag(<a a b c c>) === bag(<a a b c>)
272
272
@@ -312,7 +312,7 @@ all the elements C<$b> has but C<$a> doesn't. Equivalent to C<($a ∖ $b)
312
312
313
313
only sub infix:<<"\x2296">>($a, $b --> Setty)
314
314
315
- Equivalent to L « (^) »
315
+ Equivalent to L « (^) » .
316
316
317
317
= head3 infix (.)
318
318
0 commit comments