Mutable collection of distinct objects with Real weights
does Mixy
A MixHash
is a mutable mix, meaning a collection of distinct elements in no particular order that each have a real-number weight assigned to them. (For immutable mixes, see Mix instead.)
Objects/values of any type are allowed as mix elements. Within a MixHash
, items that would compare positively with the === operator are considered the same element, with a combined weight.
my = (butter => 0.22, sugar => 0.1,flour => 0.275, sugar => 0.02).MixHash;say .elems; # OUTPUT: «3»say .keys.sort; # OUTPUT: «butter flour sugar»say .pairs.sort; # OUTPUT: «"butter" => 0.22 "flour" => 0.275 "sugar" => 0.12»say .total; # OUTPUT: «0.615»
MixHash
es can be treated as object hashes using the { }
postcircumfix operator, or the < >
postcircumfix operator for literal string keys, which returns the corresponding numeric weight for keys that are elements of the mix, and 0
for keys that aren't. It can also be used to modify weights; Setting a weight to 0
automatically removes that element from the mix, and setting a weight to a non-zero number adds that element if it didn't already exist:
my = (butter => 0.22, sugar => 0.1,flour => 0.275, sugar => 0.02).MixHash;say <butter>; # OUTPUT: «0.22»say <sugar>; # OUTPUT: «0.12»say <chocolate>; # OUTPUT: «0»<butter> = 0;<chocolate> = 0.30;say .pairs; # OUTPUT: «"sugar" => 0.12 "flour" => 0.275 "chocolate" => 0.3»
MixHash
objectsMixHash
es can be composed using MixHash.new
. Any positional parameters, regardless of their type, become elements of the mix - with a weight of 1
for each time the parameter occurred:
my = MixHash.new: "a", "a", "b" => 0, "c" => 3.14;say .keys.map(); # OUTPUT: «((Str) (Pair) (Pair))»say .pairs; # OUTPUT: «(a => 2 (c => 3.14) => 1 (b => 0) => 1)»
Alternatively, the .MixHash
coercer (or its functional form, MixHash()
) can be called on an existing object to coerce it to a MixHash
. Its semantics depend on the type and contents of the object. In general it evaluates the object in list context and creates a mix with the resulting items as elements, although for Hash-like objects or Pair items, only the keys become elements of the mix, and the (cumulative) values become the associated numeric weights:
my = ("a", "a", "b" => 0, "c" => 3.14).MixHash;say .keys.map(); # OUTPUT: «((Str) (Str))»say .pairs; # OUTPUT: «(a => 2 c => 3.14)»
Since 6.d (2019.03 and later) it is also possible to specify the type of values you would like to allow in a MixHash
. This can either be done when calling .new
:
# only allow stringsmy = MixHash[Str].new: <a b b c c c>;
or using the masquerading syntax:
# only allow stringsmy is MixHash[Str] = <a b b c c c>;say <b>; # 2say <d>; # 0# only allow whole numbersmy is MixHash[Int] = <a b b c c 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, MixHash
.
Examples:
my (, ) = MixHash(2 => 2, 4), MixHash(2 => 1.5, 3 => 2, 4);say (<) ; # OUTPUT: «False»say (<=) ; # OUTPUT: «False»say (^) ; # OUTPUT: «MixHash(2(0.5) 3(2))»say (+) ; # OUTPUT: «MixHash(2(3.5) 4(2) 3(2))»# Unicode versions:say ⊂ ; # OUTPUT: «False»say ⊆ ; # OUTPUT: «False»say ⊖ ; # OUTPUT: «MixHash(2(0.5) 3(2))»say ⊎ ; # OUTPUT: «MixHash(2(3.5) 4(2) 3(2))»
reverse
and ordering.MixHash inherits reverse
from Any, however, Mix
es do not have an inherent order and you should not trust it returning a consistent output.
If you sort a MixHash, the result is a list of pairs, at which point reverse
makes perfect sense:
my = MixHash.new(2, 2, 18, 3, 4);say ; # OUTPUT: «MixHash(18 2(2) 3 4)»say .sort; # OUTPUT: «(2 => 2 3 => 1 4 => 1 18 => 1)»say .sort.reverse; # OUTPUT: «(18 => 1 4 => 1 3 => 1 2 => 2)»
method Bag (--> Bag)
Coerces the MixHash
to a Bag
. The weights are converted to Int
, which means the number of keys in the resulting Bag
can be fewer than in the original MixHash
, if any of the weights are negative or truncate to zero.
method BagHash (--> BagHash)
Coerces the MixHash
to a BagHash
. The weights are converted to Int
, which means the number of keys in the resulting BagHash
can be fewer than in the original MixHash
, if any of the weights are negative or truncate to zero.