import java.io.IOException;
import java.io.InputStream;
import java.util.Iterator;
import org.jspecify.annotations.Nullable;

/**
 * An {@link InputStream} that concatenates multiple substreams. At most one stream will be open at
 * a time.
 *
 * @author Chris Nokleberg
 * @since 1.0
 */
@J2ktIncompatible
@GwtIncompatible
final class MultiInputStream extends InputStream {

    return new SampleElements<>(
        mapEntry("one", "January"),
        mapEntry("two", "February"),
        mapEntry("three", "March"),
        mapEntry("four", "April"),
        mapEntry("five", "May"));
  }

  @Override
  public SampleElements<String> sampleKeys() {
    return new SampleElements<>("one", "two", "three", "four", "five");
  }

  @Override

  @Override
  protected Map<String, Integer> makePopulatedMap() {
    return SerializableTester.reserialize(ImmutableMap.of("one", 1, "two", 2, "three", 3));
  }

  @Override
  protected String getKeyNotInPopulatedMap() {
    return "minus one";
  }

  @Override
  protected Integer getValueNotInPopulatedMap() {
    return -1;
  }

        map.put("one", 1);
        map.put("two", 2);
        binary = SerializeUtil.fromObjectToBinary(map);
        @SuppressWarnings("unchecked")
        final Map<String, Integer> resultMap = (Map<String, Integer>) SerializeUtil.fromBinaryToObject(binary);
        assertEquals(map.size(), resultMap.size());
        assertEquals(map.get("one"), resultMap.get("one"));
    }

    /**

 *
 * <p>There are two entry points for creating a {@code Traverser}: {@link
 * #forTree(SuccessorsFunction)} and {@link #forGraph(SuccessorsFunction)}. You should choose one
 * based on your answers to the following questions:
 *
 * <ol>
 *   <li>Is there only one path to any node that's reachable from any start node? (If so, the graph
 *       to be traversed is a tree or forest even if it is a subgraph of a graph which is neither.)

import static com.google.common.primitives.UnsignedLongs.max;
import static com.google.common.primitives.UnsignedLongs.min;
import static com.google.common.truth.Truth.assertThat;
import static java.math.BigInteger.ONE;

import com.google.common.annotations.GwtCompatible;
import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import com.google.common.collect.testing.Helpers;

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package okhttp3.internal.connection

import java.io.IOException

/** Attempt routes one at a time until one connects. */
internal class SequentialExchangeFinder(
  override val routePlanner: RoutePlanner,
) : ExchangeFinder {
  override fun find(): RealConnection {
    var firstException: IOException? = null

    super(false, true, true, true, true);
  }

  @Override
  protected SortedMap<String, Integer> makePopulatedMap() {
    NavigableMap<String, Integer> map = new SafeTreeMap<>();
    map.put("one", 1);
    map.put("two", 2);
    map.put("three", 3);
    return SerializableTester.reserialize(map);
  }

  @Override
  protected SortedMap<String, Integer> makeEmptyMap() throws UnsupportedOperationException {

    override fun execute(details: CompatibilityCheckDetails<NullawayState>) {
        with(details) {
            when {
                // Nullaway-enabled targets must not depend on nullaway-disabled ones.
                // They can depend on nullaway-undefined, which any external dependency is going to be.
                producerValue == NullawayState.DISABLED && consumerValue == NullawayState.ENABLED -> incompatible()

/**
 * TeamCity helper script that prints the list of commits in the current PR (one SHA per line).
 *
 * Usage (Java 11+ single-file source execution):
 *   java .teamcity/scripts/FindCommits.java <target_branch_name>
 *
 * Commit range logic:
 * - Uses origin/<target_branch_name> as the target
 * - If HEAD is a merge commit and one parent equals the target SHA, the other parent is treated as PR head