Anonymous user
Extensible prime generator: Difference between revisions
m
→{{header|Lua}}: cleanup
m (→{{header|Lua}}: cleanup) |
|||
Line 2,831:
=={{header|Lua}}==
The modest requirements of this task allow for naive implementations, such as what follows. This generator does not even use its own list of primes to help determine subsequent primes! (though easily fixed) So, it it sufficient, but not efficient.
<lang lua>
count_limit = 2,
value_limit = 3,
Line 2,850 ⟶ 2,849:
needmore = function(self)
return (self.count_limit ~= nil and #self.primelist < self.count_limit)
or (self.value_limit ~= nil and self.
end,
generate = function(self, count_limit, value_limit)
| |||