op -> op.uniqueBy(id).changeNoticeLogToDebug().params(paramsOp));
            }
        });
    }

    /**
     * Finds a scheduled job by its unique identifier.
     *
     * @param jobUnique the unique identifier of the job
     * @return an optional containing the scheduled job if found, empty otherwise
     */

    samples = this.getSubjectGenerator().samples();
    resetContainer();
  }

  /**
   * @return the contents of the container under test, for use by {@link #expectContents(Object[])
   *     expectContents(E...)} and its friends.
   */
  protected abstract Collection<E> actualContents();

  /**
   * Replaces the existing container under test with a new container created by the subject
   * generator.
   *

import org.mockito.Mock;
import org.mockito.junit.jupiter.MockitoExtension;

import jcifs.internal.SMBProtocolDecodingException;
import jcifs.internal.util.SMBUtil;

/**
 * Test class for BasicFileInformation interface and its implementations
 */
@ExtendWith(MockitoExtension.class)
class BasicFileInformationTest {

    @Mock
    private BasicFileInformation mockBasicFileInfo;

    private FileBasicInfo fileBasicInfo;

   * minimize unnecessary signals. One simple and correct algorithm is to signal some other waiter
   * with a satisfied guard (if one exists) whenever any thread occupying the monitor exits the
   * monitor, either by unlocking all of its held locks, or by starting to wait for a guard. This
   * includes exceptional exits, so all control paths involving signalling must be protected by a
   * finally block.
   *

a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library.  The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom.  The Lesser General
Public License permits more lax criteria for linking other code with
the library.

  We call this license the "Lesser" General Public License because it

                    // don't have enough credits/space for the first request, block until available
                    // for space there is nothing we can do, callers need to make sure that a single message fits

                    try {
                        final long timeout = getResponseTimeout(chain);
                        if (params.contains(RequestParam.NO_TIMEOUT)) {

 *
 * <ul>
 *   <li>Each lock adds (and removes) itself to/from a ThreadLocal Set of acquired locks when the
 *       Thread acquires its first hold (and releases its last remaining hold).
 *   <li>Before the lock is acquired, the lock is checked against the current set of acquired
 *       locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either

        # args, so each arg winds up back in the position where it started, but
        # possibly modified.
        #
        # NB: a `for` loop captures its iteration list before it begins, so
        # changing the positional parameters here affects neither the number of
        # iterations, nor the values presented in `arg`.
        shift                   # remove old arg

        verify(tree).send(captor.capture(), any());
        assertNotNull(captor.getValue());
    }

    @Test
    @DisplayName("recv delegates to input.readDirect and returns its value")
    void testRecvDelegation() throws Exception {
        SmbPipeHandleImpl spyTarget = spy(target);
        SmbPipeInputStream in = mock(SmbPipeInputStream.class);
        doReturn(in).when(spyTarget).getInput();

### Added
- github.com/antihax/optional: [v1.0.0](https://github.com/antihax/optional/tree/v1.0.0)
- github.com/benbjohnson/clock: [v1.0.3](https://github.com/benbjohnson/clock/tree/v1.0.3)
- github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0)
- github.com/certifi/gocertifi: [2c3bb06](https://github.com/certifi/gocertifi/tree/2c3bb06)