Iterator<Entry<Integer, String>> iterator = entries.iterator();
    Entry<Integer, String> entry = iterator.next();
    entry.setValue("two"); // changes the iterator's current entry value
    assertThat(map.get(1)).isEqualTo("two");
    assertEquals(Integer.valueOf(1), map.inverse().get("two"));
    iterator.remove(); // removes the updated entry
    assertTrue(map.isEmpty());
  }

  public void testInsertionOrder() {

    ThrowingTearDown tearDownTwo = new ThrowingTearDown("two");
    stack.addTearDown(tearDownTwo);

    assertEquals(false, tearDownOne.ran);
    assertEquals(false, tearDownTwo.ran);

    try {
      stack.runTearDown();
      fail("runTearDown should have thrown an exception");
    } catch (RuntimeException expected) {
      assertThat(expected).hasMessageThat().isEqualTo("two");

    }

    return b1;
  }

  /**
   * Reads an unsigned {@code short} as specified by {@link DataInputStream#readUnsignedShort()},
   * except using little-endian byte order.
   *
   * @return the next two bytes of the input stream, interpreted as an unsigned 16-bit integer in
   *     little-endian byte order
   * @throws IOException if an I/O error occurs
   */
  @CanIgnoreReturnValue // to skip some bytes
  @Override

 *
 * @author wyukawa
 */
public abstract class ObjectUtil {

    /**
     * Do not instantiate.
     */
    protected ObjectUtil() {
    }

    /**
     * Returns true if the two objects are equal, or both are null.
     *
     * @param object1 the first object
     * @param object2 the second object
     * @return true if equal or both null, false otherwise
     */

        // Prepare SIDs, two need resolution, one already resolved
        SID s1 = sid("S-1-5-21-10-11-12-1001");
        SID s2 = sid("S-1-5-21-10-11-12-1002");
        SID s3 = sid("S-1-5-21-10-11-12-1003");
        jcifs.SID[] arr = new jcifs.SID[] { s1, s2, s3 };

        // First call should resolve two (offset=0,length=2)
        doAnswer(inv -> {

        }
    }

    @Test
    @DisplayName("Happy path: iterates and adapts entries without filter")
    void happyPath_noFilter_returnsAdaptedResources() throws Exception {
        // Arrange: two valid entries
        setupParentForUrlCreation();
        StubFileEntry e1 = new StubFileEntry("SERVER1", SmbConstants.TYPE_SERVER);
        StubFileEntry e2 = new StubFileEntry("SERVER2", SmbConstants.TYPE_SERVER);

	docker start resiliency-minio1-1
	./mc ready myminio
}

function test_resiliency_failure_with_servers_down() {
	echo
	echo -e "${GREEN}Running test_resiliency_failure_with_servers_down ...${NC}"
	# Stop two nodes
	docker stop resiliency-minio1-1
	docker stop resiliency-minio2-1
	sleep 10

	verify_resiliency_failure "${FUNCNAME[0]}"

	# Restart the nodes
	docker start resiliency-minio1-1

     * Implementations must ensure that if two requests are equal according to
     * {@link #equals(Object)}, they have the same hashcode.
     *
     * @return a hash code value for this request
     */
    @Override
    int hashCode();

    /**
     * Returns {@code true} if the specified object is equal to this request.
     * Two requests are considered equal if they have the same type and all

# Sub Applications - Mounts { #sub-applications-mounts }

If you need to have two independent FastAPI applications, with their own independent OpenAPI and their own docs UIs, you can have a main app and "mount" one (or more) sub-application(s).

## Mounting a **FastAPI** application { #mounting-a-fastapi-application }

    }
    return 11; // initial capacity will be rounded up to 16
  }

  /**
   * Returns an unmodifiable view of the union of two multisets. In the returned multiset, the count
   * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration
   * order of the returned multiset matches that of the element set of {@code multiset1} followed by