up

benchmarks/primes.py

@@ -0,0 +1,116 @@
+import time
+_0 = time.time()
+
+UPPER_BOUND = 5000000
+PREFIX = 32338
+
+class Node:
+    def __init__(self):
+        self.children = {}
+        self.terminal = False
+
+
+class Sieve:
+    def __init__(self, limit):
+        self.limit = limit
+        self.prime = [False] * (limit + 1)
+
+    def to_list(self):
+        result = [2, 3]
+        for p in range(5, self.limit + 1):
+            if self.prime[p]:
+                result.append(p)
+        return result
+
+    def omit_squares(self):
+        r = 5
+        while r * r < self.limit:
+            if self.prime[r]:
+                i = r * r
+                while i < self.limit:
+                    self.prime[i] = False
+                    i = i + r * r
+            r = r + 1
+        return self
+
+    def step1(self, x, y):
+        n = (4 * x * x) + (y * y)
+        if n <= self.limit and (n % 12 == 1 or n % 12 == 5):
+            self.prime[n] = not self.prime[n]
+
+    def step2(self, x, y):
+        n = (3 * x * x) + (y * y)
+        if n <= self.limit and n % 12 == 7:
+            self.prime[n] = not self.prime[n]
+
+    def step3(self, x, y):
+        n = (3 * x * x) - (y * y)
+        if x > y and n <= self.limit and n % 12 == 11:
+            self.prime[n] = not self.prime[n]
+
+    def loop_y(self, x):
+        y = 1
+        while y * y < self.limit:
+            self.step1(x, y)
+            self.step2(x, y)
+            self.step3(x, y)
+            y = y + 1
+
+    def loop_x(self):
+        x = 1
+        while x * x < self.limit:
+            self.loop_y(x)
+            x = x + 1
+
+    def calc(self):
+        self.loop_x()
+        return self.omit_squares()
+
+
+def generate_trie(l):
+    root = Node()
+    for el in l:
+        head = root
+        for ch in str(el):
+            if ch not in head.children:
+                head.children[ch] = Node()
+            head = head.children[ch]
+        head.terminal = True
+    return root
+
+
+def find(upper_bound, prefix):
+    primes = Sieve(upper_bound).calc()
+    str_prefix = str(prefix)
+    head = generate_trie(primes.to_list())
+    for ch in str_prefix:
+        if ch not in head.children:
+            return None
+        head = head.children[ch]
+        if head is None:
+            return None
+
+    queue, result = [(head, str_prefix)], []
+    while queue:
+        top, prefix = queue.pop()
+        if top.terminal:
+            result.append(int(prefix))
+        for ch, v in top.children.items():
+            queue.insert(0, (v, prefix + ch))
+
+    result.sort()
+    return result
+
+
+def verify():
+    left = [2, 23, 29]
+    right = find(100, 2)
+    if left != right:
+        print(f"{left} != {right}")
+        exit(1)
+
+verify()
+results = find(UPPER_BOUND, PREFIX)
+assert results == [323381, 323383, 3233803, 3233809, 3233851, 3233863, 3233873, 3233887, 3233897]
+
+print(round(time.time()-_0, 6), 's')

benchmarks/simple.py

@@ -1,3 +1,6 @@
+import time
+_0 = time.time()
+
 def is_prime(x):
   if x<2:
     return False
@@ -17,4 +20,5 @@ def test(n):
 # dis(test)
 # dis(is_prime)
 
-print(test(10000))
+print(test(10000))
+print(round(time.time()-_0, 6), 's')

benchmarks/sort.py

@@ -0,0 +1,9 @@
+import time
+_0 = time.time()
+
+import random
+
+a = [random.randint(-100000, 100000) for i in range(1500)]
+a = sorted(a)
+
+print(round(time.time()-_0, 6), 's')

src/main.cpp

@@ -1,20 +1,6 @@
 #include <fstream>
-#include <functional>
-
 #include "pocketpy.h"
 
-struct Timer{
-    const char* title;
-    Timer(const char* title) : title(title) {}
-    void run(std::function<void()> f){
-        auto start = std::chrono::high_resolution_clock::now();
-        f();
-        auto end = std::chrono::high_resolution_clock::now();
-        double elapsed = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count() / 1000000.0;
-        std::cout << title << ": " << elapsed << " s" << std::endl;
-    }
-};
-
 #ifndef __EMSCRIPTEN__
 
 int main(int argc, char** argv){
@@ -48,14 +34,7 @@ int main(int argc, char** argv){
         }
         std::string src((std::istreambuf_iterator<char>(file)), std::istreambuf_iterator<char>());
         PyVarOrNull ret = nullptr;
-
-        if(filename.find("t1.py") != std::string::npos || filename.find("t2.py") != std::string::npos){
-            Timer("Running time").run([&]{
-                ret = vm->exec(src.c_str(), filename, EXEC_MODE);
-            });
-        }else{
-            ret = vm->exec(src.c_str(), filename, EXEC_MODE);
-        }
+        ret = vm->exec(src.c_str(), filename, EXEC_MODE);
         pkpy_delete(vm);
         return ret != nullptr ? 0 : 1;
     }

tests/t2.py

@@ -1,4 +0,0 @@
-import random
-
-a = [random.randint(-100000, 100000) for i in range(1500)]
-a = sorted(a)