muMECH
1.0
|
Mathematic functions. More...
Go to the source code of this file.
Namespaces | |
gelibspace | |
Functions | |
void | gelibspace::shaker (long &n, long *a) |
zlikviduje vicenasobne cifry pro long in <0;..> More... | |
void | gelibspace::sort_4 (long *x) |
Function sorts first four members of array with ascending order. More... | |
void | gelibspace::sort_3 (long *x) |
Function sorts first three members of array with ascending order. More... | |
void | gelibspace::sort_2 (long *x) |
Function sorts first two members of array with ascending order. More... | |
void | gelibspace::solve_3 (const double *m, const double *r, double *l) |
Function solves the system of linear equations. More... | |
void | gelibspace::solve_3 (const double **m, const double *r, double *l) |
Function solves the system of linear equations. More... | |
long | gelibspace::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 + b[1]*x + c[1]*y + d[1] = 0 answer: -1 = infinite number of results 0,1,2 = number of results More... | |
long | gelibspace::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 answer: -1 = infinite number of results 0,1 = number of results More... | |
long | gelibspace::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,1 = number of results More... | |
void | gelibspace::nilling (double zero, double &a) |
double | gelibspace::nillret (double zero, double a) |
bool | gelibspace::isZero (double zero, double a) |
bool | gelibspace::isZero (double abszero, double relzero, double a) |
bool | gelibspace::areSame (double abszero, double relzero, double a, double b) |
long | gelibspace::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 = infinite number of results 0,1,2 = no,one,two results More... | |
long | gelibspace::div_dd (double d1, double d2, const char *s1, const char *s2, const long line) |
long | gelibspace::div_dd (long &answer, double d1, double d2) |
long | gelibspace::div_dd (int &answer, double d1, double d2) |
int | gelibspace::decomp_int (int answer[], int n, int l, int rad) |
long | gelibspace::decomp_int (int answer[], int n, long l, long rad) |
long long | gelibspace::decomp_int (int answer[], int n, long long l, long long rad) |
bool | gelibspace::isNonZero (double x, double tolerance) |
double | gelibspace::sgn (double i) |
Returns the signum of given value (if value is < 0 returns -1, otherwise returns 1) More... | |
Mathematic functions.
Definition in file mathlib.h.