Dumpz.org

HTML Copy To Clipboarddone!

<div class="highlight"><pre>#include &lt;memory&gt;
#include &lt;math.h&gt;
#include &lt;time.h&gt;
#include &quot;../generator.h&quot;

typedef unsigned word_t;
const word_t bits_in_word = 8 * sizeof(word_t);

gen_map(nat_type p0, nat_type p1)
 : lo_(p0 * p0)
 , hi_(p1 * p1)
 , bound_((hi_ - lo_) / 2 - 1)
 , arr_(new word_t [bound_ / bits_in_word + 1])
 , i_(~nat_type(0))
 , n_(lo_)
 {
 for (word_t i = 0
 ; i != bound_ / bits_in_word + 1
 ; ++i)
 arr_[i] = word_t(0);
 Primes ps(3);
 for (ps.next(); ps.value() != p1; ps.next())
 {
 const nat_type i = ps.value();
 for (nat_type j = correct(i - lo_ % i, i) / 2 - 1
 ; j &lt; bound_
 ; j += i)
 arr_[j / bits_in_word] |= 1 &lt;&lt; (j % bits_in_word);
 }
 next();
 }

~gen_map()
 { delete[] arr_; }

bool avail() const
 { return i_ != bound_; }

nat_type value() const
 { return n_; }

void next()
 {
 do { ++i_; n_ += 2; }
 while (
 avail() &amp;&amp;
 (arr_[i_ / bits_in_word] &amp; (1 &lt;&lt; (i_ % bits_in_word))));
 }

private:
 static nat_type correct(nat_type n, nat_type i)
 { return n &amp; 1 ? n + i : n; }

const nat_type lo_, hi_, bound_;
 word_t *arr_;
 nat_type i_, n_;
};

template &lt;typename Natural&gt;
inline Natural sqrt_int(Natural x)
{ return static_cast&lt;Natural&gt;(sqrt(static_cast&lt;double&gt;(x))); }

template &lt;typename Natural&gt;
generator(primes, Natural, primes&lt;Natural&gt;)
{
public:
 typedef Natural nat_type;

primes(nat_type n = 2)
 : n_(n)
 , sq_n_(sqrt_int(n))
 { }

emit(nat_type)
 {
 if (n_ &lt;= 2) yield(2);
 if (n_ &lt;= 3) yield(3);
 if (n_ &lt;= 5) yield(5);
 if (n_ &lt;= 7) yield(7);
 ps_.reset(new primes(3));
 ps_-&gt;next();
 p1_ = ps_-&gt;value();
 for (;;)
 {
 p0_ = p1_;
 ps_-&gt;next();
 p1_ = ps_-&gt;value();
 if (p1_ &lt;= sq_n_)
 continue;
 gmap_.reset(new gen_map&lt;primes&gt;(p0_, p1_));
 for (; gmap_-&gt;avail(); gmap_-&gt;next())
 if (gmap_-&gt;value() &gt;= n_)
 yield(gmap_-&gt;value());
 }
 }
 stop_emit()

private:
 const nat_type n_, sq_n_;
 std::auto_ptr&lt;gen_map&lt;primes&gt; &gt; gmap_;
 nat_type p0_, p1_;
 std::auto_ptr&lt;primes&gt; ps_;
};

int main()
{
 primes&lt;word_t&gt; ps(100000000);
 word_t sum = 0;
 long tim0 = clock();
 for (ps.next(); ps.value() &lt;= 120000000; ps.next(), ++sum);
 printf(&quot;sum = %u, time: %0.3f sec.\n&quot;, sum, (clock() - tim0) / 1000.0);
}
</pre></div>
 Colored with <a style="color: #333" href="http://dumpz.org">dumpz.org</a>

BBCODE Copy To Clipboarddone!

