File tree Expand file tree Collapse file tree 1 file changed +4
-5
lines changed Expand file tree Collapse file tree 1 file changed +4
-5
lines changed Original file line number Diff line number Diff line change 4
4
5
5
= SUBTITLE Unordered collections of unique and weighted objects in Perl 6
6
6
7
- Often you want to collect objects in a container but you do not care
7
+ You might want to collect objects in a container but you do not care
8
8
about the order of these objects. For such cases, Perl 6 provides the
9
9
I < unordered > collection types L < Set|/type/Set > ,
10
10
L < SetHash|/type/SetHash > , L < Bag|/type/Bag > , L < BagHash|/type/BagHash > ,
@@ -80,10 +80,9 @@ L<Set|/type/Set>, such as unions and set differences. Other operations
80
80
include boolean checks, like whether an object is an element of a
81
81
C < Set > , or whether one C < Set > is a subset of another C < Set > .
82
82
83
- These infixes can be written using the UTF-8 character that represents
84
- the function (like L < ∈|/routine/∈ > , or L < ∪|/routine/∪ > ), or they can be
85
- written with an equivalent ASCII version like L < (elem)|/routine/(elem) >
86
- or L < (^)|/routine/⊖ > .
83
+ These infixes can be written using the UTF-8 character that represents the
84
+ function (like L < ∈|/routine/∈ > , or L < ∪|/routine/∪ > ), or with an equivalent ASCII
85
+ version like L < (elem)|/routine/(elem) > or L < (^)|/routine/⊖ > .
87
86
88
87
Most of the time, explicitly using C < Set > objects with these infixes is
89
88
unnecessary. All the infix operators will work on any objects of type
You can’t perform that action at this time.
0 commit comments