*/
  public int findSuffixIndex(List<String> labels, @Nullable PublicSuffixType desiredType) {
    int partsSize = labels.size();
    int nodeIndex = 0; // Root node.
    int bestResult = -1;

    // Iterate over the labels in reverse order (from top level domain to the left).
    for (int i = partsSize - 1; i >= 0; i--) {
      // Decode the current node.
      int firstChild = trieData.charAt(nodeIndex * NODE_SIZE + 1);

     *
     * <p>This method works by finding all git tags prior to {@param versionString} in the same minor series, and
     * examining the git tree for that tag. By doing this over each tag, it is possible to see how the contents
     * of the changelog directory changed over time.
     *
     * @param gitWrapper used to call `git`
     * @param versionString the "current" version. Does not require a tag in git.

### Grammar to use when talking to the reader

Use the formal grammar (use `vous` instead of `tu`).

Additionally, in instructional sentences, prefer the present tense for obligations:

- Prefer `vous devez …` over `vous devrez …`, unless the English source explicitly refers to a future requirement.

This will be especially useful when you use it in a **large code base** where you use **the same dependencies** over and over again in **many *path operations***.

## To `async` or not to `async` { #to-async-or-not-to-async }

 *     ...
 * }
 * </pre>
 *
 * @author shot
 * @param <T> the type of array elements
 */
public class ArrayIterator<T> implements Iterator<T> {

    /** The array of elements to iterate over */
    protected final T[] items;

    /** The index of the currently referenced element */
    protected int index = 0;

    /**
     * Returns an {@link Iterable} that wraps the array for use in a for-each statement.

 *
 * Build up a collection by starting with [EmptyTags] and repeatedly calling [plus]. Each such call
 * returns a new instance.
 *
 * This collection is optimized for safe concurrent access over a very small number of elements.
 *
 * This collection and is expected to hold fewer than 10 elements. Each operation is _O(N)_, and so
 * building an instance with _N_ elements is _O(N**2)_.
 */
internal sealed class Tags {

   * is set to {@code null}.
   *
   * <p>Like the {@link #toArray()} method, this method acts as bridge between array-based and
   * collection-based APIs. Further, this method allows precise control over the runtime type of the
   * output array, and may, under certain circumstances, be used to save allocation costs.
   *
   * <p>Suppose {@code x} is a queue known to contain only strings. The following code can be used

    E[] items = this.items;
    // if removing front item, just advance
    if (i == takeIndex) {
      items[takeIndex] = null;
      takeIndex = inc(takeIndex);
    } else {
      // slide over all others up through putIndex.
      for (; ; ) {
        int nexti = inc(i);
        if (nexti != putIndex) {
          items[i] = items[nexti];
          i = nexti;
        } else {
          items[i] = null;

        }
    }

    @Nested
    @DisplayName("Integration Tests")
    class IntegrationTests {

        @Test
        @DisplayName("Should support NTLM over HTTPS")
        void testNtlmSupport() {
            // When
            Handler testHandler = new Handler();

            // Then
            assertTrue(testHandler instanceof jcifs.smb1.http.Handler);

	argv0, err := exec.LookPath(os.Args[0])
	if err != nil {
		return err
	}

	// Invokes the execve system call.
	// Re-uses the same pid. This preserves the pid over multiple server-respawns.
	return syscall.Exec(argv0, os.Args, os.Environ())
}

// freezeServices will freeze all incoming S3 API calls.
// For each call, unfreezeServices must be called once.
func freezeServices() {