when(delegate.hasNext()).thenReturn(true, true, false);
        when(delegate.next()).thenReturn(skip, take);

        // First call: reject, Second call: accept
        when(filter.accept(any(SmbResource.class))).thenReturn(false, true);

        NetServerFileEntryAdapterIterator itr = new NetServerFileEntryAdapterIterator(parent, delegate, filter);

  tensorflow::mutex mu TF_ACQUIRED_AFTER(TF_Graph::mu);
  int last_num_graph_nodes;

  // If true, TF_SessionRun and similar methods will call
  // ExtendSessionGraphHelper before running the graph (this is the default
  // public behavior). Can be set to false if the caller needs to call
  // ExtendSessionGraphHelper manually.
  std::atomic<bool> extend_before_run;
};

struct TF_ImportGraphDefOptions {

            return loadCallback.call();
        }

        public void setLoadCallback(LoadCallback callback) {
            this.loadCallback = callback;
        }

        public int getLoadCallCount() {
            return loadCallCount.get();
        }
    }

    @FunctionalInterface
    interface LoadCallback {
        int call();
    }

   *
   * <p>If {@code !range.contains(k)}, {@link #get(Comparable) get(k)} will return the same result
   * before and after a call to {@code remove(range)}. If {@code range.contains(k)}, then after a
   * call to {@code remove(range)}, {@code get(k)} will return {@code null}.
   */
  void remove(Range<K> range);

  /**

    @DisplayName("ensureTreeConnected caches tree and acquires on each call")
    void testEnsureTreeConnectedCaching() throws CIFSException {
        // Arrange: first ensureTreeConnected comes from pipe
        when(pipe.ensureTreeConnected()).thenReturn(tree);
        when(tree.acquire()).thenReturn(tree); // method returns itself per implementation

        // Act: call twice

        }
    }

    /**
     * Only call this method while holding a tree handle
     *
     * @return the connected tree type
     */
    public int getTreeType() {
        try (SmbTreeImpl t = getTree()) {
            return t.getTreeType();
        }
    }

    /**
     *
     * Only call this method while holding a tree handle
     *

   *
   * Returns the duration in nanoseconds to sleep until the next scheduled call to this method.
   * Returns -1 if no further cleanups are required.
   */
  fun closeConnections(now: Long): Long {
    // Compute the concurrent call capacity for each address. We won't close a connection if doing
    // so would violate a policy, unless it's OLD.

        // First call without SAStruts.method
        mockRequest.setQueryString("query=test");
        assertEquals(customPath, webApiRequest.getServletPath());

        // Second call with SAStruts.method
        mockRequest.setQueryString("SAStruts.method=execute");
        assertEquals(originalPath, webApiRequest.getServletPath());

        // Third call without SAStruts.method again

   * {@code iterator().remove()} of an unmodifiable list could throw either {@link
   * IllegalStateException} or {@link UnsupportedOperationException}. Note that iterator
   * implementations should always throw one of the exceptions in a {@code PermittedExceptions}
   * instance, since {@code PermittedExceptions} is thrown only when a method call is invalid.
   *

    return incidentEdges();
  }

  @Override
  public Set<E> outEdges() {
    return incidentEdges();
  }

  @Override
  public N adjacentNode(E edge) {
    // We're relying on callers to call this method only with an edge that's in the graph.
    return requireNonNull(incidentEdgeMap.get(edge));
  }

  @Override
  public @Nullable N removeInEdge(E edge, boolean isSelfLoop) {
    if (!isSelfLoop) {