Record of screen interlace scanning algorithm

It is estimated that the chat record of LZX and Xi Cao is the most clear and clear. In comparison, the BCB screen public code of Uncle DG is the best match.

8999 *** 17:40:01
Can you talk about your screen monitoring algorithm?
Descrilzx done 17:41:26
There is nothing special about it. Everyone knows what the barrier scans,
I think it's best to skip a single-row scan.

8999 *** 17:41:51
No information found from the Internet
Descrilzx done 17:42:48
None.

8999 *** 17:43:35
Yes, so I asked my eldest brother if you could share some information.
Descrilzx done 17:45:40
Where can I find any information? If I know the principle, I just need to write code.

If you don't understand the principle, you need to understand why you want to skip a single line scan,

A single row is used to read a small amount of screen data each time,
The hop is used to detect changes as soon as possible. Do you know?

Descrilzx done 17:46:19
You can compare it with reading data on the whole screen every time.

8999 *** 17:46:27
Oh, you know.
8999 *** 17:47:46
Is a skip-type single-row scan used to find the region with the smallest change?

Descrilzx done 17:49:35
No, it is the line that first locates the change, and then checks the top, buttom,
Each detection is compared with the original graph to obtain left, right,
This gives the region

8999 *** 17:52:04
If the comparison starts from the top, the row to be located is not the top?
Descrilzx done 17:52:44
What you mean

8999 *** 17:52:56
Is to first locate the line of change
8999 *** 17:53:45
Which of the following lines does not change? Is this line located not an edge?
Descrilzx done 17:54:15
Descrilzx done 17:49:34
No, it is the line that first locates the change, and then checks the top, buttom,

"Then detect ON and OFF"

Descrilzx done 17:54:56
When we find that a row of data is consistent with the previous one, we have determined the edge value.

8999 *** 17:55:20
Yes, I know.
8999 *** 17:56:07
That is, no matter the most value, first find the changed line, and then find the most value from this line?
Descrilzx done 17:56:31
Yes

8999 *** 17:57:04
Understand. The hop is to quickly find a changed line.
8999 *** 17:57:27
Then find the highest value in the upper and lower layers.
Descrilzx done 17:57:51
Well, that's fine.

8999 *** 17:58:20
Thank you.
Descrilzx done 18:00:06
Another strange thing is that Radmin's color is the same as the screen's color. If the screen is set to 32 bits, you can take 16, take the CPU, and convert it by yourself.

Descrilzx done 18:00:19
Faster

8999 *** 18:00:58
Take 16 colors directly to eat CPU
Descrilzx done 18:01:47
And there are 16 bits, 555,565, which must be different,

8999 *** 18:01:50
Understand,
Descrilzx done 18:02:19
Let's just put it bluntly. Haha, write your own code.