File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -82,8 +82,8 @@ are returned in the same way: from smallest to the largest
82
82
(5 seconds, 4 minutes).
83
83
84
84
If the divisors are given as a lazy list, runs until the remainder is 0.
85
- Otherwise, returns one more items in the result than the number of given
86
- divisors. All divisors must be Ints , unless the method is called on a non-Int number.
85
+ Otherwise, returns one more item in the result than the number of given
86
+ divisors. All divisors must be C < Int > s , unless the method is called on a non-C < Int > number.
87
87
88
88
my $seconds = 1 * 60*60*24 # days
89
89
+ 3 * 60*60 # hours
@@ -100,7 +100,7 @@ divisors. All divisors must be Ints, unless the method is called on a non-Int nu
100
100
say ⅔.polymod(⅓); # (0 2)
101
101
say 5.Rat.polymod(.3, .2); # (0.2 0 80)
102
102
103
- To illustrate how the Int, non-lazy version of polymod works, consider
103
+ To illustrate how the C < Int > , non-lazy version of polymod works, consider
104
104
this code that implements it:
105
105
106
106
my $seconds = 2 * 60*60*24 # days
You can’t perform that action at this time.
0 commit comments