We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Could the program do a simple (but possible computational expensive) computation to look for repeating patterns?
With as input parameters:
Result of search could be: Found pattern with length of 3 bytes, repeated 100 times with stride 20
Then width of can set equal to stride and the same kind color of pixels should show up as a vertical line.
In case of many patterns found they can be sorted by something like: pattern length * length
The text was updated successfully, but these errors were encountered:
Interesting idea. I think this should be prototyped in an external script/experiment first.
Sorry, something went wrong.
No branches or pull requests
Could the program do a simple (but possible computational expensive) computation to look for repeating patterns?
With as input parameters:
Result of search could be:
Found pattern with length of 3 bytes, repeated 100 times with stride 20
Then width of can set equal to stride and the same kind color of pixels should show up as a vertical line.
In case of many patterns found they can be sorted by something like: pattern length * length
The text was updated successfully, but these errors were encountered: