fixup rebase

lucene/core/src/java/org/apache/lucene/util/automaton/StringsToAutomaton.java

@@ -32,11 +32,9 @@
  * algorithm described in <a href="https://aclanthology.org/J00-1002.pdf">Incremental Construction
  * of Minimal Acyclic Finite-State Automata by Daciuk, Mihov, Watson and Watson</a>. This requires
  * sorted input data, but is very fast (nearly linear with the input size). Also offers the ability
- * to directly build a binary {@link Automaton} representation.
+ * to directly build a binary {@link Automaton} representation. Users should access this
+ * functionality through {@link Automata} static methods.
  *
- * @see #build(Collection)
- * @see #build(Collection, boolean)
- * @see #build(BytesRefIterator, boolean)
  * @see Automata#makeStringUnion(Collection)
  * @see Automata#makeBinaryStringUnion(Collection)
  * @see Automata#makeStringUnion(BytesRefIterator)
@@ -234,15 +232,6 @@ private Automaton completeAndConvert() {
     return a.finish();
   }
 
-  /**
-   * Build a minimal, deterministic automaton from a sorted list of {@link BytesRef} representing
-   * strings in UTF-8. These strings must be binary-sorted. Creates an {@link Automaton} with UTF-8
-   * codepoints as transition labels.
-   */
-  static Automaton build(Collection<BytesRef> input) {
-    return build(input, false);
-  }
-
   /**
    * Build a minimal, deterministic automaton from a sorted list of {@link BytesRef} representing
    * strings in UTF-8. These strings must be binary-sorted. Creates an {@link Automaton} with either

lucene/core/src/test/org/apache/lucene/util/automaton/TestStringsToAutomaton.java

@@ -102,7 +102,7 @@ public void testLargeTerms() throws Exception {
         e.getMessage()
             .startsWith(
                 "This builder doesn't allow terms that are larger than "
-                    + StringsToAutomaton.MAX_TERM_LENGTH
+                    + Automata.MAX_STRING_UNION_TERM_LENGTH
                     + " characters"));
 
     byte[] b1k = ArrayUtil.copyOfSubArray(b10k, 0, 1000);