Skip to content

Commit 7102514

Browse files
committed
code formatted Int
1 parent f7d1a9e commit 7102514

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

doc/Type/Int.pod

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -82,8 +82,8 @@ are returned in the same way: from smallest to the largest
8282
(5 seconds, 4 minutes).
8383
8484
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.
8787
8888
my $seconds = 1 * 60*60*24 # days
8989
+ 3 * 60*60 # hours
@@ -100,7 +100,7 @@ divisors. All divisors must be Ints, unless the method is called on a non-Int nu
100100
say ⅔.polymod(⅓); # (0 2)
101101
say 5.Rat.polymod(.3, .2); # (0.2 0 80)
102102
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
104104
this code that implements it:
105105
106106
my $seconds = 2 * 60*60*24 # days

0 commit comments

Comments
 (0)