75 lines
1.3 KiB
C
75 lines
1.3 KiB
C
|
|
||
|
/* -- translated by f2c (version 19940927).
|
||
|
You must link the resulting object file with the libraries:
|
||
|
-lf2c -lm (in that order)
|
||
|
*/
|
||
|
|
||
|
#include "f2c.h"
|
||
|
|
||
|
/* Subroutine */ int ccopy_(integer *n, complex *cx, integer *incx, complex *
|
||
|
cy, integer *incy)
|
||
|
{
|
||
|
|
||
|
|
||
|
/* System generated locals */
|
||
|
integer i__1, i__2, i__3;
|
||
|
|
||
|
/* Local variables */
|
||
|
static integer i, ix, iy;
|
||
|
|
||
|
|
||
|
/* copies a vector, x, to a vector, y.
|
||
|
jack dongarra, linpack, 3/11/78.
|
||
|
modified 12/3/93, array(1) declarations changed to array(*)
|
||
|
|
||
|
|
||
|
|
||
|
Parameter adjustments
|
||
|
Function Body */
|
||
|
#define CY(I) cy[(I)-1]
|
||
|
#define CX(I) cx[(I)-1]
|
||
|
|
||
|
|
||
|
if (*n <= 0) {
|
||
|
return 0;
|
||
|
}
|
||
|
if (*incx == 1 && *incy == 1) {
|
||
|
goto L20;
|
||
|
}
|
||
|
|
||
|
/* code for unequal increments or equal increments
|
||
|
not equal to 1 */
|
||
|
|
||
|
ix = 1;
|
||
|
iy = 1;
|
||
|
if (*incx < 0) {
|
||
|
ix = (-(*n) + 1) * *incx + 1;
|
||
|
}
|
||
|
if (*incy < 0) {
|
||
|
iy = (-(*n) + 1) * *incy + 1;
|
||
|
}
|
||
|
i__1 = *n;
|
||
|
for (i = 1; i <= *n; ++i) {
|
||
|
i__2 = iy;
|
||
|
i__3 = ix;
|
||
|
CY(iy).r = CX(ix).r, CY(iy).i = CX(ix).i;
|
||
|
ix += *incx;
|
||
|
iy += *incy;
|
||
|
/* L10: */
|
||
|
}
|
||
|
return 0;
|
||
|
|
||
|
/* code for both increments equal to 1 */
|
||
|
|
||
|
L20:
|
||
|
i__1 = *n;
|
||
|
for (i = 1; i <= *n; ++i) {
|
||
|
i__2 = i;
|
||
|
i__3 = i;
|
||
|
CY(i).r = CX(i).r, CY(i).i = CX(i).i;
|
||
|
/* L30: */
|
||
|
}
|
||
|
return 0;
|
||
|
} /* ccopy_ */
|
||
|
|