If you really want help with this, then you are going to have to do a lot more than simply throw a gob-load of C code -- that itself has a gob-load of unreferenced & unsupplied dependencies -- at us and expect a conversion service.
The first thing I'd want to know is:
but it was slow
How slow?
Please give comprehensive and accurate numbers. Including:
And how many of them are there to be processed? (Ie. Does a given run consist of all the shorts against a single long or multiple longs?)
What's the minimum length?
And how fuzzy? Ie How many out of a 25 base string have to match?
If the short is shorter than 25, say 15, how many have to match?
Be precise. How many shorts? How long was the long?
How long did it take. If was single tasking, how many elapsed seconds, and on what processor?
If it was multi-tasking, how many concurrent threads; what processor? How many total cycles/cpu seconds?
I found this code which has been writen was in c but I couldn't handle it
What about it couldn't you handle?
In reply to Re: Again Fuzzy regex !!!!
by BrowserUk
in thread Again Fuzzy regex !!!!
by samman
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |