Message144110
| Author | mattchaput |
|---|---|
| Recipients | akitada, akoumjian, alex, amaury.forgeotdarc, belopolsky, davide.rizzo, eric.snow, ezio.melotti, georg.brandl, giampaolo.rodola, gregory.p.smith, jacques, jaylogan, jhalcrow, jimjjewett, loewis, mark, mattchaput, moreati, mrabarnett, nneonneo, pitrou, r.david.murray, ronnix, rsc, sjmachin, steven.daprano, stiv, timehorse, vbr, zdwiel |
| Date | 2011-09-15.22:45:17 |
| SpamBayes Score | 3.8249505e-06 |
| Marked as misclassified | No |
| Message-id | <1316126718.26.0.638677760384.issue2636@psf.upfronthosting.co.za> |
| In-reply-to |
| Content | |
|---|---|
Not sure if this is better as a separate feature request or a comment here, but... the new version of .NET includes an option to specify a time limit on evaluation of regexes (not sure if this is a feature in other regex libs). This would be useful especially when you're executing regexes configured by the user and you don't know if/when they might go exponential. Something like this maybe: # Raises an re.Timeout if not complete within 60 seconds match = myregex.match(mystring, maxseconds=60.0) |
|
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2011-09-15 22:45:19 | mattchaput | set | recipients: + mattchaput, loewis, georg.brandl, gregory.p.smith, jimjjewett, sjmachin, amaury.forgeotdarc, belopolsky, pitrou, nneonneo, giampaolo.rodola, rsc, timehorse, mark, vbr, ezio.melotti, mrabarnett, jaylogan, akitada, moreati, steven.daprano, alex, r.david.murray, jacques, zdwiel, jhalcrow, stiv, davide.rizzo, ronnix, eric.snow, akoumjian |
| 2011-09-15 22:45:18 | mattchaput | set | messageid: <1316126718.26.0.638677760384.issue2636@psf.upfronthosting.co.za> |
| 2011-09-15 22:45:17 | mattchaput | link | issue2636 messages |
| 2011-09-15 22:45:17 | mattchaput | create | |