úÎ(l&Þ     DA set of frequencies which with an applicative action is allowed to  occur. a/ is the result type of a single atomic action. b is the L composite result type after executing the action a number of times allowed  by this set. /Run an action a certain number of times, using  to branch (at the I deepest point possible) if multiple frequencies are allowed. Use greedy A choices: always make the longer alternative the left operand of <|>. /Run an action a certain number of times, using  to branch (at the G deepest point possible) if multiple frequencies are allowed. Use lazy  choices: always make the ! alternative the left operand of <|>. @Enumerate all the numbers of allowed occurrences encoded by the  replication scheme. &Perform an action exactly zero times. $Perform an action exactly one time. %Perform an action exactly two times. 'Perform an action exactly three times. %Perform an action zero or one times. &Perform an action zero or more times. %Perform an action one or more times. )Perform an action exactly so many times. *Perform an action at least so many times. )Perform an action at most so many times. JAllow an action to be performed between so and so many times (inclusive). Repeat an action forever. Pairwise multiplication. F is the singleton set of exactly one occurrence {1}. It is synonymous  with . G produces the set of occurrences that are the products of all possible  pairs from the two operands. Behaves exactly as the  instance. A is the empty set {} of allowed occurrences. Not even performing / an action zero times is allowed in that case. 2 computes the union of the two sets. For example,  2 4    3 5 is equivalent to  2 5. Again, in case of overlap, 0 head values from the left operand are favored. Pairwise addition. = is the singleton set of exactly zero occurrences {0}. It is  synonymous with . C produces the set of occurrences that are the sums of all possible  pairs from the two operands. An example: sequencing   2 {2} with   3 {3} produces  {2+3} = {5}. ,Another example: sequencing the set {0, 1} ( ) with itself produces K {0+0, 0+1, 1+0, 1+1} = {0, 1, 1, 2} = {0, 1, 2}. In case of overlap, like  in this example,  favors the heads (of type Maybe b) from the left  operand. $Map over the composite result type.          !"#ReplicateEffects-0.2Control.Replicate ReplicateConsNil*!*?sizeszeroonetwothreeoptmanysomeexactlyatLeastatMostbetweenforeverbaseControl.Applicative<|>pure$fCategoryReplicateControl.Categoryid.$fMonoidReplicate Alternative$fAlternativeReplicateempty$fApplicativeReplicate<*>$fFunctorReplicate