mirror of
https://github.com/urbit/developers.urbit.org.git
synced 2024-09-11 13:55:59 +03:00
Eliminate ++lent
call.
This commit is contained in:
parent
fcb8137238
commit
0dc52a8296
@ -226,7 +226,7 @@ Now that we can find factors, it should be straightforward to find primes. In t
|
||||
=/ prm *(list @ud)
|
||||
|- ^- (list @ud)
|
||||
?: =(1 ctr) prm
|
||||
?: =(0 (lent (factors ctr)))
|
||||
?: =(~ (factors ctr))
|
||||
$(ctr (sub ctr 1), prm [ctr prm])
|
||||
$(ctr (sub ctr 1))
|
||||
--
|
||||
|
Loading…
Reference in New Issue
Block a user