* SMB2 Lease Key
 *
 * Represents a 16-byte lease key used to identify leases in SMB2/SMB3
 * MS-SMB2 2.2.13.2.8
 */
public class Smb2LeaseKey {

    private final byte[] key;
    private static final SecureRandom RANDOM = new SecureRandom();
    private static final int LEASE_KEY_SIZE = 16;

    /**
     * Create a new random lease key
     */
    public Smb2LeaseKey() {
        this.key = new byte[LEASE_KEY_SIZE];

    private static final long TEST_CREATE_TIME = System.currentTimeMillis() - 10000;
    private static final long TEST_LAST_ACCESS_TIME = System.currentTimeMillis() - 8000;
    private static final long TEST_LAST_WRITE_TIME = System.currentTimeMillis() - 6000;
    private static final long TEST_CHANGE_TIME = System.currentTimeMillis() - 4000;
    private static final int TEST_ATTRIBUTES = 0x20; // FILE_ATTRIBUTE_ARCHIVE

 * via {@link #setDefault}.
 *
 * @author Kevin Bourrillion
 * @since 10.0
 */
@GwtIncompatible
@J2ktIncompatible
@NullMarked
public final class NullPointerTester {

  private final ClassToInstanceMap<Object> defaults = MutableClassToInstanceMap.create();
  private final List<Member> ignoredMembers = new ArrayList<>();

  private ExceptionTypePolicy policy = ExceptionTypePolicy.NPE_OR_UOE;

  /*

      checkState(current != null);
      current.setValue(value);
    }
  }

  /** An {@code Iterator} over distinct keys in key head order. */
  private final class DistinctKeyIterator implements Iterator<K> {
    final Set<K> seenKeys = Sets.<K>newHashSetWithExpectedSize(keySet().size());
    @Nullable Node<K, V> next = head;
    @Nullable Node<K, V> current;
    int expectedModCount = modCount;

      Class<? super @NonNull E> type, E... contents) {
    return new MinimalCollection<>(type, true, contents);
  }

  private final E[] contents;
  private final Class<? super @NonNull E> type;
  private final boolean allowNulls;

  // Package-private so that it can be extended.
  MinimalCollection(Class<? super @NonNull E> type, boolean allowNulls, E... contents) {

 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class BigIntegerMathBenchmark {
  private static final int[] factorials = new int[ARRAY_SIZE];
  private static final int[] slowFactorials = new int[ARRAY_SIZE];
  private static final int[] binomials = new int[ARRAY_SIZE];

  @Param({"50", "1000", "10000"})
  int factorialBound;

  @BeforeExperiment
  void setUp() {

    private final List<Suppression> suppressions = new ArrayList<>();

    @Override
    public void suppress(Closeable closeable, Throwable thrown, Throwable suppressed) {
      suppressions.add(new Suppression(closeable, thrown, suppressed));
    }
  }

  /** Record of a call to suppress. */
  private static class Suppression {
    private final Closeable closeable;

      throw new AssertionError(e); // programmer error
    }
  }

  // Secret sauce for setting final fields; don't make it public.
  static final class FieldSetter<T> {
    private final Field field;

    private FieldSetter(Field field) {
      this.field = field;
      field.setAccessible(true);
    }

    void set(T instance, Object value) {
      try {

      throw new AssertionError(e); // programmer error
    }
  }

  // Secret sauce for setting final fields; don't make it public.
  static final class FieldSetter<T> {
    private final Field field;

    private FieldSetter(Field field) {
      this.field = field;
      field.setAccessible(true);
    }

    void set(T instance, Object value) {
      try {

 * manage collections of search results and crawled documents.
 *
 */
public class DocList extends ArrayList<Map<String, Object>> {

    /** Serial version UID for serialization */
    private static final long serialVersionUID = 1L;

    /** Total content size of all documents in this list */
    private long contentSize = 0;

    /** Total processing time for all documents in this list */