[color=#BC7A00]#include <memory>
#include <math.h>
#include <time.h>
#include "../generator.h"
[/color]
[color=#008000][b]typedef[/b][/color] [color=#B00040]unsigned[/color] word_t;
[color=#008000][b]const[/b][/color] word_t bits_in_word [color=#666666]=[/color] [color=#666666]8[/color] [color=#666666]*[/color] [color=#008000][b]sizeof[/b][/color](word_t);

[color=#008000][b]template[/b][/color] [color=#666666]<[/color][color=#008000][b]typename[/b][/color] Primes[color=#666666]>[/color]
[color=#008000][b]struct[/b][/color] gen_map
{
 [color=#008000][b]typedef[/b][/color] [color=#008000][b]typename[/b][/color] Primes[color=#666666]::[/color]nat_type nat_type;

gen_map(nat_type p0, nat_type p1)
 [color=#666666]:[/color] lo_(p0 [color=#666666]*[/color] p0)
 , hi_(p1 [color=#666666]*[/color] p1)
 , bound_((hi_ [color=#666666]-[/color] lo_) [color=#666666]/[/color] [color=#666666]2[/color] [color=#666666]-[/color] [color=#666666]1[/color])
 , arr_([color=#008000][b]new[/b][/color] word_t [bound_ [color=#666666]/[/color] bits_in_word [color=#666666]+[/color] [color=#666666]1[/color]])
 , i_([color=#666666]~[/color]nat_type([color=#666666]0[/color]))
 , n_(lo_)
 {
 [color=#008000][b]for[/b][/color] (word_t i [color=#666666]=[/color] [color=#666666]0[/color]
 ; i [color=#666666]!=[/color] bound_ [color=#666666]/[/color] bits_in_word [color=#666666]+[/color] [color=#666666]1[/color]
 ; [color=#666666]++[/color]i)
 arr_[i] [color=#666666]=[/color] word_t([color=#666666]0[/color]);
 Primes ps([color=#666666]3[/color]);
 [color=#008000][b]for[/b][/color] (ps.next(); ps.value() [color=#666666]!=[/color] p1; ps.next())
 {
 [color=#008000][b]const[/b][/color] nat_type i [color=#666666]=[/color] ps.value();
 [color=#008000][b]for[/b][/color] (nat_type j [color=#666666]=[/color] correct(i [color=#666666]-[/color] lo_ [color=#666666]%[/color] i, i) [color=#666666]/[/color] [color=#666666]2[/color] [color=#666666]-[/color] [color=#666666]1[/color]
 ; j [color=#666666]<[/color] bound_
 ; j [color=#666666]+=[/color] i)
 arr_[j [color=#666666]/[/color] bits_in_word] [color=#666666]|=[/color] [color=#666666]1[/color] [color=#666666]<<[/color] (j [color=#666666]%[/color] bits_in_word);
 }
 next();
 }

[color=#666666]~[/color]gen_map()
    { [color=#008000][b]delete[/b][/color][] arr_; }

[color=#B00040]bool[/color] avail() [color=#008000][b]const[/b][/color]
    { [color=#008000][b]return[/b][/color] i_ [color=#666666]!=[/color] bound_; }

nat_type value() [color=#008000][b]const[/b][/color]
    { [color=#008000][b]return[/b][/color] n_; }

[color=#B00040]void[/color] next()
 {
 [color=#008000][b]do[/b][/color] { [color=#666666]++[/color]i_; n_ [color=#666666]+=[/color] [color=#666666]2[/color]; }
 [color=#008000][b]while[/b][/color] (
 avail() [color=#666666]&&[/color]
 (arr_[i_ [color=#666666]/[/color] bits_in_word] [color=#666666]&[/color] ([color=#666666]1[/color] [color=#666666]<<[/color] (i_ [color=#666666]%[/color] bits_in_word))));
 }

[color=#008000][b]private[/b][/color][color=#666666]:[/color]
    [color=#008000][b]static[/b][/color] nat_type correct(nat_type n, nat_type i)
    { [color=#008000][b]return[/b][/color] n [color=#666666]&[/color] [color=#666666]1[/color] [color=#666666]?[/color] n [color=#666666]+[/color] i [color=#666666]:[/color] n; }

[color=#008000][b]const[/b][/color] nat_type lo_, hi_, bound_;
    word_t [color=#666666]*[/color]arr_;
    nat_type i_, n_;
};

[color=#008000][b]template[/b][/color] [color=#666666]<[/color][color=#008000][b]typename[/b][/color] Natural[color=#666666]>[/color]
[color=#008000][b]inline[/b][/color] Natural sqrt_int(Natural x)
{ [color=#008000][b]return[/b][/color] [color=#008000][b]static_cast[/b][/color][color=#666666]<[/color]Natural[color=#666666]>[/color](sqrt([color=#008000][b]static_cast[/b][/color][color=#666666]<[/color][color=#B00040]double[/color][color=#666666]>[/color](x))); }

[color=#008000][b]template[/b][/color] [color=#666666]<[/color][color=#008000][b]typename[/b][/color] Natural[color=#666666]>[/color]
generator(primes, Natural, primes[color=#666666]<[/color]Natural[color=#666666]>[/color])
{
[color=#008000][b]public[/b][/color][color=#666666]:[/color]
 [color=#008000][b]typedef[/b][/color] Natural nat_type;

primes(nat_type n [color=#666666]=[/color] [color=#666666]2[/color])
        [color=#666666]:[/color] n_(n)
        , sq_n_(sqrt_int(n))
    { }

emit(nat_type)
 {
 [color=#008000][b]if[/b][/color] (n_ [color=#666666]<=[/color] [color=#666666]2[/color]) yield([color=#666666]2[/color]);
 [color=#008000][b]if[/b][/color] (n_ [color=#666666]<=[/color] [color=#666666]3[/color]) yield([color=#666666]3[/color]);
 [color=#008000][b]if[/b][/color] (n_ [color=#666666]<=[/color] [color=#666666]5[/color]) yield([color=#666666]5[/color]);
 [color=#008000][b]if[/b][/color] (n_ [color=#666666]<=[/color] [color=#666666]7[/color]) yield([color=#666666]7[/color]);
 ps_.reset([color=#008000][b]new[/b][/color] primes([color=#666666]3[/color]));
 ps_[color=#666666]->[/color]next();
 p1_ [color=#666666]=[/color] ps_[color=#666666]->[/color]value();
 [color=#008000][b]for[/b][/color] (;;)
 {
 p0_ [color=#666666]=[/color] p1_;
 ps_[color=#666666]->[/color]next();
 p1_ [color=#666666]=[/color] ps_[color=#666666]->[/color]value();
 [color=#008000][b]if[/b][/color] (p1_ [color=#666666]<=[/color] sq_n_)
 [color=#008000][b]continue[/b][/color];
 gmap_.reset([color=#008000][b]new[/b][/color] gen_map[color=#666666]<[/color]primes[color=#666666]>[/color](p0_, p1_));
 [color=#008000][b]for[/b][/color] (; gmap_[color=#666666]->[/color]avail(); gmap_[color=#666666]->[/color]next())
 [color=#008000][b]if[/b][/color] (gmap_[color=#666666]->[/color]value() [color=#666666]>=[/color] n_)
 yield(gmap_[color=#666666]->[/color]value());
 }
 }
 stop_emit()

[color=#008000][b]private[/b][/color][color=#666666]:[/color]
 [color=#008000][b]const[/b][/color] nat_type n_, sq_n_;
 std[color=#666666]::[/color]auto_ptr[color=#666666]<[/color]gen_map[color=#666666]<[/color]primes[color=#666666]>[/color] [color=#666666]>[/color] gmap_;
 nat_type p0_, p1_;
 std[color=#666666]::[/color]auto_ptr[color=#666666]<[/color]primes[color=#666666]>[/color] ps_;
};

[color=#B00040]int[/color] main()
{
 primes[color=#666666]<[/color]word_t[color=#666666]>[/color] ps([color=#666666]100000000[/color]);
 word_t sum [color=#666666]=[/color] [color=#666666]0[/color];
 [color=#B00040]long[/color] tim0 [color=#666666]=[/color] clock();
 [color=#008000][b]for[/b][/color] (ps.next(); ps.value() [color=#666666]<=[/color] [color=#666666]120000000[/color]; ps.next(), [color=#666666]++[/color]sum);
 printf([color=#BA2121]"sum = %u, time: %0.3f sec.[/color][color=#BB6622][b]\n[/b][/color][color=#BA2121]"[/color], sum, (clock() [color=#666666]-[/color] tim0) [color=#666666]/[/color] [color=#666666]1000.0[/color]);
}

--------------------------------------
Colored with http://dumpz.org

Light HTML Copy To Clipboarddone!

That method generates HTML with CSS classes. Hence you'll need the style sheet file

<div class="highlight"><pre>#include &lt;memory&gt;
#include &lt;math.h&gt;
#include &lt;time.h&gt;
#include &quot;../generator.h&quot;

typedef unsigned word_t;
const word_t bits_in_word = 8 * sizeof(word_t);

template &lt;typename Primes&gt;
struct gen_map
{
 typedef typename Primes::nat_type nat_type;

gen_map(nat_type p0, nat_type p1)
 : lo_(p0 * p0)
 , hi_(p1 * p1)
 , bound_((hi_ - lo_) / 2 - 1)
 , arr_(new word_t [bound_ / bits_in_word + 1])
 , i_(~nat_type(0))
 , n_(lo_)
 {
 for (word_t i = 0
 ; i != bound_ / bits_in_word + 1
 ; ++i)
 arr_[i] = word_t(0);
 Primes ps(3);
 for (ps.next(); ps.value() != p1; ps.next())
 {
 const nat_type i = ps.value();
 for (nat_type j = correct(i - lo_ % i, i) / 2 - 1
 ; j &lt; bound_
 ; j += i)
 arr_[j / bits_in_word] |= 1 &lt;&lt; (j % bits_in_word);
 }
 next();
 }

~gen_map()
 { delete[] arr_; }

bool avail() const
 { return i_ != bound_; }

nat_type value() const
 { return n_; }

void next()
 {
 do { ++i_; n_ += 2; }
 while (
 avail() &amp;&amp;
 (arr_[i_ / bits_in_word] &amp; (1 &lt;&lt; (i_ % bits_in_word))));
 }

private:
 static nat_type correct(nat_type n, nat_type i)
 { return n &amp; 1 ? n + i : n; }

const nat_type lo_, hi_, bound_;
 word_t *arr_;
 nat_type i_, n_;
};

template &lt;typename Natural&gt;
inline Natural sqrt_int(Natural x)
{ return static_cast&lt;Natural&gt;(sqrt(static_cast&lt;double&gt;(x))); }

template &lt;typename Natural&gt;
generator(primes, Natural, primes&lt;Natural&gt;)
{
public:
 typedef Natural nat_type;

primes(nat_type n = 2)
 : n_(n)
 , sq_n_(sqrt_int(n))
 { }

emit(nat_type)
 {
 if (n_ &lt;= 2) yield(2);
 if (n_ &lt;= 3) yield(3);
 if (n_ &lt;= 5) yield(5);
 if (n_ &lt;= 7) yield(7);
 ps_.reset(new primes(3));
 ps_-&gt;next();
 p1_ = ps_-&gt;value();
 for (;;)
 {
 p0_ = p1_;
 ps_-&gt;next();
 p1_ = ps_-&gt;value();
 if (p1_ &lt;= sq_n_)
 continue;
 gmap_.reset(new gen_map&lt;primes&gt;(p0_, p1_));
 for (; gmap_-&gt;avail(); gmap_-&gt;next())
 if (gmap_-&gt;value() &gt;= n_)
 yield(gmap_-&gt;value());
 }
 }
 stop_emit()

private:
 const nat_type n_, sq_n_;
 std::auto_ptr&lt;gen_map&lt;primes&gt; &gt; gmap_;
 nat_type p0_, p1_;
 std::auto_ptr&lt;primes&gt; ps_;
};

int main()
{
 primes&lt;word_t&gt; ps(100000000);
 word_t sum = 0;
 long tim0 = clock();
 for (ps.next(); ps.value() &lt;= 120000000; ps.next(), ++sum);
 printf(&quot;sum = %u, time: %0.3f sec.\n&quot;, sum, (clock() - tim0) / 1000.0);
}
</pre></div>
 Colored with <a style="color: #333" href="http://dumpz.org">dumpz.org</a>

Habrahabr.ru HTML Copy To Clipboarddone!

Use that HTML for publications on habrahabr.ru

<blockquote><code>#include&nbsp;&lt;memory&gt;
#include&nbsp;&lt;math.h&gt;
#include&nbsp;&lt;time.h&gt;
#include&nbsp;&quot;../generator.h&quot;

typedef&nbsp;unsigned&nbsp;word_t;
const&nbsp;word_t&nbsp;bits_in_word&nbsp;=&nbsp;8&nbsp;*&nbsp;sizeof(word_t);

template&nbsp;&lt;typename&nbsp;Primes&gt;
struct&nbsp;gen_map
{
&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;typename&nbsp;Primes::nat_type&nbsp;nat_type;

&nbsp;&nbsp;&nbsp;&nbsp;gen_map(nat_type&nbsp;p0,&nbsp;nat_type&nbsp;p1)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;:&nbsp;lo_(p0&nbsp;*&nbsp;p0)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;hi_(p1&nbsp;*&nbsp;p1)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;bound_((hi_&nbsp;-&nbsp;lo_)&nbsp;/&nbsp;2&nbsp;-&nbsp;1)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;arr_(new&nbsp;word_t&nbsp;[bound_&nbsp;/&nbsp;bits_in_word&nbsp;+&nbsp;1])
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;i_(~nat_type(0))
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;n_(lo_)
&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(word_t&nbsp;i&nbsp;=&nbsp;0
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;;&nbsp;i&nbsp;!=&nbsp;bound_&nbsp;/&nbsp;bits_in_word&nbsp;+&nbsp;1
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;;&nbsp;++i)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;arr_[i]&nbsp;=&nbsp;word_t(0);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Primes&nbsp;ps(3);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(ps.next();&nbsp;ps.value()&nbsp;!=&nbsp;p1;&nbsp;ps.next())
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;const&nbsp;nat_type&nbsp;i&nbsp;=&nbsp;ps.value();
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(nat_type&nbsp;j&nbsp;=&nbsp;correct(i&nbsp;-&nbsp;lo_&nbsp;%&nbsp;i,&nbsp;i)&nbsp;/&nbsp;2&nbsp;-&nbsp;1
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;;&nbsp;j&nbsp;&lt;&nbsp;bound_
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;;&nbsp;j&nbsp;+=&nbsp;i)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;arr_[j&nbsp;/&nbsp;bits_in_word]&nbsp;|=&nbsp;1&nbsp;&lt;&lt;&nbsp;(j&nbsp;%&nbsp;bits_in_word);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;next();
&nbsp;&nbsp;&nbsp;&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;~gen_map()
&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;delete[]&nbsp;arr_;&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;avail()&nbsp;const
&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;return&nbsp;i_&nbsp;!=&nbsp;bound_;&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;nat_type&nbsp;value()&nbsp;const
&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;return&nbsp;n_;&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;void&nbsp;next()
&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;do&nbsp;{&nbsp;++i_;&nbsp;n_&nbsp;+=&nbsp;2;&nbsp;}
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;while&nbsp;(
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;avail()&nbsp;&amp;&amp;
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(arr_[i_&nbsp;/&nbsp;bits_in_word]&nbsp;&amp;&nbsp;(1&nbsp;&lt;&lt;&nbsp;(i_&nbsp;%&nbsp;bits_in_word))));
&nbsp;&nbsp;&nbsp;&nbsp;}

private:
&nbsp;&nbsp;&nbsp;&nbsp;static&nbsp;nat_type&nbsp;correct(nat_type&nbsp;n,&nbsp;nat_type&nbsp;i)
&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;return&nbsp;n&nbsp;&amp;&nbsp;1&nbsp;?&nbsp;n&nbsp;+&nbsp;i&nbsp;:&nbsp;n;&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;const&nbsp;nat_type&nbsp;lo_,&nbsp;hi_,&nbsp;bound_;
&nbsp;&nbsp;&nbsp;&nbsp;word_t&nbsp;*arr_;
&nbsp;&nbsp;&nbsp;&nbsp;nat_type&nbsp;i_,&nbsp;n_;
};

template&nbsp;&lt;typename&nbsp;Natural&gt;
inline&nbsp;Natural&nbsp;sqrt_int(Natural&nbsp;x)
{&nbsp;return&nbsp;static_cast&lt;Natural&gt;(sqrt(static_cast&lt;double&gt;(x)));&nbsp;}

template&nbsp;&lt;typename&nbsp;Natural&gt;
generator(primes,&nbsp;Natural,&nbsp;primes&lt;Natural&gt;)
{
public:
&nbsp;&nbsp;&nbsp;&nbsp;typedef&nbsp;Natural&nbsp;nat_type;

&nbsp;&nbsp;&nbsp;&nbsp;primes(nat_type&nbsp;n&nbsp;=&nbsp;2)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;:&nbsp;n_(n)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;,&nbsp;sq_n_(sqrt_int(n))
&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;}

&nbsp;&nbsp;&nbsp;&nbsp;emit(nat_type)
&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(n_&nbsp;&lt;=&nbsp;2)&nbsp;yield(2);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(n_&nbsp;&lt;=&nbsp;3)&nbsp;yield(3);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(n_&nbsp;&lt;=&nbsp;5)&nbsp;yield(5);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(n_&nbsp;&lt;=&nbsp;7)&nbsp;yield(7);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ps_.reset(new&nbsp;primes(3));
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ps_-&gt;next();
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p1_&nbsp;=&nbsp;ps_-&gt;value();
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(;;)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p0_&nbsp;=&nbsp;p1_;
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ps_-&gt;next();
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p1_&nbsp;=&nbsp;ps_-&gt;value();
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(p1_&nbsp;&lt;=&nbsp;sq_n_)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;continue;
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;gmap_.reset(new&nbsp;gen_map&lt;primes&gt;(p0_,&nbsp;p1_));
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(;&nbsp;gmap_-&gt;avail();&nbsp;gmap_-&gt;next())
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(gmap_-&gt;value()&nbsp;&gt;=&nbsp;n_)
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;yield(gmap_-&gt;value());
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}
&nbsp;&nbsp;&nbsp;&nbsp;}
&nbsp;&nbsp;&nbsp;&nbsp;stop_emit()

private:
&nbsp;&nbsp;&nbsp;&nbsp;const&nbsp;nat_type&nbsp;n_,&nbsp;sq_n_;
&nbsp;&nbsp;&nbsp;&nbsp;std::auto_ptr&lt;gen_map&lt;primes&gt;&nbsp;&gt;&nbsp;gmap_;
&nbsp;&nbsp;&nbsp;&nbsp;nat_type&nbsp;p0_,&nbsp;p1_;
&nbsp;&nbsp;&nbsp;&nbsp;std::auto_ptr&lt;primes&gt;&nbsp;ps_;
};

int&nbsp;main()
{
&nbsp;&nbsp;&nbsp;&nbsp;primes&lt;word_t&gt;&nbsp;ps(100000000);
&nbsp;&nbsp;&nbsp;&nbsp;word_t&nbsp;sum&nbsp;=&nbsp;0;
&nbsp;&nbsp;&nbsp;&nbsp;long&nbsp;tim0&nbsp;=&nbsp;clock();
&nbsp;&nbsp;&nbsp;&nbsp;for&nbsp;(ps.next();&nbsp;ps.value()&nbsp;&lt;=&nbsp;120000000;&nbsp;ps.next(),&nbsp;++sum);
&nbsp;&nbsp;&nbsp;&nbsp;printf(&quot;sum&nbsp;=&nbsp;%u,&nbsp;time:&nbsp;%0.3f&nbsp;sec.\n&quot;,&nbsp;sum,&nbsp;(clock()&nbsp;-&nbsp;tim0)&nbsp;/&nbsp;1000.0);
}
</code></blockquote>Colored with <a href="http://dumpz.org">dumpz.org</a>