root / www / HPL_dswap.html
Historique | Voir | Annoter | Télécharger (2,22 ko)
1 | 1 | equemene | <HTML>
|
---|---|---|---|
2 | 1 | equemene | <HEAD>
|
3 | 1 | equemene | <TITLE>HPL_dswap HPL 2.0 Library Functions September 10, 2008</TITLE> |
4 | 1 | equemene | </HEAD>
|
5 | 1 | equemene | |
6 | 1 | equemene | <BODY BGCOLOR="WHITE" TEXT = "#000000" LINK = "#0000ff" VLINK = "#000099" |
7 | 1 | equemene | ALINK = "#ffff00"> |
8 | 1 | equemene | |
9 | 1 | equemene | <H1>Name</H1> |
10 | 1 | equemene | <B>HPL_dswap</B> y <-> x. |
11 | 1 | equemene | |
12 | 1 | equemene | <H1>Synopsis</H1> |
13 | 1 | equemene | <CODE>#include "hpl.h"</CODE><BR><BR> |
14 | 1 | equemene | <CODE>void</CODE> |
15 | 1 | equemene | <CODE>HPL_dswap(</CODE> |
16 | 1 | equemene | <CODE>const int</CODE> |
17 | 1 | equemene | <CODE>N</CODE>, |
18 | 1 | equemene | <CODE>double *</CODE> |
19 | 1 | equemene | <CODE>X</CODE>, |
20 | 1 | equemene | <CODE>const int</CODE> |
21 | 1 | equemene | <CODE>INCX</CODE>, |
22 | 1 | equemene | <CODE>double *</CODE> |
23 | 1 | equemene | <CODE>Y</CODE>, |
24 | 1 | equemene | <CODE>const int</CODE> |
25 | 1 | equemene | <CODE>INCY</CODE> |
26 | 1 | equemene | <CODE>);</CODE> |
27 | 1 | equemene | |
28 | 1 | equemene | <H1>Description</H1> |
29 | 1 | equemene | <B>HPL_dswap</B> |
30 | 1 | equemene | swaps the vectors x and y. |
31 | 1 | equemene | |
32 | 1 | equemene | <H1>Arguments</H1> |
33 | 1 | equemene | <PRE>
|
34 | 1 | equemene | N (local input) const int |
35 | 1 | equemene | On entry, N specifies the length of the vectors x and y. N |
36 | 1 | equemene | must be at least zero. |
37 | 1 | equemene | </PRE>
|
38 | 1 | equemene | <PRE>
|
39 | 1 | equemene | X (local input/output) double * |
40 | 1 | equemene | On entry, X is an incremented array of dimension at least |
41 | 1 | equemene | ( 1 + ( n - 1 ) * abs( INCX ) ) that contains the vector x. |
42 | 1 | equemene | On exit, the entries of the incremented array X are updated |
43 | 1 | equemene | with the entries of the incremented array Y. |
44 | 1 | equemene | </PRE>
|
45 | 1 | equemene | <PRE>
|
46 | 1 | equemene | INCX (local input) const int |
47 | 1 | equemene | On entry, INCX specifies the increment for the elements of X. |
48 | 1 | equemene | INCX must not be zero. |
49 | 1 | equemene | </PRE>
|
50 | 1 | equemene | <PRE>
|
51 | 1 | equemene | Y (local input/output) double * |
52 | 1 | equemene | On entry, Y is an incremented array of dimension at least |
53 | 1 | equemene | ( 1 + ( n - 1 ) * abs( INCY ) ) that contains the vector y. |
54 | 1 | equemene | On exit, the entries of the incremented array Y are updated |
55 | 1 | equemene | with the entries of the incremented array X. |
56 | 1 | equemene | </PRE>
|
57 | 1 | equemene | <PRE>
|
58 | 1 | equemene | INCY (local input) const int |
59 | 1 | equemene | On entry, INCY specifies the increment for the elements of Y. |
60 | 1 | equemene | INCY must not be zero. |
61 | 1 | equemene | </PRE>
|
62 | 1 | equemene | |
63 | 1 | equemene | <H1>Example</H1> |
64 | 1 | equemene | <CODE>#include "hpl.h"</CODE><BR><BR> |
65 | 1 | equemene | <PRE>
|
66 | 1 | equemene | int main(int argc, char *argv[]) |
67 | 1 | equemene | { |
68 | 1 | equemene | double x[3], y[3]; |
69 | 1 | equemene | x[0] = 1.0; x[1] = 2.0; x[2] = 3.0; |
70 | 1 | equemene | y[0] = 4.0; y[1] = 5.0; y[2] = 6.0; |
71 | 1 | equemene | HPL_dswap( 3, x, 1, y, 1 ); |
72 | 1 | equemene | printf("x=[%f,%f,%f]\n", x[0], x[1], x[2]); |
73 | 1 | equemene | printf("y=[%f,%f,%f]\n", y[0], y[1], y[2]); |
74 | 1 | equemene | exit(0); return(0); |
75 | 1 | equemene | } |
76 | 1 | equemene | </PRE>
|
77 | 1 | equemene | |
78 | 1 | equemene | <H1>See Also</H1> |
79 | 1 | equemene | <A HREF="HPL_daxpy.html">HPL_daxpy</A>, |
80 | 1 | equemene | <A HREF="HPL_dcopy.html">HPL_dcopy</A>, |
81 | 1 | equemene | <A HREF="HPL_dscal.html">HPL_dscal</A>. |
82 | 1 | equemene | |
83 | 1 | equemene | </BODY>
|
84 | 1 | equemene | </HTML> |