Compare byte sequences and keep valid work on a refusal
Find one changed byte and see why malformed input cannot silently overwrite the current buffer.
For operators
Find one changed byte and see why malformed input cannot silently overwrite the current buffer. This is isolated practice with invented records. Nothing is uploaded or written into a live system.
Read these instructions on any device. Watch or practise a chapter on a desktop or laptop, with a desktop or mobile application layout. Demonstrations use sample data and simulated scanners.
Compare byte sequences and keep valid work on a refusal
- Choose hexadecimal input
Choose hexadecimal input.
Hexadecimal describes the bytes directly, without relying on a pasted line ending.
- Enter the current bytes
Enter the current bytes.
Use three known bytes so the differing position is easy to identify.
- Apply the current buffer
Apply the current buffer.
The current sequence is A, B, C. The comparison will not change it.
- Enter the other sequence
Enter the other sequence.
Only the final byte changes from 43 to 44. There is no trimming, text matching or automatic correction.
- Compare all byte positions
Compare all byte positions.
The result counts every differing position, including missing bytes. The table preview is limited, but the count covers both complete inputs.
- Enter incomplete hexadecimal input
Enter incomplete hexadecimal input.
A byte needs two valid hexadecimal digits. This input must not replace the current buffer.
- Read the input refusal
Read the input refusal.
The current bytes are kept. Correct the staged input deliberately before applying it again.
Review the result and its limits before using it in another application.