assertEquals(Method.GET, data.getMethod());
        assertEquals("https://example.com/article/12345", data.getUrl());
    }

    public void test_realWorldUsageExample2() {
        // Real-world example: posting data
        RequestData data = RequestDataBuilder.newRequestData().post().url("https://api.example.com/data").weight(2.0f).build();

        assertNotNull(data);
        assertEquals(Method.POST, data.getMethod());

  \"-Dlibrary.jline.path=${MAVEN_HOME}/lib/jline-native\" \
  \"-Dmaven.multiModuleProjectDirectory=$MAVEN_PROJECTBASEDIR\" \
  $LAUNCHER_CLASS \
  $MAVEN_ARGS"

# Add remaining arguments with proper quoting
for arg in "$@"; do
    cmd="$cmd \"$arg\""
done

if [ -n "$MAVEN_DEBUG_SCRIPT" ]; then
  echo "[DEBUG] Launching JVM with command:" >&2
  echo "[DEBUG]   $cmd" >&2
fi

    writeOrCountBytes(sink, false)
  }

  /**
   * Either writes this request to [sink] or measures its content length. We have one method do
   * double-duty to make sure the counting and content are consistent, particularly when it comes
   * to awkward operations like measuring the encoded length of header strings, or the
   * length-in-digits of an encoded integer.
   */
  @Throws(IOException::class)

    links = null;
    return result;
  }

  /*
   * For discussion of the safety of the following methods for operating on predecessors and
   * successors, see the comments near the end of CompactHashMap, noting that the methods here call
   * link(), which is defined at the end of this file.
   */

  private int getPredecessor(int entry) {
    return ((int) (link(entry) >>> 32)) - 1;
  }

  @Override

	return getFileInfoVersions(e.metadata, bucket, e.name, true)
}

// metaCacheEntries is a slice of metacache entries.
type metaCacheEntries []metaCacheEntry

// less function for sorting.
func (m metaCacheEntries) less(i, j int) bool {
	return m[i].name < m[j].name
}

// sort entries by name.
// m is sorted and a sorted metadata object is returned.

        private final String pattern;

        /** The compiled regular expression pattern for matching. */
        private final Pattern regexPattern;

        /** The priority length used for sorting (patterns without wildcards are prioritized by length). */
        private final int priorityLength;

        /**
         * Constructs a new PathPattern from the given robots.txt path pattern.

        public DfsStorageInfo() {
            // Default constructor
        }

        /**
         * Storage state flags
         */
        public int state;
        /**
         * Server name hosting the storage
         */
        public String server_name;
        /**
         * Share name on the server
         */
        public String share_name;

        @Override

            throw new UnknownHostException(name.name);
        }

        /* If a target address to query was not specified explicitly
         * with the addr parameter we fall into this resolveOrder routine.
         */

        for (final int element : resolveOrder) {
            try {
                switch (element) {
                case RESOLVER_LMHOSTS:

    links = null;
    return result;
  }

  /*
   * For discussion of the safety of the following methods for operating on predecessors and
   * successors, see the comments near the end of CompactHashMap, noting that the methods here call
   * link(), which is defined at the end of this file.
   */

  private int getPredecessor(int entry) {
    return ((int) (link(entry) >>> 32)) - 1;
  }

  @Override

 * could in principle cause problems for some users. Still, we expect that the benefits of the
 * nullness annotations in particular will outweigh the costs. (And it's worth noting that we have
 * released multiple ListenableFuture.class files that are not byte-for-byte compatible even from
 * the beginning, thanks to using different `-source -target` values for compiling our `-jre` and