- abs
-
int abs(int i)
return an integer absolute value ../include/math.h l.25 manpage: abs
- div
-
div_t div(int numerator, int denominator)
compute the quotient and remainder of an integer division Size: ~84B ../include/math.h l.8 manpage: div
- djb2_hash
-
unsigned long djb2_hash(const unsigned char *str)
hashes, from d.j.Bernstein (http://www.cse.yorku.ca/~oz/hash.html) I've tested djb2_hash, and it gives quite good results. I'm sure, Bernstein did think and test his algorithm sincerely. When combining djb2_hash and sdbm_hash, the probability of collisions might tend to zero. Me I'm going this way. I guess. I might check djb2_hash for collisions within a space of around 8 digits. The hash functions compute the hashes of a c string with a 0 at the end. The cksum functions do work with a pointer and a given len.
Size: ~86B ../src/math/hashes.c l.12
- labs
-
long int labs(long int i)
return a long integer absolute value Size: ~46B ../include/math.h l.30 manpage: labs
- ldiv
-
ldiv_t ldiv(long int numerator, long int denominator)
compute quotient and remainder of a long division Size: ~82B ../include/math.h l.16 manpage: ldiv
- rand
-
unsigned int rand()
Size: ~118B ../src/math/rand.c l.7 manpage: rand
- sdbm_hash
-
unsigned long sdbm_hash(const unsigned char *str)
Size: ~80B ../src/math/sdbm_hash.c l.3
- srand
-
void srand( unsigned int i )
pseudo-random number generator Size: ~48B ../src/math/srand.c l.4 manpage: srand