- * Secure processing is enabled by default and can be overridden with the system property {@code "XmlStringLookup.secure"} set to {@code false}. The secure - * boolean String parsing follows the syntax defined by {@link Boolean#parseBoolean(String)}. + * Secure processing is enabled by default and can be overridden with this constructor. *
** Using a {@link StringLookup} from the {@link StringLookupFactory} fenced by the current directory ({@code Paths.get("")}): *
* *
- * StringLookupFactory.INSTANCE.xmlStringLookup(map, Pathe.get("")).lookup("com/domain/document.xml:/path/to/node");
+ * StringLookupFactory.INSTANCE.xmlStringLookup(map, Path.get("")).lookup("com/domain/document.xml:/path/to/node");
*
* * To use a {@link StringLookup} fenced by the current directory, use: diff --git a/src/main/java/org/apache/commons/text/lookup/XmlStringLookup.java b/src/main/java/org/apache/commons/text/lookup/XmlStringLookup.java index 85747eebc2..ee33441993 100644 --- a/src/main/java/org/apache/commons/text/lookup/XmlStringLookup.java +++ b/src/main/java/org/apache/commons/text/lookup/XmlStringLookup.java @@ -30,7 +30,6 @@ import javax.xml.xpath.XPathFactory; import org.apache.commons.lang3.StringUtils; -import org.apache.commons.lang3.SystemProperties; import org.w3c.dom.Document; /** @@ -42,8 +41,7 @@ *
- * Secure processing is enabled by default and can be overridden with the system property {@code "XmlStringLookup.secure"} set to {@code false}. The secure - * boolean String parsing follows the syntax defined by {@link Boolean#parseBoolean(String)}. + * Secure processing is enabled by default and can be overridden with {@link StringLookupFactory#xmlStringLookup(Map, Path...)}. *
* * @since 1.5 @@ -72,14 +70,13 @@ final class XmlStringLookup extends AbstractPathFencedLookup { } /** - * Defines the singleton for this class with secure processing enabled. + * Defines the singleton for this class with secure processing enabled by default. + *+ * Secure processing is enabled by default and can be overridden with {@link StringLookupFactory#xmlStringLookup(Map, Path...)}. + *
*/ static final XmlStringLookup INSTANCE = new XmlStringLookup(DEFAULT_XML_FEATURES, DEFAULT_XPATH_FEATURES, (Path[]) null); - private static boolean isSecure() { - return SystemProperties.getBoolean(XmlStringLookup.class, "secure", () -> true); - } - /** * Defines XPath factory features. */ @@ -113,8 +110,7 @@ private static boolean isSecure() { *- * Secure processing is enabled by default. The secure boolean String parsing follows the syntax defined by {@link Boolean#parseBoolean(String)}. The secure - * value in the key overrides instance settings given in the constructor. + * Secure processing is enabled by default and can be overridden with {@link StringLookupFactory#xmlStringLookup(Map, Path...)}. *
* * @param key the key to be looked up, may be null. @@ -130,7 +126,6 @@ public String lookup(final String key) { if (keyLen != KEY_PARTS_LEN) { throw IllegalArgumentExceptions.format("Bad XML key format '%s'; the expected format is 'DocumentPath:XPath'.", key); } - final boolean secure = isSecure(); final String documentPath = keys[0]; final String xpath = StringUtils.substringAfterLast(key, SPLIT_CH); final DocumentBuilderFactory dbFactory = DocumentBuilderFactory.newInstance(); @@ -138,14 +133,12 @@ public String lookup(final String key) { for (final Entry| commons-text-1.14.0-bin.tar.gz | -sha512 | -pgp | +commons-text-1.15.0-bin.tar.gz | +sha512 | +pgp |
| commons-text-1.14.0-bin.zip | -sha512 | -pgp | +commons-text-1.15.0-bin.zip | +sha512 | +pgp |
| commons-text-1.14.0-src.tar.gz | -sha512 | -pgp | +commons-text-1.15.0-src.tar.gz | +sha512 | +pgp |
| commons-text-1.14.0-src.zip | -sha512 | -pgp | +commons-text-1.15.0-src.zip | +sha512 | +pgp |
The {@link org.apache.commons.text.similarity.CosineDistance Cosine Distance} - * utilises a {@link org.apache.commons.text.similarity.RegexTokenizer regular expression tokenizer (\w+)}. + * utilizes a {@link org.apache.commons.text.similarity.RegexTokenizer regular expression tokenizer (\w+)}. * And the {@link org.apache.commons.text.similarity.LevenshteinDistance Levenshtein Distance}'s * behavior can be changed to take into consideration a maximum throughput.
* From 001fc65a0c5c4e2fdc337094243db517ac1bbf8f Mon Sep 17 00:00:00 2001 From: Gary Gregorydiff --git a/src/main/java/org/apache/commons/text/similarity/SimilarityScore.java b/src/main/java/org/apache/commons/text/similarity/SimilarityScore.java index 4a2f7de7e3..dcd1dbaf46 100644 --- a/src/main/java/org/apache/commons/text/similarity/SimilarityScore.java +++ b/src/main/java/org/apache/commons/text/similarity/SimilarityScore.java @@ -27,8 +27,8 @@ * following properties: *
*
* Notice, these are two of the properties that contribute to {@code d} being a metric.
From 23d232af1331e15b3d752ffbaa18eae91e0fbb52 Mon Sep 17 00:00:00 2001
From: Gary Gregory "flammable\ninflammable"
*
*
+ *
* @param str the String to be word wrapped, may be null.
* @param wrapLength the column to wrap the words at, less than 1 is treated as 1.
* @param newLineStr the string to insert for a new line, {@code null} uses the system property line separator.
diff --git a/src/main/java/org/apache/commons/text/translate/SinglePassTranslator.java b/src/main/java/org/apache/commons/text/translate/SinglePassTranslator.java
index 90dd7f23bc..2fd4f67100 100644
--- a/src/main/java/org/apache/commons/text/translate/SinglePassTranslator.java
+++ b/src/main/java/org/apache/commons/text/translate/SinglePassTranslator.java
@@ -37,6 +37,7 @@ private String getClassName() {
/**
* {@inheritDoc}
+ *
* @throws IllegalArgumentException if {@code index != 0}.
*/
@Override
From 02a5aa15b5a77d0048430483806f41f0637e8528 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Thu, 1 Jan 2026 16:55:27 -0500
Subject: [PATCH 29/61] Bump commons.bytebuddy.version from 1.18.2 to 1.18.3
(#734)
Bumps `commons.bytebuddy.version` from 1.18.2 to 1.18.3.
Updates `net.bytebuddy:byte-buddy` from 1.18.2 to 1.18.3
- [Release notes](https://github.com/raphw/byte-buddy/releases)
- [Changelog](https://github.com/raphw/byte-buddy/blob/master/release-notes.md)
- [Commits](https://github.com/raphw/byte-buddy/compare/byte-buddy-1.18.2...byte-buddy-1.18.3)
Updates `net.bytebuddy:byte-buddy-agent` from 1.18.2 to 1.18.3
- [Release notes](https://github.com/raphw/byte-buddy/releases)
- [Changelog](https://github.com/raphw/byte-buddy/blob/master/release-notes.md)
- [Commits](https://github.com/raphw/byte-buddy/compare/byte-buddy-1.18.2...byte-buddy-1.18.3)
---
updated-dependencies:
- dependency-name: net.bytebuddy:byte-buddy
dependency-version: 1.18.3
dependency-type: direct:development
update-type: version-update:semver-patch
- dependency-name: net.bytebuddy:byte-buddy-agent
dependency-version: 1.18.3
dependency-type: direct:development
update-type: version-update:semver-patch
...
Signed-off-by: dependabot[bot]
* When two objects sequences are compared through the
From 57e2298100e616f3a8833e7c3761f5e3bd4e5e26 Mon Sep 17 00:00:00 2001
From: Gary Gregory
* When two objects sequences are compared through the
From 98a5115e8da7fabc7415e268a3a1d67cf512cf38 Mon Sep 17 00:00:00 2001
From: Gary Gregory
+ * Client code should specify a registry
* of {@code FormatFactory} instances associated with {@code String}
* format names. This registry will be consulted when the format elements are
* parsed from the message pattern. In this way custom patterns can be specified,
* and the formats supported by {@link java.text.MessageFormat} can be overridden
* at the format and/or format style level (see MessageFormat). A "format element"
- * embedded in the message pattern is specified (()? signifies optionality):
+ * embedded in the message pattern is specified (()? signifies optionality):
+ *
* {@code {}argument-number({@code ,}format-name * ({@code ,}format-style)?)?{@code }} + *
* *
* format-name and format-style values are trimmed of surrounding whitespace
diff --git a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
index ac7b4018aa..4b4740ea9a 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
@@ -277,7 +277,9 @@ private static
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
- * strings.
* This implementation of the Levenshtein distance algorithm is from
* http://www.merriampark.com/ldjava.htm
*
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
- * strings.
* This implementation of the Levenshtein distance algorithm is from
* http://www.merriampark.com/ldjava.htm
*
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
- * strings.
* This implementation of the Levenshtein distance algorithm is from
* http://www.merriampark.com/ldjava.htm
*
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
- * strings.
* This implementation of the Levenshtein distance algorithm is from
* http://www.merriampark.com/ldjava.htm
*
+ * strings.
+ *
+ * strings.
+ *
+ * strings.
+ *
+ * strings.
+ *
* This implementation follows from Algorithms on Strings, Trees and Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein distance - * algorithm from http://www.merriampark.com/ld.htm + * algorithm. *
* *