}

          @Override
          public final Service stopAsync() {
            return delegate.stopAsync();
          }

          @Override
          public final void awaitRunning() {
            delegate.awaitRunning();
          }

          @Override
          public final void awaitRunning(long timeout, TimeUnit unit) throws TimeoutException {

        assertEquals(expectedInetAddress, nbtAddress.getInetAddress());
    }

    @Test
    void testToInetAddress() throws UnknownHostException {
        // Test toInetAddress (delegates to getInetAddress)
        mockName = new Name(mockConfig, "TESTHOST", 0x20, null);
        NbtAddress nbtAddress = new NbtAddress(mockName, testAddressInt, false, NbtAddress.H_NODE);

        SmbRandomAccessFile raf = newInstance("r", false, false, false);
        raf.seek(123L);
        assertEquals(123L, raf.getFilePointer());
    }

    @Test
    @DisplayName("length(): delegates to SmbFile.length()")
    void length_delegates() throws Exception {
        SmbRandomAccessFile raf = newInstance("r", false, false, false);
        SmbFile file = (SmbFile) getField(raf, "file");

    }

    /**
     * Retrieves a crawling configuration by its config ID.
     * This method uses caching to improve performance and automatically determines
     * the configuration type and delegates to the appropriate service.
     *
     * @param configId the configuration ID to retrieve
     * @return the CrawlingConfig object or null if not found or on error
     */

            this.parent = parent;
            this.startPosition = startPosition;
            this.pageSize = pageSize;
        }

        /**
         * Gets the parent SearchRequestParams object that this wrapper delegates to.
         *
         * @return the parent SearchRequestParams instance
         */
        public SearchRequestParams getParent() {
            return parent;
        }

        @Override

   */
  public String join(Iterable<?> parts) {
    /*
     * If we can quickly determine how many elements there are likely to be, then we can use the
     * fastest possible implementation, which delegates to the array overload of String.join.
     *
     * In theory, we can quickly determine the size of any Collection. However, thanks to
     * regrettable implementations like our own Sets.filter, Collection.size() is sometimes a

   * {@link Collections#frequency} (which would presumably perform more poorly).
   *
   * <p><b>Note:</b> the utility method {@link Iterables#frequency} generalizes this operation; it
   * correctly delegates to this method when dealing with a multiset, but it can also accept any
   * other iterable type.
   *
   * @param element the element to count occurrences of

   * {@link Collections#frequency} (which would presumably perform more poorly).
   *
   * <p><b>Note:</b> the utility method {@link Iterables#frequency} generalizes this operation; it
   * correctly delegates to this method when dealing with a multiset, but it can also accept any
   * other iterable type.
   *
   * @param element the element to count occurrences of

   * may prefer to invoke that method directly; this method exists only for consistency with the
   * other utilities in this package.
   *
   * <p><b>Note:</b> this method simply delegates to the JDK method {@link Float#compare}. It is
   * provided for consistency with the other primitive types, whose compare methods were not added
   * to the JDK until JDK 7.
   *
   * @param a the first {@code float} to compare

        assertFalse(qrList.equals(null));
        assertFalse(qrList.equals("string"));
        assertTrue(qrList.equals(documentList)); // QueryResponseList equals delegates to parent list
    }

    public void test_listOperations_boundaryIndexes() {
        List<Map<String, Object>> documentList = new ArrayList<>();
        Map<String, Object> doc1 = new HashMap<>();