Legendre prime counting function: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,174: / Line 1,174: @@
         nri := 0
         for ori := 0; ori < rilmt; ori++ {
-            q := int(roughs[ori])
+            r := int(roughs[ori])
-            pi := q >> 1
+            rci := r >> 1
-            if (cullbuf[pi>>3] & masks[pi&7]) != 0 {
+            if (cullbuf[rci>>3] & masks[rci&7]) != 0 {
                 continue
             }
-            d := q * bp
+            d := r * bp
             t := int64(0)
             if d <= rtlmt {
@@ Line 1,187: / Line 1,187: @@
             }
             larges[nri] = larges[ori] - t + int64(nbps)
-            roughs[nri] = uint32(q)
+            roughs[nri] = uint32(r)
             nri++
         }