import java.util.ResourceBundle;

import org.codelibs.core.io.ResourceBundleUtil;
import org.codelibs.core.misc.DisposableUtil;
import org.codelibs.core.misc.LocaleUtil;

/**
 * Class for assembling messages from message codes and arguments.
 *
 * @author higa
 */
public abstract class MessageFormatter {

    /**
     * Do not instantiate.
     */
    protected MessageFormatter() {
    }

            return true;
          }

          @Override
          public List<String> getResult() {
            return result;
          }
        });
  }

  /**
   * Copies all bytes from a URL to an output stream.
   *
   * @param from the URL to read from
   * @param to the output stream
   * @throws IOException if an I/O error occurs
   */

import okhttp3.Cache;
import okhttp3.HttpUrl;
import okhttp3.MediaType;
import okhttp3.OkHttpClient;
import okhttp3.Request;
import okhttp3.Response;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.nodes.Element;

/**
 * Fetches HTML from a requested URL, follows the links, and repeats.
 */
public final class Crawler {
  private final OkHttpClient client;

 * @since 23.0
 */
@Beta
@DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
public interface PredecessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
   *

        node.nextSibling.previousSibling = node.previousSibling;
      }
    }
    size--;
  }

  /** Removes all nodes for the specified key. */
  private void removeAllNodes(@ParametricNullness K key) {
    Iterators.clear(new ValueForKeyIterator(key));
  }

  /** An {@code Iterator} over all nodes. */
  private final class NodeIterator implements ListIterator<Entry<K, V>> {
    int nextIndex;
    @Nullable Node<K, V> next;

     * be read without locking. Next fields of nodes are immutable (final). All list additions are
     * performed at the front of each bin. This makes it easy to check changes, and also fast to
     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This

        assertTrue(ex.getMessage().contains("Refreshing credentials is not supported"));
    }

    @Test
    @DisplayName("clone: copies all relevant fields")
    void clone_copiesFields() {
        Subject subj = new Subject();
        Kerb5Authenticator auth = new Kerb5Authenticator(subj, "DOM", "user", "pass");
        auth.setUser("alice");

          <!-- We add the link ourselves so that we can choose Java 25 over the version that -source suggests. -->
          <detectJavaApiLink>false</detectJavaApiLink>
          <offlineLinks>

            NtStatus.NT_STATUS_SHARING_VIOLATION, NtStatus.NT_STATUS_INVALID_PARAMETER })
    @DisplayName("Should handle various NT status codes")
    void testVariousNTStatusCodes(int ntStatus) {
        // When
        SmbException exception = new SmbException(ntStatus, false);

        // Then
        assertNotNull(exception);

        // Act & Assert
        SmbException thrown = assertThrows(SmbException.class, () -> {
            new LsaPolicyHandle(mockDcerpcHandle, server, access);
        });

        // In smb1, non-NTSTATUS error codes get mapped to NT_STATUS_UNSUCCESSFUL (0xC0000001)
        assertEquals(0xC0000001, thrown.getNtStatus()); // NT_STATUS_UNSUCCESSFUL
        verify(mockDcerpcHandle, times(1)).sendrecv(any(MsrpcLsarOpenPolicy2.class));
    }