prime_sieve 0.0.1 → 0.0.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/ext/prime_sieve/prime_sieve.c +4 -3
- metadata +1 -1
checksums.yaml
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
---
|
|
2
2
|
SHA1:
|
|
3
|
-
metadata.gz:
|
|
4
|
-
data.tar.gz:
|
|
3
|
+
metadata.gz: eb78e6e18b89e3073887e1bc8e9da91ddc31b96f
|
|
4
|
+
data.tar.gz: 20c6136ccc3f305479f0a0e07ae6d4dcc775e03d
|
|
5
5
|
SHA512:
|
|
6
|
-
metadata.gz:
|
|
7
|
-
data.tar.gz:
|
|
6
|
+
metadata.gz: 608095052fec7d2e3bf4de8b12caa9c68f81d2988bd88161c6ae9c1e18148e873ac5a9403f39621acd850c6800c09b84dc5c26e38896b269cb669669d505f831
|
|
7
|
+
data.tar.gz: c62d0bfe9204010b38a73a59c06d9c42a3cae9cef10c943e1b5cc80593c22c717b014822a3aa0d1db8af55357ee4aba589932eb1bb816869b7613a67d7eb8fe7
|
|
@@ -3,10 +3,10 @@
|
|
|
3
3
|
VALUE mPrimeSieve;
|
|
4
4
|
|
|
5
5
|
static VALUE generate_primes(VALUE self, VALUE start, VALUE stop) {
|
|
6
|
-
size_t size;
|
|
6
|
+
size_t size, i;
|
|
7
7
|
uint64_t* primes = (uint64_t *) primesieve_generate_primes(NUM2ULL(start), NUM2ULL(stop), &size, UINT64_PRIMES);
|
|
8
8
|
VALUE ruby_primes = rb_ary_new2(size);
|
|
9
|
-
for(
|
|
9
|
+
for(i = 0; i < size; i++) {
|
|
10
10
|
rb_ary_store(ruby_primes, i, ULL2NUM(primes[i]));
|
|
11
11
|
}
|
|
12
12
|
primesieve_free(primes);
|
|
@@ -14,9 +14,10 @@ static VALUE generate_primes(VALUE self, VALUE start, VALUE stop) {
|
|
|
14
14
|
}
|
|
15
15
|
|
|
16
16
|
static VALUE generate_n_primes(VALUE self, VALUE n, VALUE start) {
|
|
17
|
+
long i;
|
|
17
18
|
uint64_t* primes = (uint64_t *) primesieve_generate_n_primes(NUM2ULL(n), NUM2ULL(start), UINT64_PRIMES);
|
|
18
19
|
VALUE ruby_primes = rb_ary_new2(NUM2LONG(n));
|
|
19
|
-
for(
|
|
20
|
+
for(i = 0; i < NUM2LONG(n); i++) {
|
|
20
21
|
rb_ary_store(ruby_primes, i, ULL2NUM(primes[i]));
|
|
21
22
|
}
|
|
22
23
|
primesieve_free(primes);
|