Use HTTPS in URL

Author: garydgregory

src/main/java/org/apache/commons/text/StringEscapeUtils.java

@@ -576,10 +576,10 @@ public static String escapeHtml3(final String input) {
      * @param input  the {@code String} to escape, may be null
      * @return a new escaped {@code String}, {@code null} if null string input
      * @see <a href="https://hotwired.lycos.com/webmonkey/reference/special_characters/">ISO Entities</a>
-     * @see <a href="http://www.w3.org/TR/REC-html32#latin1">HTML 3.2 Character Entities for ISO Latin-1</a>
-     * @see <a href="http://www.w3.org/TR/REC-html40/sgml/entities.html">HTML 4.0 Character entity references</a>
-     * @see <a href="http://www.w3.org/TR/html401/charset.html#h-5.3">HTML 4.01 Character References</a>
-     * @see <a href="http://www.w3.org/TR/html401/charset.html#code-position">HTML 4.01 Code positions</a>
+     * @see <a href="https://www.w3.org/TR/REC-html32#latin1">HTML 3.2 Character Entities for ISO Latin-1</a>
+     * @see <a href="https://www.w3.org/TR/REC-html40/sgml/entities.html">HTML 4.0 Character entity references</a>
+     * @see <a href="https://www.w3.org/TR/html401/charset.html#h-5.3">HTML 4.01 Character References</a>
+     * @see <a href="https://www.w3.org/TR/html401/charset.html#code-position">HTML 4.01 Code positions</a>
      */
     public static String escapeHtml4(final String input) {
         return ESCAPE_HTML4.translate(input);

src/main/java/org/apache/commons/text/diff/StringsComparator.java

@@ -35,7 +35,7 @@
  * <p>
  * This class implements the comparison algorithm, which is the very efficient
  * algorithm from Eugene W. Myers
- * <a href="http://www.cis.upenn.edu/~bcpierce/courses/dd/papers/diff.ps">
+ * <a href="https://www.cis.upenn.edu/~bcpierce/courses/dd/papers/diff.ps">
  * An O(ND) Difference Algorithm and Its Variations</a>. This algorithm produces
  * the shortest possible {@link EditScript edit script} containing all the
  * {@link EditCommand commands} needed to transform the first sequence into
@@ -220,7 +220,7 @@ private Snake buildSnake(final int start, final int diag, final int end1, final
      * The snake is found using the MYERS Algorithm (this algorithms has
      * also been implemented in the GNU diff program). This algorithm is
      * explained in Eugene Myers article:
-     * <a href="http://www.cs.arizona.edu/people/gene/PAPERS/diff.ps">
+     * <a href="https://www.cs.arizona.edu/people/gene/PAPERS/diff.ps">
      * An O(ND) Difference Algorithm and Its Variations</a>.
      * </p>
      *

src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java

@@ -132,7 +132,7 @@ public static LevenshteinDetailedDistance getDefaultInstance() {
      *
      * <p>
      * This implementation follows from Algorithms on Strings, Trees and Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein distance
-     * algorithm from <a href="http://www.merriampark.com/ld.htm" >http://www.merriampark.com/ld.htm</a>
+     * algorithm from <a href="https://www.merriampark.com/ld.htm" >http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <pre>
@@ -274,14 +274,14 @@ private static <E> LevenshteinResults limitedCompare(SimilarityInput<E> left, Si
      *
      * <p>
      * The previous implementation of the Levenshtein distance algorithm was from
-     * <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
+     * <a href="https://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <p>
      * 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.<br>
      * This implementation of the Levenshtein distance algorithm is from
-     * <a href="http://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
+     * <a href="https://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
      * </p>
      *
      * <pre>
@@ -417,14 +417,14 @@ public LevenshteinDetailedDistance(final Integer threshold) {
      *
      * <p>
      * The previous implementation of the Levenshtein distance algorithm was from
-     * <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
+     * <a href="https://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <p>
      * 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.<br>
      * This implementation of the Levenshtein distance algorithm is from
-     * <a href="http://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
+     * <a href="https://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
      * </p>
      *
      * <pre>
@@ -460,14 +460,14 @@ public LevenshteinResults apply(final CharSequence left, final CharSequence righ
      *
      * <p>
      * The previous implementation of the Levenshtein distance algorithm was from
-     * <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
+     * <a href="https://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <p>
      * 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.<br>
      * This implementation of the Levenshtein distance algorithm is from
-     * <a href="http://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
+     * <a href="https://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
      * </p>
      *
      * <pre>

src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java

@@ -55,7 +55,7 @@ public static LevenshteinDistance getDefaultInstance() {
      *
      * <p>
      * This implementation follows from Algorithms on Strings, Trees and Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein distance
-     * algorithm from <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
+     * algorithm from <a href="https://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <pre>
@@ -324,14 +324,14 @@ public LevenshteinDistance(final Integer threshold) {
      *
      * <p>
      * The previous implementation of the Levenshtein distance algorithm was from
-     * <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
+     * <a href="https://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
      * </p>
      *
      * <p>
      * 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.<br>
      * This implementation of the Levenshtein distance algorithm is from
-     * <a href="http://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
+     * <a href="https://www.merriampark.com/ldjava.htm">http://www.merriampark.com/ldjava.htm</a>
      * </p>
      *
      * <pre>

src/main/java/org/apache/commons/text/translate/EntityArrays.java

@@ -150,7 +150,7 @@ public class EntityArrays {
 
     /**
      * A Map<CharSequence, CharSequence> to escape additional
-     * <a href="http://www.w3.org/TR/REC-html40/sgml/entities.html">character entity
+     * <a href="https://www.w3.org/TR/REC-html40/sgml/entities.html">character entity
      * references</a>. Note that this must be used with {@link #ISO8859_1_ESCAPE} to get the full list of
      * HTML 4.0 character entities.
      */

src/site/xdoc/userguide.xml

@@ -88,24 +88,24 @@ limitations under the License.
         </pre>
       </p>
       <p>
-        For details see <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">StringSubstitutor</a>.
+        For details see <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">StringSubstitutor</a>.
       </p>
       <p>
-        Use a <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/io/StringSubstitutorReader.html">StringSubstitutorReader</a>
+        Use a <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/io/StringSubstitutorReader.html">StringSubstitutorReader</a>
         to avoid reading a whole file into memory as a <code>String</code> to perform string substitution, for example, when a Servlet filters a file to a client.
       </p>
       <p>
         To build a default full-featured substitutor, use:
       </p>
       <ul>
         <li>Commons Text &gt;= 1.8: 
-          <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">org.apache.commons.text.StringSubstitutor.createInterpolator()</a></li>
+          <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">org.apache.commons.text.StringSubstitutor.createInterpolator()</a></li>
         <li>Commons Text &lt; 1.8: 
-          <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">new StringSubstitutor(StringLookupFactory.INSTANCE.interpolatorStringLookup())</a></li>
+          <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">new StringSubstitutor(StringLookupFactory.INSTANCE.interpolatorStringLookup())</a></li>
       </ul>
       <p>
         The available substitutions are defined in 
-        <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">org.apache.commons.text.lookup.StringLookupFactory</a>.
+        <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">org.apache.commons.text.lookup.StringLookupFactory</a>.
       </p>
       </subsection>
 
@@ -180,19 +180,19 @@ limitations under the License.
 
     <section name="Package org.apache.commons.text.lookup">
       <p>Provides algorithms for looking up strings used by a 
-        <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">StringSubstitutor</a>.
+        <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/StringSubstitutor.html">StringSubstitutor</a>.
         Standard lookups are defined in
-        <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">StringLookupFactory</a>
+        <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">StringLookupFactory</a>
         and the associated
-        <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/DefaultStringLookup.html">DefaultStringLookup</a>
+        <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/DefaultStringLookup.html">DefaultStringLookup</a>
         enum.
         </p>
       <p>
         The example below demonstrates use of the default lookups for <code>StringSubstitutor</code> in order to
         construct a complex string.
       </p>
       <p><strong>NOTE:</strong> The list of lookups available by default changed in version 1.10.0. See the documentation for
-        <a href="http://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">StringLookupFactory</a>
+        <a href="https://commons.apache.org/proper/commons-text/apidocs/org/apache/commons/text/lookup/StringLookupFactory.html">StringLookupFactory</a>
         for details and instructions on how to reproduce the previous behavior.
       </p>
       <source>