lotobo/regex-tools
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 6 Wiki Activity

feat: add Python and Java regex engines

Browse Source
This commit is contained in:
Albrecht Degering
2026-07-27 02:02:21 +02:00
parent 4951c966d4
commit 7079cde15f
95 changed files with 8866 additions and 251 deletions
Download Patch File Download Diff File Expand all files Collapse all files

202
engines/java/LICENSE-TeaVM.txt Normal file
View File

@@ -0,0 +1,202 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

11
engines/java/NOTICE-TeaVM.txt Normal file
View File

@@ -0,0 +1,11 @@
This product includes software developed by Alexey Andreev
(http://teavm.org).
This product includes software developed by The Apache Software
Foundation (http://www.apache.org/).
=============================================================================
= NOTICE file corresponding to section 4d of the Apache License Version 2.0 =
=============================================================================
This product includes software developed by
Joda.org (http://www.joda.org/).

25
engines/java/README.md Normal file
View File

@@ -0,0 +1,25 @@
# TeaVM Java regular-expression engine
This project compiles a bounded bridge around TeaVM 0.15.0's
`java.util.regex.Pattern` and `Matcher` class-library implementation to a
minified ES2015 module.
The runtime is intentionally identified as `TeaVM java.util.regex 0.15.0`.
TeaVM supplies its own Apache Harmony-derived Java class-library subset; the
generated engine is not OpenJDK and must not be presented as exact OpenJDK
semantics.
The `U` application flag is a compatibility request. TeaVM 0.15.0 does not
implement OpenJDK's `Pattern.UNICODE_CHARACTER_CLASS`; the bridge implies
Unicode case folding but retains TeaVM's predefined-character-class and word
boundary behaviour. The TypeScript adapter reports this boundary.
Replacement is delegated to TeaVM 0.15.0's native `Matcher` implementation.
That implementation recognizes only a single decimal digit after `$` (`$0`
through `$9`, subject to the compiled group count). It does not implement
OpenJDK's `${name}` named-replacement syntax; the bridge returns a
`replacement-error` when such a replacement is attempted.
Maven builds `target/generated/java-regex.mjs`. The repository pack script
verifies the pinned source identity, bridge source hashes, licence/notice and
generated module before it can be installed under `public/engines/java`.

84
engines/java/pom.xml Normal file
View File

@@ -0,0 +1,84 @@
<?xml version="1.0" encoding="UTF-8"?>
<project xmlns="http://maven.apache.org/POM/4.0.0"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 https://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion>
<groupId>de.addideas.regextools</groupId>
<artifactId>java-regex-engine</artifactId>
<version>0.1.0</version>
<packaging>jar</packaging>
<properties>
<maven.compiler.release>11</maven.compiler.release>
<project.build.outputTimestamp>2026-06-06T15:27:10Z</project.build.outputTimestamp>
<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
<teavm.version>0.15.0</teavm.version>
</properties>
<dependencies>
<dependency>
<groupId>org.teavm</groupId>
<artifactId>teavm-classlib</artifactId>
<version>${teavm.version}</version>
<scope>provided</scope>
</dependency>
<dependency>
<groupId>org.teavm</groupId>
<artifactId>teavm-jso</artifactId>
<version>${teavm.version}</version>
<scope>provided</scope>
</dependency>
</dependencies>
<build>
<plugins>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-clean-plugin</artifactId>
<version>3.4.1</version>
</plugin>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-compiler-plugin</artifactId>
<version>3.13.0</version>
<configuration>
<release>${maven.compiler.release}</release>
</configuration>
</plugin>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-jar-plugin</artifactId>
<version>3.4.2</version>
<configuration>
<outputTimestamp>${project.build.outputTimestamp}</outputTimestamp>
</configuration>
</plugin>
<plugin>
<groupId>org.teavm</groupId>
<artifactId>teavm-maven-plugin</artifactId>
<version>${teavm.version}</version>
<executions>
<execution>
<id>java-regex-browser-engine</id>
<goals>
<goal>compile</goal>
</goals>
<configuration>
<mainClass>de.addideas.regextools.javaengine.RegexBridge</mainClass>
<targetDirectory>${project.build.directory}/generated</targetDirectory>
<targetFileName>java-regex.mjs</targetFileName>
<targetType>JAVASCRIPT</targetType>
<jsModuleType>ES2015</jsModuleType>
<minifying>true</minifying>
<optimizationLevel>ADVANCED</optimizationLevel>
<debugInformationGenerated>false</debugInformationGenerated>
<sourceMapsGenerated>false</sourceMapsGenerated>
<sourceFilesCopied>false</sourceFilesCopied>
</configuration>
</execution>
</executions>
</plugin>
</plugins>
</build>
</project>

346
engines/java/src/main/java/de/addideas/regextools/javaengine/RegexBridge.java Normal file
View File

@@ -0,0 +1,346 @@
/*
* SPDX-License-Identifier: GPL-3.0-or-later
*
* The generated module links TeaVM 0.15.0 class-library code distributed
* under Apache-2.0. Its runtime identity is TeaVM java.util.regex, not OpenJDK.
*/
package de.addideas.regextools.javaengine;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.regex.PatternSyntaxException;
import org.teavm.jso.JSExport;
public final class RegexBridge {
private static final int BRIDGE_ABI_VERSION = 1;
private static final String ENGINE_IDENTITY = "TeaVM java.util.regex 0.15.0";
private static final int MAXIMUM_CAPTURE_GROUPS = 1_000;
private static final int MAXIMUM_NATIVE_OUTPUT_UTF16 = 64 * 1024 * 1024;
private static final int FLAG_CASE_INSENSITIVE = 1 << 0;
private static final int FLAG_MULTILINE = 1 << 1;
private static final int FLAG_DOTALL = 1 << 2;
private static final int FLAG_UNICODE_CASE = 1 << 3;
private static final int FLAG_COMMENTS = 1 << 4;
private static final int FLAG_UNICODE_CHARACTER_COMPATIBILITY = 1 << 5;
private static final int FLAG_UNIX_LINES = 1 << 6;
private RegexBridge() {
}
public static void main(String[] arguments) {
// TeaVM requires a main class. All useful entry points are JS exports.
}
@JSExport
public static int bridgeAbiVersion() {
return BRIDGE_ABI_VERSION;
}
@JSExport
public static String engineIdentity() {
return ENGINE_IDENTITY;
}
@JSExport
public static int selfTest() {
try {
Matcher matcher = Pattern.compile("(?<=a)(b)\\1").matcher("abb");
if (!matcher.find() || matcher.start() != 1 || matcher.end() != 3
|| matcher.start(1) != 1 || matcher.end(1) != 2) {
return 1;
}
StringBuffer output = new StringBuffer();
matcher.appendReplacement(output, "<$1>");
matcher.appendTail(output);
return "a<b>".contentEquals(output) ? 0 : 2;
} catch (RuntimeException failure) {
return 3;
}
}
@JSExport
public static String execute(
String pattern,
String subject,
int applicationFlags,
boolean iterate,
int maximumMatches,
int maximumCaptureRows) {
return run(
pattern,
subject,
applicationFlags,
iterate,
maximumMatches,
maximumCaptureRows,
null);
}
@JSExport
public static String replace(
String pattern,
String subject,
String replacement,
int applicationFlags,
boolean iterate,
int maximumMatches,
int maximumCaptureRows) {
return run(
pattern,
subject,
applicationFlags,
iterate,
maximumMatches,
maximumCaptureRows,
replacement);
}
private static String run(
String patternText,
String subject,
int applicationFlags,
boolean iterate,
int maximumMatches,
int maximumCaptureRows,
String replacement) {
if (patternText == null || subject == null) {
return failure("bridge-error", "NullPointerException",
"Pattern and subject must not be null.", -1);
}
if (maximumMatches < 1 || maximumCaptureRows < 1) {
return failure("limit-error", "IllegalArgumentException",
"Result limits must be positive.", -1);
}
Pattern pattern;
try {
pattern = Pattern.compile(patternText, nativeFlags(applicationFlags));
} catch (PatternSyntaxException failure) {
String message = failure.getDescription();
if (message == null || message.length() == 0) {
message = failure.getMessage();
}
return failure("compile-error", "PatternSyntaxException", message, failure.getIndex());
} catch (RuntimeException failure) {
return failure("compile-error", failure.getClass().getSimpleName(),
safeMessage(failure, "TeaVM rejected the pattern."), -1);
}
Matcher matcher = pattern.matcher(subject);
int groupCount = matcher.groupCount();
if (groupCount > MAXIMUM_CAPTURE_GROUPS) {
return failure("limit-error", "CaptureGroupLimit",
"The pattern exceeds the 1,000 capture-group execution limit.", -1);
}
StringBuilder records = new StringBuilder();
StringBuffer output = replacement == null ? null : new StringBuffer();
int matchCount = 0;
int captureRows = 0;
int lastReplacementEnd = 0;
boolean resultsTruncated = false;
boolean outputTruncated = false;
try {
while (matcher.find()) {
int rowsForMatch = Math.max(1, groupCount);
if (matchCount >= maximumMatches
|| captureRows + rowsForMatch > maximumCaptureRows) {
resultsTruncated = true;
break;
}
appendNumber(records, matcher.start());
appendNumber(records, matcher.end());
for (int group = 1; group <= groupCount; group++) {
appendNumber(records, matcher.start(group));
appendNumber(records, matcher.end(group));
}
matchCount++;
captureRows += rowsForMatch;
if (output != null && !outputTruncated) {
long expansionLength = replacementExpansionLength(matcher, replacement);
long projectedLength = (long) output.length()
+ matcher.start() - lastReplacementEnd
+ expansionLength;
if (projectedLength > MAXIMUM_NATIVE_OUTPUT_UTF16) {
appendBounded(
output,
subject,
lastReplacementEnd,
matcher.start(),
MAXIMUM_NATIVE_OUTPUT_UTF16);
outputTruncated = true;
} else {
matcher.appendReplacement(output, replacement);
lastReplacementEnd = matcher.end();
}
}
if (!iterate) {
break;
}
}
if (output != null && !outputTruncated) {
long projectedLength = (long) output.length()
+ subject.length() - lastReplacementEnd;
if (projectedLength > MAXIMUM_NATIVE_OUTPUT_UTF16) {
appendBounded(
output,
subject,
lastReplacementEnd,
subject.length(),
MAXIMUM_NATIVE_OUTPUT_UTF16);
outputTruncated = true;
} else {
matcher.appendTail(output);
}
}
} catch (RuntimeException failure) {
String kind = replacement == null ? "execution-error" : "replacement-error";
String fallback = replacement == null
? "TeaVM failed while matching."
: "TeaVM Matcher rejected the replacement.";
return failure(kind, failure.getClass().getSimpleName(),
safeMessage(failure, fallback), -1);
}
FieldWriter result = new FieldWriter();
result.field("1");
result.field("ok");
result.number(groupCount);
result.bool(resultsTruncated);
result.number(matchCount);
result.raw(records);
if (output != null) {
result.bool(outputTruncated);
result.field(output.toString());
}
return result.toString();
}
private static int nativeFlags(int applicationFlags) {
int flags = 0;
if ((applicationFlags & FLAG_CASE_INSENSITIVE) != 0) {
flags |= Pattern.CASE_INSENSITIVE;
}
if ((applicationFlags & FLAG_MULTILINE) != 0) {
flags |= Pattern.MULTILINE;
}
if ((applicationFlags & FLAG_DOTALL) != 0) {
flags |= Pattern.DOTALL;
}
if ((applicationFlags & FLAG_UNICODE_CASE) != 0
|| (applicationFlags & FLAG_UNICODE_CHARACTER_COMPATIBILITY) != 0) {
flags |= Pattern.UNICODE_CASE;
}
if ((applicationFlags & FLAG_COMMENTS) != 0) {
flags |= Pattern.COMMENTS;
}
if ((applicationFlags & FLAG_UNIX_LINES) != 0) {
flags |= Pattern.UNIX_LINES;
}
return flags;
}
private static long replacementExpansionLength(Matcher matcher, String replacement) {
long length = 0;
for (int index = 0; index < replacement.length(); index++) {
char current = replacement.charAt(index);
if (current == '\\') {
index++;
if (index >= replacement.length()) {
throw new IndexOutOfBoundsException();
}
length++;
} else if (current == '$') {
index++;
if (index >= replacement.length()) {
throw new IllegalArgumentException("");
}
int group = Character.digit(replacement.charAt(index), 10);
if (group < 0) {
throw new IllegalArgumentException("");
}
String value = matcher.group(group);
// TeaVM 0.15.0's native replacement path dereferences this
// value too, including its unmatched-capture behaviour.
length += value.length();
} else {
length++;
}
if (length > MAXIMUM_NATIVE_OUTPUT_UTF16) {
return length;
}
}
return length;
}
private static void appendBounded(
StringBuffer output,
String value,
int start,
int end,
int maximumLength) {
int remaining = maximumLength - output.length();
if (remaining <= 0 || start >= end) {
return;
}
int boundedEnd = Math.min(end, start + remaining);
if (boundedEnd < end
&& boundedEnd > start
&& Character.isHighSurrogate(value.charAt(boundedEnd - 1))
&& Character.isLowSurrogate(value.charAt(boundedEnd))) {
boundedEnd--;
}
output.append(value, start, boundedEnd);
}
private static String failure(String status, String name, String message, int index) {
FieldWriter result = new FieldWriter();
result.field("1");
result.field(status);
result.field(name == null ? "Error" : name);
result.field(message == null ? "" : message);
result.number(index);
return result.toString();
}
private static String safeMessage(RuntimeException failure, String fallback) {
String message = failure.getMessage();
return message == null || message.length() == 0 ? fallback : message;
}
private static void appendNumber(StringBuilder output, int value) {
String encoded = Integer.toString(value);
output.append(encoded.length()).append(':').append(encoded);
}
private static final class FieldWriter {
private final StringBuilder output = new StringBuilder();
void field(String value) {
output.append(value.length()).append(':').append(value);
}
void number(int value) {
field(Integer.toString(value));
}
void bool(boolean value) {
field(value ? "1" : "0");
}
void raw(StringBuilder encodedFields) {
output.append(encodedFields);
}
@Override
public String toString() {
return output.toString();
}
}
}

277
engines/python/bridge.py Normal file
View File

@@ -0,0 +1,277 @@
"""Fixed, bounded CPython ``re`` bridge used by the Python engine worker.
This file is bundled as source by Vite and evaluated once while the trusted
Pyodide runtime starts. User-controlled values are passed as function
arguments; they are never evaluated as Python source.
"""
import json
import re
import sys
_BRIDGE_ABI_VERSION = 1
_MAX_CAPTURE_GROUPS = 1_000
_MAX_NATIVE_EXPANSION_CODE_POINTS = 16 * 1024 * 1024
def _json_result(value):
return json.dumps(value, ensure_ascii=True, separators=(",", ":"))
def _error(phase, code, error, position=None):
message = str(error)
if len(message) > 1_024:
message = message[:1_023] + "\N{HORIZONTAL ELLIPSIS}"
result = {
"abi": _BRIDGE_ABI_VERSION,
"ok": False,
"phase": phase,
"code": code,
"message": message,
}
if isinstance(position, int) and position >= 0:
result["position"] = position
return _json_result(result)
def _flag_bits(flags):
bits = 0
if "a" in flags:
bits |= re.ASCII
if "i" in flags:
bits |= re.IGNORECASE
if "m" in flags:
bits |= re.MULTILINE
if "s" in flags:
bits |= re.DOTALL
if "x" in flags:
bits |= re.VERBOSE
return bits
def _match_record(match, group_count):
captures = []
for group_number in range(1, group_count + 1):
start, end = match.span(group_number)
captures.append(None if start < 0 else [start, end])
start, end = match.span(0)
return {"span": [start, end], "captures": captures}
def _utf8_width(character):
code_point = ord(character)
if code_point <= 0x7F:
return 1
if code_point <= 0x7FF:
return 2
if code_point <= 0xFFFF:
return 3
return 4
def _append_utf8_bounded(chunks, value, byte_count, maximum_bytes):
remaining = maximum_bytes - byte_count
if not value:
return byte_count, True
end = 0
for character in value:
width = _utf8_width(character)
if width > remaining:
break
remaining -= width
byte_count += width
end += 1
if end:
chunks.append(value[:end])
return byte_count, end == len(value)
def _expansion_code_points(parsed_template, match):
total = 0
for part in parsed_template:
if isinstance(part, int):
start, end = match.span(part)
if start >= 0:
total += end - start
else:
total += len(part)
if total > _MAX_NATIVE_EXPANSION_CODE_POINTS:
return total
return total
def _identity():
return _json_result(
{
"abi": _BRIDGE_ABI_VERSION,
"ok": True,
"identity": {
"implementation": sys.implementation.name,
"pythonVersion": ".".join(
str(part) for part in sys.version_info[:3]
),
"reModule": re.__name__,
},
}
)
def _regex_tools_run(
operation,
pattern,
flags,
subject,
maximum_matches,
maximum_capture_rows,
replacement,
maximum_output_bytes,
):
if operation == "identity":
return _identity()
if operation not in ("execute", "replace"):
return _error("bridge", "invalid-operation", "Unsupported bridge operation.")
try:
compiled = re.compile(pattern, _flag_bits(flags))
except re.PatternError as error:
return _error(
"compile",
"compile-error",
error,
getattr(error, "pos", None),
)
except Exception as error:
return _error("compile", "compile-error", error)
group_count = compiled.groups
if group_count > _MAX_CAPTURE_GROUPS:
return _error(
"compile",
"capture-group-limit",
(
f"The pattern declares {group_count} capture groups; "
f"the bridge limit is {_MAX_CAPTURE_GROUPS}."
),
)
group_names = sorted(
([group_number, name] for name, group_number in compiled.groupindex.items()),
key=lambda item: item[0],
)
parsed_template = None
if operation == "replace":
try:
parsed_template = re._parser.parse_template(replacement, compiled)
except (re.PatternError, IndexError) as error:
return _error(
"replacement",
"replacement-error",
error,
getattr(error, "pos", None),
)
except Exception as error:
return _error("replacement", "replacement-error", error)
iterate = "g" in flags
try:
matches = compiled.finditer(subject) if iterate else (
candidate for candidate in (compiled.search(subject),) if candidate
)
records = []
capture_rows = 0
results_truncated = False
output_chunks = []
output_bytes = 0
output_truncated = False
output_stopped = False
next_source_position = 0
for match in matches:
rows_for_match = max(1, group_count)
if (
len(records) >= maximum_matches
or capture_rows + rows_for_match > maximum_capture_rows
):
results_truncated = True
break
records.append(_match_record(match, group_count))
capture_rows += rows_for_match
if operation == "replace" and not output_stopped:
start, end = match.span(0)
output_bytes, complete = _append_utf8_bounded(
output_chunks,
subject[next_source_position:start],
output_bytes,
maximum_output_bytes,
)
if not complete:
output_truncated = True
output_stopped = True
else:
expansion_size = _expansion_code_points(
parsed_template, match
)
if expansion_size > _MAX_NATIVE_EXPANSION_CODE_POINTS:
return _error(
"replacement",
"replacement-expansion-limit",
(
"One native match expansion exceeds the "
f"{_MAX_NATIVE_EXPANSION_CODE_POINTS} "
"code-point safety limit."
),
)
expanded = match.expand(replacement)
output_bytes, complete = _append_utf8_bounded(
output_chunks,
expanded,
output_bytes,
maximum_output_bytes,
)
if not complete:
output_truncated = True
output_stopped = True
next_source_position = end
if operation == "replace" and not output_stopped:
output_bytes, complete = _append_utf8_bounded(
output_chunks,
subject[next_source_position:],
output_bytes,
maximum_output_bytes,
)
if not complete:
output_truncated = True
result = {
"abi": _BRIDGE_ABI_VERSION,
"ok": True,
"groupCount": group_count,
"groupNames": group_names,
"matches": records,
"resultsTruncated": results_truncated,
}
if operation == "replace":
result.update(
{
"output": "".join(output_chunks),
"outputBytes": output_bytes,
"outputTruncated": output_truncated,
}
)
return _json_result(result)
except re.PatternError as error:
phase = "replacement" if operation == "replace" else "match"
code = "replacement-error" if operation == "replace" else "match-error"
return _error(phase, code, error, getattr(error, "pos", None))
except Exception as error:
phase = "replacement" if operation == "replace" else "match"
code = "replacement-error" if operation == "replace" else "match-error"
return _error(phase, code, error)
_regex_tools_run