Fix generator

Author: adamant-pwn

cp-algo/number_theory/discrete_log.hpp

@@ -18,7 +18,7 @@ namespace cp_algo::math {
         using base = dynamic_modint<Int>;
         return base::with_mod(m, [&]() -> std::optional<_Int> {
             int sqrtmod = std::max(1, (int)std::sqrt(m) / 2);
-            std::unordered_map<_Int, int> small;
+            big_map<_Int, int> small;
             base cur = a;
             for(int i = 0; i < sqrtmod; i++) {
                 small[cur.getr()] = i;

cp-algo/number_theory/factorize.hpp

@@ -1,6 +1,7 @@
 #ifndef CP_ALGO_MATH_FACTORIZE_HPP
 #define CP_ALGO_MATH_FACTORIZE_HPP
 #include "primality.hpp"
+#include "../util/big_alloc.hpp"
 #include "../random/rng.hpp"
 #include <generator>
 namespace cp_algo::math {
@@ -34,7 +35,7 @@ namespace cp_algo::math {
         });
     }
     template<typename Int>
-    std::generator<Int> factorize(Int m) {
+    big_generator<Int> factorize(Int m) {
         if(is_prime(m)) {
             co_yield m;
         } else if(m > 1) {
@@ -44,7 +45,7 @@ namespace cp_algo::math {
         }
     }
     template<typename Int>
-    std::generator<Int> divisors_sqrt(Int m) {
+    big_generator<Int> divisors_sqrt(Int m) {
         for(Int i = 1; i * i <= m; i++) {
             if(m % i == 0) {
                 co_yield i;

cp-algo/util/big_alloc.hpp

@@ -9,6 +9,7 @@
 #include <string>
 #include <cstddef>
 #include <iostream>
+#include <generator>
 
 // Single macro to detect POSIX platforms (Linux, Unix, macOS)
 #if defined(__linux__) || defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
@@ -19,7 +20,7 @@
 #endif
 
 namespace cp_algo {
-    template <typename T, std::size_t Align = 32>
+    template <typename T, size_t Align = 32>
     class big_alloc {
         static_assert( Align >= alignof(void*), "Align must be at least pointer-size");
         static_assert(std::popcount(Align) == 1, "Align must be a power of two");
@@ -81,5 +82,13 @@ namespace cp_algo {
     using big_queue = std::queue<T, big_deque<T>>;
     template<typename T>
     using big_priority_queue = std::priority_queue<T, big_vector<T>>;
+    template<typename Ref, typename V = void>
+    using big_generator = std::generator<Ref, V, big_alloc<std::byte>>;
+}
+
+// Deduction guide to make elements_of with big_generator default to big_alloc
+namespace std::ranges {
+    template<typename Ref, typename V>
+    elements_of(cp_algo::big_generator<Ref, V>&&) -> elements_of<cp_algo::big_generator<Ref, V>&&, cp_algo::big_alloc<std::byte>>;
 }
 #endif // CP_ALGO_UTIL_big_alloc_HPP