qwt_math.h.3

软件无线电的平台

.TH "qwt_math.h" 3 "4 Nov 2003" "Qwt User's Guide" \" -*- nroff -*-
.ad l
.nh
.SH NAME
qwt_math.h \- 
.SH "Detailed Description"
.PP 
A set of mathematical routines. 


.PP
.SH SYNOPSIS
.br
.PP
.SS "Defines"

.in +1c
.ti -1c
.RI "#define \fBLOG10_2\fP   0.30102999566398119802"
.br
.ti -1c
.RI "#define \fBLOG10_3\fP   0.47712125471966243540"
.br
.ti -1c
.RI "#define \fBLOG10_5\fP   0.69897000433601885749"
.br
.ti -1c
.RI "#define \fBM_2PI\fP   6.28318530717958623200"
.br
.ti -1c
.RI "#define \fBLOG_MIN\fP   1.0e-100"
.br
.ti -1c
.RI "#define \fBLOG_MAX\fP   1.0e100"
.br
.ti -1c
.RI "#define \fBM_E\fP   2.7182818284590452354"
.br
.ti -1c
.RI "#define \fBM_LOG2E\fP   1.4426950408889634074"
.br
.ti -1c
.RI "#define \fBM_LN2\fP   0.69314718055994530942"
.br
.ti -1c
.RI "#define \fBM_LN10\fP   2.30258509299404568402"
.br
.ti -1c
.RI "#define \fBM_PI\fP   3.14159265358979323846"
.br
.ti -1c
.RI "#define \fBM_PI_2\fP   1.57079632679489661923"
.br
.ti -1c
.RI "#define \fBM_PI_4\fP   0.78539816339744830962"
.br
.ti -1c
.RI "#define \fBM_1_PI\fP   0.31830988618379067154"
.br
.ti -1c
.RI "#define \fBM_2_PI\fP   0.63661977236758134308"
.br
.ti -1c
.RI "#define \fBM_2_SQRTPI\fP   1.12837916709551257390"
.br
.ti -1c
.RI "#define \fBM_SQRT2\fP   1.41421356237309504880"
.br
.ti -1c
.RI "#define \fBM_SQRT1_2\fP   0.70710678118654752440"
.br
.ti -1c
.RI "#define \fBqwtMax\fP   QMAX"
.br
.ti -1c
.RI "#define \fBqwtMin\fP   QMIN"
.br
.ti -1c
.RI "#define \fBqwtAbs\fP   QABS"
.br
.ti -1c
.RI "#define \fBqwtInt\fP   qRound"
.br
.in -1c
.SS "Functions"

.in +1c
.ti -1c
.RI "double \fBqwtCeil125\fP (double x)"
.br
.ti -1c
.RI "double \fBqwtFloor125\fP (double x)"
.br
.ti -1c
.RI "double \fBqwtGetMin\fP (double *array, int size)"
.br
.ti -1c
.RI "double \fBqwtGetMax\fP (double *array, int size)"
.br
.ti -1c
.RI "void \fBqwtTwistArray\fP (double *array, int size)"
.br
.ti -1c
.RI "int \fBqwtChkMono\fP (double *array, int size)"
.br
.ti -1c
.RI "void \fBqwtLinSpace\fP (double *array, int size, double xmin, double xmax)"
.br
.ti -1c
.RI "void \fBqwtLogSpace\fP (double *array, int size, double xmin, double xmax)"
.br
.ti -1c
.RI "template<class T> int \fBqwtSign\fP (const  T &x)"
.br
.ti -1c
.RI "template<class T> T \fBqwtSqr\fP (const  T &x)"
.br
.ti -1c
.RI "template<class T> void \fBqwtCopyArray\fP (T *dest, T *src, int n)"
.br
.ti -1c
.RI "template<class T> void \fBqwtShiftArray\fP (T *arr, int size, int di)"
.br
.ti -1c
.RI "template<class T> void \fBqwtSwap\fP (T &x1, T &x2)"
.br
.ti -1c
.RI "template<class T> void \fBqwtSort\fP (const  T &x1, const  T &x2, T &xmin, T &xmax)"
.br
.ti -1c
.RI "template<class T> void \fBqwtSort\fP (T &x1, T &x2)"
.br
.ti -1c
.RI "template<class T> T \fBqwtLim\fP (const  T &x, const  T &x1, const  T &x2)"
.br
.ti -1c
.RI "QPoint \fBqwtPolar2Pos\fP (const  QPoint &center, double radius, double angle)"
.br
.ti -1c
.RI "QPoint \fBqwtDegree2Pos\fP (const  QPoint &center, double radius, double angle)"
.br
.in -1c
.SH "Function Documentation"
.PP 
.SS "double qwtCeil125 (double x)"
.PP
Find the smallest value out of {1,2,5}*10^n with an integer number n which is greater than or equal to x. \fBParameters:\fP
.RS 4
\fIx\fP Input value 
.RE
.PP

