When you don't use `Annotated` and instead use the **(old) default value style**, if you call that function without FastAPI in **other places**, you have to **remember** to pass the arguments to the function for it to work correctly, otherwise the values will be different from what you expect (e.g. `QueryInfo` or something similar instead of `str`). And your editor won't complain, and Python won't complain running that function, only when the operations inside error out.

            logger.warn("Failed to get object tags: bucket={}, path={}", bucketName, path, e);
        }
        return null;
    }

    /**
     * Preprocesses a URI to ensure it has the correct storage protocol prefix.
     * @param uri the URI to preprocess
     * @return the preprocessed URI with storage:// prefix
     * @throws CrawlerSystemException if the URI is empty
     */

        assertTrue(lenCap.getAllValues().stream().allMatch(len -> len == 1));
    }

    @Test
    @DisplayName("write(short/char/int/long/float/double): correct byte lengths")
    void write_multiByteVariants_lengths() throws Exception {
        SmbRandomAccessFile raf = spy(newInstance("rw", false, true, false));
        doNothing().when(raf).write(any(byte[].class), anyInt(), anyInt());

        this.commandDestroyTimeout = commandDestroyTimeout;
    }

    /**
     * Gets file extension from MIME type for creating temp files with proper extensions.
     * This helps ImageMagick correctly identify file formats.
     * @param mimeType The MIME type of the content.
     * @return The file extension including the dot (e.g., ".gif"), or empty string if unknown.
     */

 * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for
 * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,

 * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for
 * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit
 * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
 * implementations in Java use). For the many uses of hash functions beyond data structures,

   *       one with {@link CharSequence#charAt(int)}.
   *   <li>use {@link Appendable#append(CharSequence)} in {@link #copyTo(Appendable)} and {@link
   *       #copyTo(CharSink)}. We know this is correct since strings are immutable and so the length
   *       can't change, and it is faster because many writers and appendables are optimized for
   *       appending string instances.
   * </ul>
   */

   *       one with {@link CharSequence#charAt(int)}.
   *   <li>use {@link Appendable#append(CharSequence)} in {@link #copyTo(Appendable)} and {@link
   *       #copyTo(CharSink)}. We know this is correct since strings are immutable and so the length
   *       can't change, and it is faster because many writers and appendables are optimized for
   *       appending string instances.
   * </ul>
   */

      expectBytes = 16;
    } else {
      ipString = hostAddr;
      expectBytes = 4;
    }

    // Parse the address, and make sure the length/version is correct.
    Scope scope = parseScope ? new Scope() : null;
    byte[] addr = ipStringToBytes(ipString, scope);
    if (addr == null || addr.length != expectBytes) {
      return null;
    }

* Azure VMSS: support VM names...