Buckets:
32.1 GB
673,093 files
Updated 5 months ago
Ctrl+K
| Name | Size | Uploaded | Xet hash |
|---|---|---|---|
| .github | 3 items | ||
| example | 1 items | ||
| test | 1 items | ||
| types | 2 items | ||
| .gitattributes | 80 Bytes xet | ba27e24e | |
| LICENSE | 1.07 kB xet | ec036deb | |
| README.md | 1.72 kB xet | 20a0a92c | |
| eslint.config.js | 135 Bytes xet | 8eee8096 | |
| index.js | 1.21 kB xet | 33f59461 | |
| package.json | 1.75 kB xet | cbf09280 |
safe-regex2
Detect potentially catastrophic exponential-time regular expressions by limiting the star height to 1.
This is a fork of https://github.com/substack/safe-regex at 1.1.0.
WARNING: This module has both false positives and false negatives. It is not meant as a full checker, but it detects basic cases.
Install
npm i safe-regex2
Example
const safe = require('safe-regex2');
const regex = process.argv.slice(2).join(' ');
console.log(safe(regex));
$ node safe.js '(x+x+)+y'
false
$ node safe.js '(beep|boop)*'
true
$ node safe.js '(a+){10}'
false
$ node safe.js '\blocation\s*:[^:\n]+\b(Oakland|San Francisco)\b'
true
Methods
const safe = require('safe-regex')
const ok = safe(re, opts={})
Returns a boolean indicating whether the regex re is safe
and not possibly catastrophic.
re can be a RegExp object or just a string.
If re is a string and is an invalid regex, it returns false.
opts.limit- maximum number of allowed repetitions in the entire regex. Default:25.
License
Licensed under MIT.
- Total size
- 32.1 GB
- Files
- 673,093
- Last updated
- Mar 19
- Pre-warmed CDN
- US EU US EU