Class: Prime::PseudoPrimeGenerator
- Includes:
- Enumerable
- Defined in:
- lib/backports/1.9.1/stdlib/prime.rb
Overview
An abstract class for enumerating pseudo-prime numbers.
Concrete subclasses should override succ, next, rewind.
Direct Known Subclasses
Instance Method Summary collapse
-
#each ⇒ Object
Iterates the given block for each prime number.
-
#initialize(ubound = nil) ⇒ PseudoPrimeGenerator
constructor
A new instance of PseudoPrimeGenerator.
-
#next ⇒ Object
alias of
succ
. -
#rewind ⇒ Object
Rewinds the internal position for enumeration.
- #size ⇒ Object
-
#succ ⇒ Object
returns the next pseudo-prime number, and move the internal position forward.
- #upper_bound ⇒ Object
- #upper_bound=(ubound) ⇒ Object
-
#with_index(offset = 0) ⇒ Object
see
Enumerator
#with_index. -
#with_object(obj) ⇒ Object
see
Enumerator
#with_object.
Methods included from Enumerable
#all_with_pattern?, #any_with_pattern?, #chain, #chunk, #chunk_while, #compact, #count, #cycle, #drop, #drop_while, #each_entry, #each_with_index_with_optional_args_and_block, #each_with_object, #entries_with_optional_arguments, #filter_map, #find_index, #first, #flat_map, #grep_v, #group_by, #inject_with_symbol, #lazy, #max_by, #min_by, #minmax, #minmax_by, #none?, #none_with_pattern?, #one?, #one_with_pattern?, #reverse_each, #slice_after, #slice_before, #slice_when, #sum, #take, #take_while, #tally, #tally_with_hash_argument, #to_a_with_optional_arguments, #to_h, #to_h_with_block, #uniq
Constructor Details
#initialize(ubound = nil) ⇒ PseudoPrimeGenerator
Returns a new instance of PseudoPrimeGenerator.
233 234 235 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 233 def initialize(ubound = nil) @ubound = ubound end |
Instance Method Details
#each ⇒ Object
Iterates the given block for each prime number.
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 265 def each return self.dup unless block_given? if @ubound last_value = nil loop do prime = succ break last_value if prime > @ubound last_value = yield prime end else loop do yield succ end end end |
#next ⇒ Object
alias of succ
.
253 254 255 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 253 def next raise NotImplementedError, "need to define `next'" end |
#rewind ⇒ Object
Rewinds the internal position for enumeration.
See Enumerator
#rewind.
260 261 262 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 260 def rewind raise NotImplementedError, "need to define `rewind'" end |
#size ⇒ Object
300 301 302 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 300 def size Float::INFINITY end |
#succ ⇒ Object
returns the next pseudo-prime number, and move the internal position forward.
PseudoPrimeGenerator
#succ raises NotImplementedError
.
248 249 250 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 248 def succ raise NotImplementedError, "need to define `succ'" end |
#upper_bound ⇒ Object
240 241 242 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 240 def upper_bound @ubound end |
#upper_bound=(ubound) ⇒ Object
237 238 239 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 237 def upper_bound=(ubound) @ubound = ubound end |
#with_index(offset = 0) ⇒ Object
see Enumerator
#with_index.
282 283 284 285 286 287 288 289 290 |
# File 'lib/backports/1.9.1/stdlib/prime.rb', line 282 def with_index(offset = 0) return enum_for(:with_index, offset) { Float::INFINITY } unless block_given? return each_with_index(&proc) if offset == 0 each do |prime| yield prime, offset offset += 1 end end |