X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=ucw%2Fprime.h;h=eff04d01f1360b0354c531c4434822c75d590b65;hb=a6368763d08042207963c941b1c52b5fafcb0cb3;hp=c0db3e5580b779ce2904112a7d7cab65577a951a;hpb=0b7df598070533b746e6162e53f90af764bd8f83;p=libucw.git

diff --git a/ucw/prime.h b/ucw/prime.h
index c0db3e55..eff04d01 100644
--- a/ucw/prime.h
+++ b/ucw/prime.h
@@ -32,14 +32,14 @@
  * Return a non-zero value iff @x is a prime number.
  * The time complexity is `O(sqrt(x))`.
  **/
-int isprime(uns x);
+int isprime(uint x);
 
 /**
  * Return some prime greater than @x. The function does not checks overflows, but it should
  * be safe at least for @x lower than `1U << 31`.
  * If the Cramer's conjecture is true, it should have complexity `O(sqrt(x) * log(x)^2)`.
  **/
-uns nextprime(uns x);
+uint nextprime(uint x);
 
 /* primetable.c */
 
@@ -48,12 +48,12 @@ uns nextprime(uns x);
  * Returns zero if there is no such prime (we guarantee the existance of at
  * least one prime greater than `1U << 31` in the table).
  **/
-uns next_table_prime(uns x);
+uint next_table_prime(uint x);
 
 /**
  * Quickly lookup a precomputed table to return a prime number smaller than @x.
  * Returns zero if @x is smaller than `7`.
  **/
-uns prev_table_prime(uns x);
+uint prev_table_prime(uint x);
 
 #endif // _UCW_PRIME_H