"analyzer": "empty_analyzer"
          }
        }
      },
      {
        "lang_pt": {
          "match": "*_pt",
          "mapping": {
            "type": "text",
            "analyzer": "portuguese_analyzer"
          }
        }
      },
      {
        "lang_pt-br": {
          "match": "*_pt-br",
          "mapping": {
            "type": "text",

            "analyzer": "empty_analyzer"
          }
        }
      },
      {
        "lang_pt": {
          "match": "*_pt",
          "mapping": {
            "type": "text",
            "analyzer": "portuguese_analyzer"
          }
        }
      },
      {
        "lang_pt-br": {
          "match": "*_pt-br",
          "mapping": {
            "type": "text",

            "analyzer": "empty_analyzer"
          }
        }
      },
      {
        "lang_pt": {
          "match": "*_pt",
          "mapping": {
            "type": "text",
            "analyzer": "portuguese_analyzer"
          }
        }
      },
      {
        "lang_pt-br": {
          "match": "*_pt-br",
          "mapping": {
            "type": "text",

    for (n = len; n < size - n; n <<= 1) {
      System.arraycopy(array, 0, array, n, n);
    }
    System.arraycopy(array, 0, array, n, size - n);
    return new String(array);
  }

  /**
   * Returns the longest string {@code prefix} such that {@code a.toString().startsWith(prefix) &&
   * b.toString().startsWith(prefix)}, taking care not to split surrogate pairs. If {@code a} and
   * {@code b} have no common prefix, returns the empty string.

/**
 * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders
 * elements FIFO (first-in-first-out). The head of the queue is that element that has been
 * on the queue the longest time. The tail of the queue is that element that has been on
 * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue
 * retrieval operations obtain elements at the head of the queue.

that would otherwise combine into a single token. Also, a newline or end of file
may trigger the insertion of a <a href="#Semicolons">semicolon</a>.
While breaking the input into tokens,
the next token is the longest sequence of characters that form a
valid token.
</p>

<h3 id="Semicolons">Semicolons</h3>

<p>
The formal syntax uses semicolons <code>";"</code> as terminators in