Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #8189
| Path | csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!feeder.news-service.com!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail |
|---|---|
| Return-Path | <ian.g.kelly@gmail.com> |
| X-Original-To | python-list@python.org |
| Delivered-To | python-list@mail.python.org |
| X-Spam-Status | OK 0.012 |
| X-Spam-Evidence | '*H*': 0.98; '*S*': 0.00; 'elif': 0.04; '21,': 0.09; 'considered.': 0.09; 'first:': 0.09; 'integers': 0.09; 'pm,': 0.10; 'output': 0.11; 'def': 0.12; 'wrote:': 0.14; 'bounds': 0.16; 'does,': 0.16; 'logic.': 0.16; 'n),': 0.16; 'n):': 0.16; 'range.': 0.16; 'ranges.': 0.16; 'math': 0.16; 'input': 0.17; 'tue,': 0.17; 'yield': 0.19; 'header:In-Reply-To:1': 0.21; 'figure': 0.21; 'wrote': 0.22; 'align': 0.23; 'reference.': 0.23; 'received:209.85.161.46': 0.23; 'received:mail- fx0-f46.google.com': 0.23; '(or': 0.24; 'specified': 0.26; 'received:209.85.161': 0.26; 'script': 0.27; 'message- id:@mail.gmail.com': 0.28; 'problem': 0.28; 'import': 0.29; 'odd': 0.29; 'subject:How': 0.30; "won't": 0.30; 'store.': 0.30; 'print': 0.31; 'implementing': 0.32; 'technical': 0.33; 'does': 0.33; 'to:addr:python-list': 0.33; 'actually': 0.33; 'too': 0.33; 'chris': 0.34; 'force': 0.34; 'curious': 0.35; 'using': 0.35; 'test': 0.35; 'actual': 0.36; 'determine': 0.36; 'received:google.com': 0.37; 'received:209.85': 0.37; 'checks': 0.37; 'subject:can': 0.38; 'run': 0.38; 'but': 0.38; 'subject:: ': 0.38; 'doing': 0.39; 'subject: (': 0.39; 'received:209': 0.39; 'to:addr:python.org': 0.39; 'generate': 0.60; 'simply': 0.60; 'within': 0.60; 'hope': 0.60; 'wide': 0.61; 'back': 0.63; 'full': 0.63; 'marked': 0.65; 'limit': 0.65; 'memory,': 0.67; 'prime': 0.73; '11:58': 0.84; 'generator,': 0.84; 'subject:over': 0.84; 'ranges': 0.91; 'url:pl': 0.93 |
| DKIM-Signature | v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:in-reply-to:references:from:date :message-id:subject:to:content-type; bh=OF9RGmOY6yN6CXZrNplnl5WgtoDGMZIu5S3zyLLDYy8=; b=MfRZDiVTcu2A4fq0RwrlzLHU8OqLpMYXJz7APUus2t/g508enAmZX2T+NKh/jKjn/q sdscCPtlVodH/9cjGtVThr9QxM7h9uuiFydG/0pjsKZikM2GaBa4H0gAsPanT7+u2kOe oO1w6rjEHn7imrdLR6c/wtlVAdYpL4TfAjjNE= |
| DomainKey-Signature | a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type; b=swlbckUWGf9wWqFvtpNqqXzdQbupDiVtzdESMx3TQeLdYhkNEM5SmKO8f0L4pit5Te dcPfBBbn7aWXQJePhpRRZQzXg+7VgWGFPUNZeZT4Ub/yM+Y61HBkhYjQTTFuxVa38NaS Y0tFCQ5nkwxV84UKJ9UJqLqotr0Zed9CapBXc= |
| MIME-Version | 1.0 |
| In-Reply-To | <its0ar02sia@news2.newsguy.com> |
| References | <f97b3159-318a-41e2-9f28-339fa4a81d79@k6g2000yqc.googlegroups.com> <its0ar02sia@news2.newsguy.com> |
| From | Ian Kelly <ian.g.kelly@gmail.com> |
| Date | Wed, 22 Jun 2011 01:16:36 -0600 |
| Subject | Re: How can I speed up a script that iterates over a large range (600 billion)? |
| To | Python <python-list@python.org> |
| Content-Type | text/plain; charset=ISO-8859-1 |
| X-BeenThere | python-list@python.org |
| X-Mailman-Version | 2.1.12 |
| Precedence | list |
| List-Id | General discussion list for the Python programming language <python-list.python.org> |
| List-Unsubscribe | <http://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe> |
| List-Archive | <http://mail.python.org/pipermail/python-list> |
| List-Post | <mailto:python-list@python.org> |
| List-Help | <mailto:python-list-request@python.org?subject=help> |
| List-Subscribe | <http://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.273.1308727028.1164.python-list@python.org> (permalink) |
| Lines | 67 |
| NNTP-Posting-Host | 82.94.164.166 |
| X-Trace | 1308727029 news.xs4all.nl 49042 [::ffff:82.94.164.166]:51191 |
| X-Complaints-To | abuse@xs4all.nl |
| Xref | x330-a1.tempe.blueboxinc.net comp.lang.python:8189 |
Show key headers only | View raw
On Tue, Jun 21, 2011 at 11:58 PM, Chris Torek <nospam@torek.net> wrote:
> I was curious about implementing prime factorization as a generator,
> using a prime-number generator to come up with the factors, and
> doing memoization of the generated primes to produce a program that
> does what "factor" does, e.g.:
This is a generator-based sieve I wrote a while back to solve the
PRIME1 problem at SPOJ. The problem is to generate all the prime
numbers within specified ranges, where the numbers are great enough
that a full sieve would run out of memory, and the ranges are wide
enough that a O(sqrt(n)) test on each number would simply take too
long:
https://www.spoj.pl/problems/PRIME1/
The script is not terribly impressive from a technical standpoint, but
what tickles me about it is its bootstrappiness; the set that the
"primes" generator checks to determine whether each number is prime is
actually built from the output of the generator, which itself contains
no actual primality-testing logic. Hope you like it:
8<--------------------------------------------------------------------
import math
def primes(m, n):
# Yield all the primes in the range [m, n), using the nonprimes set
# as a reference. Except for 2, only odd integers are considered.
if m <= 2:
yield 2
m = 3
elif m % 2 == 0:
m += 1 # Force m to be odd.
for p in xrange(m, n, 2):
if p not in nonprimes:
yield p
# Read all the bounds to figure out what we need to store.
bounds = [map(int, raw_input().split(' ')) for t in xrange(input())]
limit = max(n for (m, n) in bounds)
sqrt_limit = int(math.sqrt(limit))
# Mark odd multiples of primes as not prime. Even multiples
# do not need to be marked since primes() won't try them.
nonprimes = set()
for p in primes(3, sqrt_limit+1):
# Mark odd nonprimes within the base range. p*3 is the first
# odd multiple of p; p+p is the increment to get to the next
# odd multiple.
nonprimes.update(xrange(p*3, sqrt_limit+1, p+p))
# Mark odd nonprimes within each of the requested ranges.
for (m, n) in bounds:
# Align m to the first odd multiple of p in the range
# (or the last odd multiple before the range).
m -= (m % (p + p) - p)
m = max(m, p*3)
nonprimes.update(xrange(m, n+1, p+p))
# Generate and write the primes over each input range.
first = True
for (m, n) in bounds:
if not first:
print
first = False
for p in primes(m, n+1):
print p
8<--------------------------------------------------------------------
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 12:48 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Ian Kelly <ian.g.kelly@gmail.com> - 2011-06-21 14:02 -0600
Re: How can I speed up a script that iterates over a large range (600 billion)? Irmen de Jong <irmen@-NOSPAM-xs4all.nl> - 2011-06-21 22:10 +0200
sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Irmen de Jong <irmen@-NOSPAM-xs4all.nl> - 2011-06-21 22:22 +0200
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 14:09 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Irmen de Jong <irmen.NOSPAM@xs4all.nl> - 2011-06-21 23:39 +0200
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Ian Kelly <ian.g.kelly@gmail.com> - 2011-06-21 15:41 -0600
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 14:48 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Vlastimil Brom <vlastimil.brom@gmail.com> - 2011-06-21 23:33 +0200
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Paul Rubin <no.email@nospam.invalid> - 2011-06-21 17:05 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 18:21 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Paul Rubin <no.email@nospam.invalid> - 2011-06-21 19:09 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 20:02 -0700
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Irmen de Jong <irmen.NOSPAM@xs4all.nl> - 2011-06-22 19:46 +0200
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? MRAB <python@mrabarnett.plus.com> - 2011-06-22 03:10 +0100
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? Mel <mwilson@the-wire.com> - 2011-06-21 23:02 -0400
Re: sorry, possibly too much info. was: Re: How can I speed up a script that iterates over a large range (600 billion)? John Salerno <johnjsal@gmail.com> - 2011-06-21 20:41 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Mel <mwilson@the-wire.com> - 2011-06-21 16:19 -0400
Re: How can I speed up a script that iterates over a large range (600 billion)? Tim Roberts <timr@probo.com> - 2011-06-22 23:21 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? MRAB <python@mrabarnett.plus.com> - 2011-06-21 21:26 +0100
Re: How can I speed up a script that iterates over a large range (600 billion)? Terry Reedy <tjreedy@udel.edu> - 2011-06-21 19:30 -0400
Re: How can I speed up a script that iterates over a large range (600 billion)? Paul Rubin <no.email@nospam.invalid> - 2011-06-21 17:00 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Terry Reedy <tjreedy@udel.edu> - 2011-06-22 00:18 -0400
Re: How can I speed up a script that iterates over a large range (600 billion)? Paul Rubin <no.email@nospam.invalid> - 2011-06-21 22:32 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Terry Reedy <tjreedy@udel.edu> - 2011-06-22 18:46 -0400
Re: How can I speed up a script that iterates over a large range (600 billion)? Benjamin Kaplan <benjamin.kaplan@case.edu> - 2011-06-21 20:07 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Chris Torek <nospam@torek.net> - 2011-06-22 05:58 +0000
Re: How can I speed up a script that iterates over a large range (600 billion)? Paul Rubin <no.email@nospam.invalid> - 2011-06-21 23:23 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Slaunger <slaunger@gmail.com> - 2011-06-23 02:52 -0700
Re: How can I speed up a script that iterates over a large range (600 billion)? Ian Kelly <ian.g.kelly@gmail.com> - 2011-06-22 01:16 -0600
Re: How can I speed up a script that iterates over a large range (600 billion)? Anny Mous <b1540457@tyldd.com> - 2011-06-22 22:01 +1000
Re: How can I speed up a script that iterates over a large range (600 billion)? Chris Angelico <rosuav@gmail.com> - 2011-06-22 22:28 +1000
Re: How can I speed up a script that iterates over a large range (600 billion)? Ian Kelly <ian.g.kelly@gmail.com> - 2011-06-22 09:52 -0600
Re: How can I speed up a script that iterates over a large range (600 billion)? MRAB <python@mrabarnett.plus.com> - 2011-06-22 16:33 +0100
csiph-web