Primary version
Array
Pattern
Pattern create
Assume the pattern length = 500 (you can change it to any value). By default this will create 20280 probabilities max.
1
pattern_create = ('Aa0'..'Zz9').to_a.join.each_char.first(500).join
Copied!
In case you need longer a pattern (ex. 30000) you can do the following
1
pattern_create = ('Aa0'..'Zz9').to_a.join
2
pattern_create = pattern_create * (30000 / 20280.to_f).ceil
Copied!
Pattern offset
I'll assume the pattern was equal or less than “20280” and we are looking for “9Ak0” pattern characters. The pattern_create should be initialized from above
1
pattern_offset = pattern_create.enum_for(:scan , '9Ak0').map {Regexp.last_match.begin(0)}
Copied!
Note: This does not consider the Little-endian format, for that there is extra code that should be written. For more info, please take a look at the following [code][1].
Generate all hexadecimal values from \x00 to \xff
\x00 to \xff1
puts (0..255).map {|b| ('\x%02X' % b)}
Copied!
- To change value presentation from (
\xeato0xea), change\x%xto0x%x - To make all letters capital (
\xeato\xEA) , change\x%xto\x%X
Generate all printable characters
1
(32..126).map {|c| c.chr}
Copied!
short and unclean
1
(32..126).map &:chr
Copied!
Resources
Last modified 3yr ago