63     NumberType m;  member in Multiples
65         m = NumberType(sqrt(double(n)));  in Multiples()
67         m += m & 1;  in Multiples()
68         my_is_composite = new bool[m / 2];  in Multiples()
69         my_striker = new NumberType[m / 2];  in Multiples()
70         my_factor = new NumberType[m / 2];  in Multiples()
72         memset(my_is_composite, 0, m / 2);  in Multiples()
73         for (NumberType i = 3; i < m; i += 2) {  in Multiples()
77                 my_striker[n_factor] = strike(i / 2, m / 2, i);  in Multiples()
89             my_striker[k] = strike(my_striker[k] - m / 2, window_size / 2, my_factor[k]);  in find_primes_in_window()
114               m(f.m),  in Multiples()
125         my_is_composite = new bool[m / 2];  in initialize()
126         my_striker = new NumberType[m / 2];  in initialize()
129             NumberType p = (start - 1) / f * f % m;  in initialize()
131             assert(m / 2 <= my_striker[k]);  in initialize()
162         NumberType window_size = multiples.m;  in SerialCountPrimes()
163         for (NumberType j = multiples.m; j <= n; j += window_size) {  in SerialCountPrimes()
252         NumberType m = multiples.m;  in operator ()()  local
263         NumberType window_size = m;  in operator ()()
265             assert(j % multiples.m == 0);  in operator ()()
301         oneapi::tbb::parallel_reduce(SieveRange(s.multiples.m, n, s.multiples.m, grain_size),  in ParallelCountPrimes()