Alternatives to RegExMatch?

[littlegandhi1199]

Alright.
I've finished my anagram solver and it solves all permutations of 4 letter words up to 15 letter words for an infinitely long word used as your input.
I cracked the code to do it all perfectly and without error and is detailed herehttps://autohotkey.com/boards/viewtopic ... 19&t=34285 along with the script!

[YoucefHam]

why you are testing !!!

[littlegandhi1199]

why you are testing !!!

hello again, I made a program that generates permutations of a word (anagram maker) and it compares it against a 5mb dictionary file for any real words.
Does it for 4 letter words, 5 letter words, and up to 11 letter words which when you look at the total permutations it has to do for an 11 letter anagram...
that's 39 million possibilites my friend

even 1ms slower per comparison and my program will take 10 hours longer to complete

[Helgef]

I suggest you (sort the dictionary and) do a binary search.

[littlegandhi1199]

Great idea!
Now, how would you search a file differently using binary though?

[Helgef]

It is very easy to implement a binary search, google it. If you are lazy (it's ok), you can use do something like this, I assume guess ahk uses binary search for key look ups,

Code: Select all

setbatchlines,-1
listlines,off
#noenv
dictionary=	; Use fileread 
(
Bruce
Arnold
Dolph
Chuck
)
Sort, dictionary										; Sort the dictionary if it is not already sorted (not really needed)
strreplace(dictionary, "`n","`n",n)						; Count the lines  (not really needed)
dict:=[]
dict.setcapacity(n)										; Allocate space for n keys. Might improve performance if the dictionary is very big.   (not really needed)
Loop, Parse, dictionary, `n
	dict[A_LoopField]:=A_Index							; Use each word in the dictionary as a key in the dict array
msgbox, % dict.haskey("bruce") ? "Yes on row: " dict["bruce"] : "No" ; this is not case sensitive but I assume it is ok in your case.
dictionary:=""
for k in dict
	str.= k "`n" 
msgbox, % str

So you look up by doing dict.Haskey(...), answer is true or false.

[littlegandhi1199]

It is very easy to implement a binary search, google it. If you are lazy (it's ok), you can use do something like this, I assume guess ahk uses binary search for key look ups,

Code: Select all

setbatchlines,-1
listlines,off
#noenv
dictionary=	; Use fileread 
(
Bruce
Arnold
Dolph
Chuck
)
Sort, dictionary										; Sort the dictionary if it is not already sorted (not really needed)
strreplace(dictionary, "`n","`n",n)						; Count the lines  (not really needed)
dict:=[]
dict.setcapacity(n)										; Allocate space for n keys. Might improve performance if the dictionary is very big.   (not really needed)
Loop, Parse, dictionary, `n
	dict[A_LoopField]:=A_Index							; Use each word in the dictionary as a key in the dict array
msgbox, % dict.haskey("bruce") ? "Yes on row: " dict["bruce"] : "No" ; this is not case sensitive but I assume it is ok in your case.
dictionary:=""
for k in dict
	str.= k "`n" 
msgbox, % str

So you look up by doing dict.Haskey(...), answer is true or false.

Brilliant idea, and your example works but once I put the same thing in txt.txt it fails
brucee
Arnold
Dolph
Chuck



bruce = brucee
FileRead, dictionary, txt.txt
dict =
dict:=[]
Loop, Parse, dictionary, `n
dict[A_LoopField]:=A_Index
if (dict.haskey(bruce) > 0)
msgbox, found "%bruce%" in`n"%dictionary%"
else
msgbox, "%bruce%" is missing from`n"%dictionary%"

dictionary=
(
brucee
Arnold
Dolph
Chuck
)
dict =
dict:=[]
Loop, Parse, dictionary, `n
dict[A_LoopField]:=A_Index
if (dict.haskey(bruce) > 0)
msgbox, found "%bruce%" in`n"%dictionary%"
else
msgbox, "%bruce%" is missing from`n"%dictionary%"

[Helgef]

Hello, There might an issue with the line breaks. Try to to replace the Loop, ... line with Loop, Parse, dictionary, `n, `r

[littlegandhi1199]

My own anagram solver that is buggy is already uploaded somewhere.
Once I fix it I will add to your guys' too