}

	// There are two possibilities:
	// - We use a KMS -> There must be a key ID and a KMS data key.
	// - We use a K/V -> There must be no key ID and no KMS data key.
	// Otherwise, the metadata is corrupted.
	keyID, idPresent := metadata[MetaKeyID]
	b64KMSSealedKey, kmsKeyPresent := metadata[MetaDataEncryptionKey]
	if !idPresent && kmsKeyPresent {

        // Then
        assertNotNull(resp);
        assertTrue(resp instanceof ServerMessageBlock2Response);
        assertTrue(resp instanceof ServerMessageBlock2);
    }

    @Test
    @DisplayName("Should return correct OVERHEAD constant value")
    void testOverheadConstant() {
        // Then
        assertEquals(Smb2Constants.SMB2_HEADER_LENGTH + 16, Smb2ReadResponse.OVERHEAD);
    }

    @Test

            assertTrue(exception.getMessage().contains("Data exceeds buffer size"));
        }

        @Test
        @DisplayName("Should write data at correct offset in buffer")
        void testDataOffsetCalculation() {
            byte[] data = new byte[50];
            Arrays.fill(data, (byte) 0xAB);
            request.setData(data, 0, data.length);

You can have sub-dependencies and "trees" of sub-dependencies of any size and shape, and any or all of them can use `yield`.

**FastAPI** will make sure that the "exit code" in each dependency with `yield` is run in the correct order.

For example, `dependency_c` can have a dependency on `dependency_b`, and `dependency_b` on `dependency_a`:

{* ../../docs_src/dependencies/tutorial008_an_py39.py hl[6,14,22] *}

And all of them can use `yield`.

 *   <li>Conversion of individual Hankaku Kana characters to Zenkaku Kana characters.</li>
 *   <li>Handling of voiced (ﾞ) and semi-voiced (ﾟ) sound marks to produce the correct Zenkaku Kana characters.</li>
 * </ul>
 *
 * <p>Example usage:</p>
 * <pre>
 * {@code
 * HankakuKanaToZenkakuKana normalizer = new HankakuKanaToZenkakuKana();

                    // Visit each unvisited node
                    allSteps().forEach(node -> visitNode(node, visited, sortedNodes));
                    // Reverse the sorted nodes to get the correct order
                    Collections.reverse(sortedNodes);
                    this.sortedNodes = sortedNodes;
                }
            }
        }
        return sortedNodes;
    }

        byte[] paramWords = buffer.array();

        // Call the method to test
        int bytesRead = response.readParameterWordsWireFormat(paramWords, 0);

        // Assert that the correct number of bytes were read
        assertEquals(34, bytesRead);

        // Assert that the serverData fields are populated correctly
        assertEquals(0, response.dialectIndex);

     * 10^floor(log10(x)).
     */

    if (approxCmp > 0) {
      /*
       * The code is written so that even completely incorrect approximations will still yield the
       * correct answer eventually, but in practice this branch should almost never be entered, and
       * even then the loop should not run more than once.
       */
      do {
        approxLog10--;

        }

        Map<EventType, Long> stats = logger.getStatistics();
        assertEquals(Long.valueOf(threadCount * eventsPerThread), stats.get(EventType.AUTHENTICATION_SUCCESS),
                "Should have correct total number of events");
    }

                    try {
                        Files.deleteIfExists(handleFile);
                    } catch (IOException deleteEx) {
                        log.error("Failed to delete corrupted handle file: " + handleFile, deleteEx);
                    }
                }
            }
        } catch (IOException e) {