mymath.h

来自「自己做的常用库和实现的数据结构。public domain.」· C头文件 代码 · 共 108 行

/* Math extension.
 *
 * Written by Cyril Hu ([e-mail]), public domain.
 */
#ifndef _MYMATH_H_
#define _MYMATH_H_

#include "my.h"

/* Get the medium value among all int type para(s). */
int imed(size_t n, ...);

/* Get the medium value among all long type para(s). */
int lmed(size_t n, ...);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Get the medium value among all long long type para(s). */
int llmed(size_t n, ...);
#endif


/* Sum all int type para(s). */
int isum(size_t n, ...);

/* Sum all long type para(s). */
long lsum(size_t n, ...);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Sum all long long type para(s). */
long long llsum(size_t n, ...);
#endif


/* Find the max value among all int type para(s). */
int imax(size_t n, ...);

/* Find the max value among all long type para(s). */
long lmax(size_t n, ...);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Find the max value among all long long type para(s). */
long long llmax(size_t n, ...);
#endif


/* Find the min value among all int type para(s). */
int imin(size_t n, ...);

/* Find the min value among all long type para(s). */
long lmin(size_t n, ...);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Find the min value among all long long type para(s). */
long long llmin(size_t n, ...);
#endif


/* Sum = para1*para2*paraN, all int type... */
int imply(size_t n, ...);

/* Sum = para1*para2*paraN, all long type... */
long lmply(size_t n, ...);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Sum = para1*para2*paraN, all long long type... */
long long llmply(size_t n, ...);
#endif


/* Sum of arithmetic progression array. */
double dsumarpr(double a1, double d, size_t n);

/* Sum of arithmetic progression array. */
int isumarpr(int a1, int d, size_t n);

/* Sum of arithmetic progression array. */
long lsumarpr(long a1, long d, size_t n);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Sum of arithmetic progression array. */
long long llsumarpr(long long a1, long long d, size_t n);
#endif


/* Sum of geometric proportion array. */
double dsumgepr(double a1, double q, size_t n);

/* Sum of geometric proportion array. */
int isumgepr(int a1, int q, size_t n);

/* Sum of geometric proportion array. */
long lsumgepr(long a1, long q, size_t n);

#if defined(__ISOC) && (__ISOC >= 1999)
/* Sum of geometric proportion array. */
long long llsumgepr(long long a1, long long q, size_t n);
#endif


/* Check if n is a prime number or not. */
bool isprime(size_t n);


/* Return the ceil prime value of n. */
size_t ceilprime(double n);

#endif /* _MYMATH_H_ */