Pattern is useful for breaking simple substitution ciphers: In the (long enough) encrypted text, the frequencies of the letters are roughly the same as the frequencies of the letters in the used language. If you want to check anagrams, sorting the letters are simpler.
Code:
CharSort(String) {
Loop Parse, String
x = %x%%A_LoopField%`n
Sort x
StringReplace x, x, `n,,All
Return x
}
The sorted anagrams must be equal.
Here are two shorter variants of the Pattern function.
Code:
MsgBox % CharPattern1("AutoHotKey")
MsgBox % CharPattern2("AutoHotKey")
CharPattern1(String) {
StringUpper String, String
Loop Parse, String
x = %x%%A_LoopField%`n
Sort x
StringReplace String, x, `n,,All
Loop Parse, String
If(PrevChar <> A_LoopField) {
PrevChar = %A_LoopField%
y = %y%%count%%A_LoopField%
count = 1
} Else count+=1
y = %y%%count%
Return y
}
CharPattern2(String) {
Loop 26
{
StringReplace String, String, % Chr(A_Index+64),,UseErrorLevel
If ErrorLevel
x := x Chr(A_Index+64) ErrorLevel
}
Return x
}
The first one could be faster for short inputs. It sorts the string then scans it to see if neighbor characters are different. If yes, the counter is output, telling how many copies of the previous character were found, followed by the new character. When the new character is the same as the previous was, only the counter is incremented. This function also works with non-letter, and accented characters.
The second function counts the occurrences of all 26 letters in the input, and outputs the ones, which occur at least once, followed by their counts. It is very short, but assumes the default A_StringCaseSense = OFF. To be sure, you could set StringCaseSense OFF (saving the previous value beforehand and restoring it at the end), or convert the input to upper case.
Login
Register
FAQ
Search
vPhiLho