15 void shaker (
long &n,
long *a);
19 void solve_3 (
const double *m,
const double *r,
double *l);
20 void solve_3 (
const double **m,
const double *r,
double *l);
21 long solv_2nle (
double zero,
const double *a,
const double *b,
const double *c,
const double *d,
double *x,
double *y);
22 long solv_2le (
double zero,
const double *a,
const double *b,
const double *c,
double &x,
double &y);
23 long solv_1le (
double zero,
double a,
double b,
double &x);
24 void nilling (
double zero,
double &a);
25 double nillret (
double zero,
double a);
26 bool isZero (
double zero,
double a);
27 bool isZero (
double abszero,
double relzero,
double a);
28 bool areSame (
double abszero,
double relzero,
double a,
double b);
29 long solv_polynom_2 (
double zero,
double a,
double b,
double c,
double &r1,
double &r2);
31 long div_dd (
double d1,
double d2,
const char* s1,
const char* s2,
const long line);
32 long div_dd (
long &answer,
double d1,
double d2);
33 long div_dd (
int &answer,
double d1,
double d2);
35 int decomp_int (
int answer[],
int n,
int l,
int rad=10);
36 long decomp_int (
int answer[],
int n,
long l,
long rad=10);
37 long long decomp_int (
int answer[],
int n,
long long l,
long long rad=10);
39 bool isNonZero (
double x,
double tolerance);
42 inline double sgn(
double i) {
return ( i < 0. ? -1. : 1. ); }
46 #endif // GELIB_MATH_H double sgn(double i)
Returns the signum of given value (if value is < 0 returns -1, otherwise returns 1) ...
bool isNonZero(double x, double tolerance)
long solv_1le(double zero, double a, double b, double &x)
function solves linear equation: a*x + b = 0 answer: -1 = infinite number of results 0...
void solve_3(const double *m, const double *r, double *l)
Function solves the system of linear equations.
long solv_2nle(double zero, const double *a, const double *b, const double *c, const double *d, double *x, double *y)
function solves system of two non-linear equations: a[0]*x*y + b[0]*x + c[0]*y + d[0] = 0 a[1]*x*y + ...
double nillret(double zero, double a)
void shaker(long &n, long *a)
zlikviduje vicenasobne cifry pro long in <0;..>
long div_dd(double d1, double d2, const char *s1, const char *s2, const long line)
void sort_2(long *x)
Function sorts first two members of array with ascending order.
long solv_2le(double zero, const double *a, const double *b, const double *c, double &x, double &y)
function solves system of two linear equations: a[0]*x + b[0]*y + c[0] = 0 a[1]*x + b[1]*y + c[1] = 0...
int decomp_int(int answer[], int n, int l, int rad)
long solv_polynom_2(double zero, double a, double b, double c, double &r1, double &r2)
function searchs roots of polynom of 2nd order = quadratic equation a*x^2 + b*x + c = 0 answer: -1 = ...
void sort_4(long *x)
Function sorts first four members of array with ascending order.
void nilling(double zero, double &a)
bool areSame(double abszero, double relzero, double a, double b)
bool isZero(double zero, double a)
void sort_3(long *x)
Function sorts first three members of array with ascending order.