[Python-Dev] re performance
MRAB
python at mrabarnett.plus.com
Thu Jan 26 20:16:52 EST 2017
More information about the Python-Dev mailing list
Thu Jan 26 20:16:52 EST 2017
- Previous message (by thread): [Python-Dev] re performance
- Next message (by thread): [Python-Dev] re performance
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On 2017-01-26 21:46, Sven R. Kunze wrote: > On 26.01.2017 22:33, Vlastimil Brom wrote: >> Hi, >> I can't speak about the details of mrab's implementation, but using >> regex, I get the resulting match instantly: [...] > > Nice! I focused on the stdlib re module as this is mainly used by other > frameworks (like Django). > >> (I personally prefer to use regex for other advantages, than this >> artificial case, but it certainly doesn't hurt to have better >> performance here too:) > > Me, too. > > So, it seems as if regex already uses a better algorithm although I > couldn't find any reference to any regex theoretical framework like dfa, > nfa, thompson multiple-state simulation or something. > It still uses backtracking, like in the re module.
- Previous message (by thread): [Python-Dev] re performance
- Next message (by thread): [Python-Dev] re performance
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-Dev mailing list