.SS "int qwtChkMono (double * array, int size)"
.PP
Checks if an array is a strictly monotonic sequence. \fBParameters:\fP
.RS 4
\fIarray\fP Pointer to an array 
.br
\fIsize\fP Size of the array 
.RE
.PP
\fBReturns:\fP
.RS 4
.IP "\fB0\fP" 1c
sequence is not strictly monotonic 
.IP "\fB1\fP" 1c
sequence is strictly monotonically increasing 
.IP "\fB-1\fP" 1c
sequence is strictly monotonically decreasing 
.PP
.RE
.PP

.SS "template<class T> void qwtCopyArray (T * dest, T * src, int n)"
.PP
Copy an array into another. \fBParameters:\fP
.RS 4
\fIdest\fP Destination 
.br
\fIsrc\fP Source 
.br
\fIn\fP Number of elements 
.RE
.PP

.SS "double qwtFloor125 (double x)"
.PP
Find the largest value out of {1,2,5}*10^n with an integer number n which is smaller than or equal to x. \fBParameters:\fP
.RS 4
\fIx\fP Input value 
.RE
.PP

.SS "double qwtGetMax (double * array, int size)"
.PP
Find the largest value in an array. \fBParameters:\fP
.RS 4
\fIarray\fP Pointer to an array 
.br
\fIsize\fP Array size 
.RE
.PP

.SS "double qwtGetMin (double * array, int size)"
.PP
Find the smallest value in an array. \fBParameters:\fP
.RS 4
\fIarray\fP Pointer to an array 
.br
\fIsize\fP Array size 
.RE
.PP

.SS "template<class T> T qwtLim (const T & x, const T & x1, const T & x2)"
.PP
Limit a value to fit into a specified interval. \fBParameters:\fP
.RS 4
\fIx\fP Input value 
.br
\fIx1\fP First interval boundary 
.br
\fIx2\fP Second interval boundary 
.RE
.PP

.SS "void qwtLinSpace (double * array, int size, double xmin, double xmax)"
.PP
Create an array of equally spaced values. \fBParameters:\fP
.RS 4
\fIarray\fP Where to put the values 
.br
\fIsize\fP Size of the array 
.br
\fIxmin\fP Value associated with index 0 
.br
\fIxmax\fP Value associated with index (size-1) 
.RE
.PP

.SS "void qwtLogSpace (double * array, int size, double xmin, double xmax)"
.PP
Create an array of logarithmically equally spaced values. \fBParameters:\fP
.RS 4
\fIarray\fP Where to put the values 
.br
\fIsize\fP Size of the array 
.br
\fIxmin\fP Value associated with index 0 
.br
\fIxmax\fP Value associated with index (size-1) 
.RE
.PP

.SS "template<class T> void qwtShiftArray (T * arr, int size, int di)"
.PP
Shift an array by a specified number of positions. \fBParameters:\fP
.RS 4
\fIarr\fP Pointer to an array 
.br
\fIsize\fP Number of elements 
.br
\fIdi\fP Number of positions. A positive number shifts right, a negative number shifts left. 
.RE
.PP

.SS "template<class T> int qwtSign (const T & x)"
.PP
Return the sign. 
.SS "template<class T> void qwtSort (T & x1, T & x2)"
.PP
Sort two values in ascending order. 
.SS "template<class T> void qwtSort (const T & x1, const T & x2, T & xmin, T & xmax)"
.PP
Sort two values in ascending order. \fBParameters:\fP
.RS 4
\fIx1\fP First input value 
.br
\fIx2\fP Second input value 
.br
\fIxmax\fP Greater value 
.br
\fIxmin\fP Smaller value 
.RE
.PP

.SS "template<class T> T qwtSqr (const T & x)"
.PP
Return the square of a number. 
.SS "template<class T> void qwtSwap (T & x1, T & x2)"
.PP
Swap two values. 
.SS "void qwtTwistArray (double * array, int size)"
.PP
Invert the order of array elements. \fBParameters:\fP
.RS 4
\fIarray\fP Pointer to an array 
.br
\fIsize\fP Size of the array 
.RE
.PP

.SH "Author"
.PP 
Generated automatically by Doxygen for Qwt User's Guide from the source code.