@ericcornelissen/lregexp 1.0.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Eric Cornelissen
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,31 @@
+# lRegExp
+
+Transparently create linear-time ([non-backtracking]) regular expressions.
+
+[non-backtracking]: https://v8.dev/blog/non-backtracking-regexp
+
+## Usage
+
+This library exports a drop-in replacement for the built-in RegExp.
+
+```shell
+npm install @ericcornelissen/lregexp
+```
+
+```javascript
+import RegExp from "@ericcornelissen/lregexp";
+new RegExp("[linear]{6}");
+```
+
+## Why
+
+Backtracking regular expressions can take exponential time to evaluate, leading
+to the dreaded _ReDoS_ vulnerability. Linear-time regular expressions avoid this
+by not backtracking.
+
+## Caveats
+
+Not all regular expression constructs are valid in a linear-time regular
+expression and this library won't tell you your regular expression is
+incompatible unless you run it with the non-backtracking engine, in which
+case it throws an error.

package/index.js

@@ -0,0 +1,16 @@
+import isSupportedRegexpFlag from "is-supported-regexp-flag";
+
+const RegExp_ = globalThis.RegExp;
+
+let lRegExp;
+if (isSupportedRegexpFlag("l")) {
+	lRegExp = function(pattern, flags="") {
+		return new RegExp_(pattern, `${flags}l`);
+	};
+} else {
+	lRegExp = function(pattern, flags) {
+		return new RegExp_(pattern, flags);
+	};
+}
+
+export default lRegExp;

package/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "@ericcornelissen/lregexp",
+  "description": "Transparently create linear-time regular expressions",
+  "version": "1.0.1",
+  "license": "MIT",
+  "type": "module",
+  "exports": "./index.js",
+  "bugs": {
+    "url": "https://github.com/ericcornelissen/lregexp/issues"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/ericcornelissen/depreman.git"
+  },
+  "author": {
+    "name": "Eric Cornelissen",
+    "email": "ericornelissen@gmail.com",
+    "url": "https://ericcornelissen.dev/"
+  },
+  "keywords": [
+    "regexp",
+    "regex",
+    "linear",
+    "flag"
+  ],
+  "dependencies": {
+    "is-supported-regexp-flag": "^2.0.0"
+  }
+}