Immutable collection of distinct objects
does Setty
A Set
is an immutable set, meaning a collection of distinct elements in no particular order. (For mutable sets, see SetHash instead.)
Objects/values of any type are allowed as set elements. Within a Set
, every element is guaranteed to be unique (in the sense that no two elements would compare positively with the === operator):
my = set <peach apple orange apple apple>;say .elems; # OUTPUT: «3»say .keys.sort; # OUTPUT: «apple orange peach»
Set
s can be treated as object hashes using the { }
postcircumfix operator, which returns the value True
for keys that are elements of the set, and False
for keys that aren't:
my = set <peach apple orange apple apple>;say <apple>; # OUTPUT: «True»say <kiwi>; # OUTPUT: «False»
Set
objectsSet
s can be composed using the set subroutine (or Set.new
, for which it is a shorthand). Any positional parameters, regardless of their type, become elements of the set:
my = set "zero" => 0, "one" => 1, "two" => 2;say .keys.raku; # OUTPUT: «(:two(2), :zero(0), :one(1)).Seq»say .keys.map(); # OUTPUT: «((Pair) (Pair) (Pair))»
Alternatively, the .Set
coercer (or its functional form, Set()
) can be called on an existing object to coerce it to a Set
. Its semantics depend on the type and contents of the object. In general it evaluates the object in list context and creates a set with the resulting items as elements, although for Hash-like objects or Pair items, only the keys become elements of the set - and keys mapped to values which boolify to False
are skipped:
my = ("zero" => 0, "one" => 1, "two" => 2).Set;say .keys.raku; # OUTPUT: «("one", "two").Seq»say .keys.map(); # OUTPUT: «((Str) (Str))»
Furthermore, you can get a Set
by using set operators (see next section) on objects of other types such as List, which will act like they internally call .Set
on them before performing the operation. Be aware of the tight precedence of those operators though, which may require you to use parentheses around arguments:
say (1..5) (^) 4; # OUTPUT: «Set(1 2 3 5)»
You can also create a Set
with the .new
method.
my = Set.new( <peach apple orange apple apple> );
Since 6.d (2019.03 and later) you can also use this syntax for parameterization of the Set
, to specify which type of values are acceptable:
# only allow strings (Str) in the Setmy = Set[Str].new( <peach apple orange apple apple> );# only allow whole numbers (Int) in the Setmy = Set[Int].new( <peach apple orange apple apple> );# Type check failed in binding; expected Int but got Str ("peach")
Finally, you can create Set
masquerading as a hash (actually, declare a variable Associative
by using the corresponding sigil) by using the is
trait:
my is Set = <a b c>;say <a>; # Truesay <d>; # False
Since 6.d (2019.03 and later), this syntax also allows you to specify the type of values you would like to allow:
# limit to stringsmy is Set[Str] = <a b c>;say <a>; # Truesay <d>; # False# limit to whole numbersmy is Set[Int] = <a b c>;# Type check failed in binding; expected Int but got Str ("a")
See Operators with set semantics for a complete list of "set operators" applicable to, among other types, Set
.
Examples:
my (, ) = set(1, 2, 3), set(2, 4);say (<) ; # OUTPUT: «False»say (&) ; # OUTPUT: «Set(2)»say (^) ; # OUTPUT: «Set(1 3 4)»# Unicode versions:say ⊂ ; # OUTPUT: «False»say ∩ ; # OUTPUT: «Set(2)»say ⊖ ; # OUTPUT: «Set(1 3 4)»
sub set(* --> Set)
Creates a Set
from the given @args