int count = 0;
            try {
                while (scrollId != null) {
                    final SearchHit[] hits = response.getHits().getHits();
                    if (hits.length == 0) {
                        break;
                    }
                    for (final SearchHit hit : hits) {
                        array[count] = hit.getSourceAsMap();
                        count++;
                    }

   * of JUnit version, implement a {@link SloppyTearDown} instead.
   *
   * <p>tl4j details: For backwards compatibility, {@code junit3.TearDownTestCase} currently does
   * not fail a test when an exception is thrown from one of its {@link TearDown} instances, but
   * this is subject to change. Also, {@code junit4.TearDownTestCase} will.
   *
   * @throws Exception for any reason. {@code TearDownTestCase} ensures that any exception thrown

        this.plugin = plugin;
    }

    public PluginNotFoundException(Plugin plugin, List<ArtifactRepository> remoteRepositories) {
        super(
                "Plugin could not be found, please check its coordinates for typos and ensure the required"
                        + " plugin repositories are defined in the POM",
                plugin.getGroupId(),
                plugin.getArtifactId(),

<?xml version="1.0" encoding="UTF-8"?><metadata>
  <groupId>org.apache.maven.its.mng3906</groupId>
  <artifactId>c</artifactId>
  <version>0.1</version>
  <versioning>
    <release>0.1</release>
    <versions>
      <version>0.1</version>
    </versions>
    <lastUpdated>20081214111138</lastUpdated>
  </versioning>

# Dependencies - `Depends()` and `Security()`

## `Depends()`

Dependencies are handled mainly with the special function `Depends()` that takes a callable.

Here is the reference for it and its parameters.

You can import it directly from `fastapi`:

```python
from fastapi import Depends
```

::: fastapi.Depends

## `Security()`

# About { #about }

  }

  /**
   * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the
   * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in
   * the second multiset from its count in the first multiset, with elements that would have a count
   * of 0 not included. The iteration order of the returned multiset matches that of the element set

        NameQueryRequest request = spy(new NameQueryRequest(mockConfig, mockName));
        byte[] dst = new byte[100];
        int dstIndex = 0;

        // Mock the superclass method to control its behavior
        doReturn(10).when((NameServicePacket) request).writeQuestionSectionWireFormat(any(byte[].class), anyInt());

        int result = request.writeBodyWireFormat(dst, dstIndex);

        LsarSidArrayX lsarSidArrayX = new LsarSidArrayX(sids);

        // Verify num_sids
        assertEquals(2, lsarSidArrayX.num_sids, "num_sids should match the array length");

        // Verify sids array and its contents
        assertNotNull(lsarSidArrayX.sids, "sids array should not be null");
        assertEquals(2, lsarSidArrayX.sids.length, "sids array length should match");

    int expectedHashCode = 0;
    for (E element : getSampleElements()) {
      expectedHashCode += (element == null) ? 0 : element.hashCode();
    }
    assertEquals(
        "A Set's hashCode() should be the sum of those of its elements.",
        expectedHashCode,
        getSet().hashCode());
  }

  @CollectionSize.Require(absent = CollectionSize.ZERO)
  @CollectionFeature.Require(ALLOWS_NULL_VALUES)