F06DFF (PDF version)
F06 Chapter Contents
F06 Chapter Introduction
NAG Library Manual
NAG Library Routine Document
F06DFF
Note:
before using this routine, please read the Users' Note for your implementation to check the interpretation of
bold italicised
terms and other implementation-dependent details.
▸
▿
Contents
1
Purpose
2
Specification
3
Description
4
References
5
Parameters
6
Error Indicators and Warnings
7
Accuracy
8
Parallelism and Performance
9
Further Comments
10
Example
1 Purpose
F06DFF copies an integer vector.
2 Specification
SUBROUTINE F06DFF (
N
,
X
,
INCX
,
Y
,
INCY
)
INTEGER
N, X(*), INCX, Y(*), INCY
3 Description
F06DFF performs the operation
y
←
x
where
x
and
y
are
n
-element integer vectors scattered with stride
INCX
and
INCY
respectively.
4 References
None.
5 Parameters
1:
N
– INTEGER
Input
On entry
:
n
, the number of elements in
x
and
y
.
2:
X
*
– INTEGER array
Input
Note:
the dimension of the array
X
must be at least
max
1
,
1
+
N
-
1
×
INCX
.
On entry
: the
n
-element vector
x
.
If
INCX
>
0
,
x
i
must be stored in
X
1
+
i
-
1
×
INCX
, for
i
=
1
,
2
,
…
,
N
.
If
INCX
<
0
,
x
i
must be stored in
X
1
-
N
-
i
×
INCX
, for
i
=
1
,
2
,
…
,
N
.
Intermediate elements of
X
are not referenced.
3:
INCX
– INTEGER
Input
On entry
: the increment in the subscripts of
X
between successive elements of
x
.
4:
Y
*
– INTEGER array
Output
Note:
the dimension of the array
Y
must be at least
max
1
,
1
+
N
-
1
×
INCY
.
On exit
: the vector
y
.
If
INCY
>
0
,
y
i
will be stored in
Y
1
+
i
-
1
×
INCY
, for
i
=
1
,
2
,
…
,
N
.
If
INCY
<
0
,
y
i
will be stored in
Y
1
-
N
-
i
×
INCY
, for
i
=
1
,
2
,
…
,
N
.
Intermediate elements of
Y
are unchanged.
5:
INCY
– INTEGER
Input
On entry
: the increment in the subscripts of
Y
between successive elements of
y
.
6 Error Indicators and Warnings
None.
7 Accuracy
Not applicable.
8 Parallelism and Performance
Not applicable.
9 Further Comments
None.
10 Example
None.
F06DFF (PDF version)
F06 Chapter Contents
F06 Chapter Introduction
NAG Library Manual
© The Numerical Algorithms Group Ltd, Oxford, UK. 2015