return jobLogBhv.selectByPK(id);
    }

    /**
     * Stores a job log entry in the database.
     * Performs an insert or update operation based on whether the job log already exists.
     *
     * @param jobLog the job log to store
     */
    public void store(final JobLog jobLog) {

        jobLogBhv.insertOrUpdate(jobLog, op -> {
            op.setRefreshPolicy(Constants.TRUE);

    // the behaviour of the non-GWT implementation of newConcurrentHashSet().
    // On the other hand HashSet might be better for code size if apps aren't
    // already using Collections.newSetFromMap and ConcurrentHashMap.
    return Collections.newSetFromMap(new ConcurrentHashMap<E, Boolean>());
  }

                log.debug("Using cached directory listing for: {}", directoryPath);
                return cachedFiles.toArray(new SmbFile[0]);
            }
        }

        // Request directory lease if not already present
        DirectoryCacheScope scope = DirectoryCacheScope.valueOf(smbFile.getContext().getConfig().getDirectoryCacheScope());
        Smb2LeaseKey leaseKey = dirManager.requestDirectoryLease(directoryPath,

        synchronized (PROTOCOL_HANDLERS) {
            if (Handler.factory != null) {
                throw new IllegalStateException("URLStreamHandlerFactory already set.");
            }
            PROTOCOL_HANDLERS.clear();
            Handler.factory = factory;
        }
    }

    /**
     * Constructs a handler with the specified CIFS context.
     *

        // Query was processed successfully

        // Query was processed successfully
    }

    public void test_convertWildcardQuery_withBothWildcards() throws Exception {
        // Test with both wildcards already present
        QueryContext queryContext = new QueryContext("*test*", false);
        WildcardQuery wildcardQuery = new WildcardQuery(new Term(Constants.DEFAULT_FIELD, "*test*"));

        // Here's the tricky bit. We don't have to explicitly check for condition2 in this case.
        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,
        // and the transitive property of equality, this implies that nodeU equals nodeV.

 *   <li>Polling (retrieving and removing) a URL from the queue.</li>
 *   <li>Saving the session (currently a no-op).</li>
 *   <li>Checking if a URL has already been visited.</li>
 *   <li>Generating URL queues from a previous session's access results.</li>
 * </ul>
 *
 * <p>
 * The class uses synchronization to ensure thread safety when accessing and modifying the URL queue.

   * call to {@code shutdown} or {@code shutdownNow} may result in concurrent calls to {@code
   * invokeAll/invokeAny} throwing RejectedExecutionException, although a subset of the tasks may
   * already have been executed.
   *
   * @since 32.0.0 (taking the place of a method with a different return type from 15.0)
   */
  public static ListeningScheduledExecutorService sameThreadScheduledExecutor() {

                          (N predecessor) -> EndpointPair.ordered(predecessor, node)),
                      Iterators.transform(
                          // filter out 'node' from successors (already covered by predecessors,
                          // above)
                          Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),

        if ((flags & SmbConstants.O_CREAT) == SmbConstants.O_CREAT) {
            // create it if necessary
            if ((flags & SmbConstants.O_EXCL) == SmbConstants.O_EXCL) {
                // fail if already exists
                this.openFunction = OPEN_FN_CREATE | OPEN_FN_FAIL_IF_EXISTS;
            } else {
                this.openFunction = OPEN_FN_CREATE | OPEN_FN_OPEN;
            }
        } else {