7 Applied Instructions
7.7 Handy Instruction
336
FXCPU Structured Programming Manual
(Basic & Applied Instruction)
2) Operation examples
a) Examples of composition of search result table and data
b) Search result table
2. 32-bit operation(DSER, DSERP)
In n pieces of data beginning from the device designated in , same data as the device designated in
is searched, and the result is stored in the device designated in .
1) Content and result of searched data
a) When same data is found
In five points of 32-bit data beginning from the device designated in , the number of same data,
initial/final position, and positions of maximum value and minimum value are stored.
b) When same data is not found
In five points of 32-bit data beginning from the device designated in , the number of same data,
initial/final position, and positions of maximum value and minimum value are stored.
However, 0 is stored in three points of 32-bit data beginning from the device designated in
(number of same data, initial/final position).
Searched device
Value of of
searched data
(ex.)
Value of of
comparative data
(ex.)
Position of
data
Search result
Maximum
value +4
Coincide Minimum
value +3
K100
K100
0 3(Initial)
+1
K111 1
+2
K100 2 3
+3
K 98 3
+4
K123 4
+5
K 66 5 3
+6
K100 6 3(Final)
+7
K 95 7
+8
K210 8 3
+9
K 88 9
Device No. Content Search result item
3 Number of same data
+1
0 Position of same data (initial)
+2
6 Position of same data (final)
+3
5 Final position of minimum value
+4
8 Final position of maximum value
Command input
DSER
EN
s1
s2
ENO
d
n
Label 1
*1
Label 2
*2
Label 4
*3
The number for searching
same data, maximum value,
minimum value
*1. This is to define the beginning device for searching same data, maximum value, minimum value.
*2. This is to define the value of searching same data, maximum value, minimum value, or its storing destination device.