New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

match execution time grows exponentially on certain regular expressions, when you increase input length #34

Closed
GoogleCodeExporter opened this Issue Aug 4, 2015 · 1 comment

Comments

Projects
None yet
2 participants
@GoogleCodeExporter
Contributor

GoogleCodeExporter commented Aug 4, 2015

Steps to reproduce: run the attached test script.

Outcome: Execution time doubles in each round.

I expect match to be faster (like gawk's match in this case).

What version of the product are you using? On what operating system?

$ mawk -W version
mawk 1.3.4 20150503
Copyright 2008-2014,2015, Thomas E. Dickey
Copyright 1991-1996,2014, Michael D. Brennan

random-funcs:       srandom/random
regex-funcs:        internal
compiled limits:
sprintf buffer      8192
maximum-integer     2147483647

$ uname -a
Linux jarnos-OptiPlex-745 3.13.0-59-lowlatency #98-Ubuntu SMP PREEMPT Fri Jul 
24 21:43:07 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux


Original issue reported on code.google.com by jarno.il...@gmail.com on 29 Jul 2015 at 9:50

Attachments:

@ThomasDickey

This comment has been minimized.

Show comment
Hide comment

@mterron mterron referenced this issue Aug 24, 2018

Open

2.0 ? #2

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment