if (userPassedSupplier) {
      throw new AssertionError(
          "expected to throw "
              + expectedThrowable.getSimpleName()
              + " but returned result: "
              + result);
    } else {
      throw new AssertionError("expected to throw " + expectedThrowable.getSimpleName());
    }
  }

  private enum PlatformSpecificExceptionBatch {
    PLATFORM {
      @GwtIncompatible

    BigInteger absX = x.abs();
    int exponent = absX.bitLength() - 1;
    // exponent == floor(log2(abs(x)))
    if (exponent < Long.SIZE - 1) {
      return x.longValue();
    } else if (exponent > MAX_EXPONENT) {
      return x.signum() * POSITIVE_INFINITY;
    }

    /*
     * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding

   * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph.
   *
   * <p>If {@code edge} already connects {@code nodeU} to {@code nodeV} (in the specified order if
   * this network {@link #isDirected()}, else in any order), then this method will have no effect.
   *
   * @return {@code true} if the network was modified as a result of this call
   * @throws IllegalArgumentException if {@code edge} already exists in the graph and does not

				}
				// This is a one time activity we shall do this
				// here and allow stale ARN to be removed. We shall
				// never reach a stage where we will have stale
				// notification configs.
			}
		} else {
			writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
			return
		}
	}

	configData, err := xml.Marshal(config)
	if err != nil {
		writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
		return
	}

                            // Java 9 multi-release JAR entry, we must keep it nested in the output
                            file.subpath(0, 3).toString()
                        } else {
                            ""
                        }

                        val reader = ClassReader(Files.newInputStream(file))
                        val details = classes[reader.className]

            for (i = 0, u = 0; i < end; i++) {
                c = userInfo.charAt(i);
                if (c == ';') {
                    domain = userInfo.substring(0, i);
                    u = i + 1;
                } else if (c == ':') {
                    password = userInfo.substring(i + 1);
                    break;
                }
            }
            username = userInfo.substring(u, i);
        }

            // future that eventually came from immediateVoidFuture(), this doesn't leak throwables
            // or completion values.
            newFuture.setFuture(oldFuture);
          } else if (outputFuture.isCancelled() && taskExecutor.trySetCancelled()) {
            // If this CAS succeeds, we know that the provided callable will never be invoked,

		TESTS_RUN_STATUS=$((TESTS_RUN_STATUS & 0))
	else
		echo -e "${GREEN}${1} Passed${NC}"
	fi
}

function verify_resiliency_failure() {
	docs/resiliency/resiliency-verify-failure-script.sh
	RESULT=$(grep "script passed" <resiliency-verify-failure.log)
	if [ "$RESULT" != "script passed" ]; then
		echo -e "${RED}${1} Failed${NC}"
		TESTS_RUN_STATUS=$((TESTS_RUN_STATUS & 0))
	else
		echo -e "${GREEN}${1} Passed${NC}"
	fi
}

        mmHeap.offer(randomInt);
        insertIntoReplica(replica, randomInt);
        currentHeapSize++;
      } else {
        /* remove either min or max */
        if (random.nextBoolean()) {
          removeMinFromReplica(replica, mmHeap.poll());
        } else {
          removeMaxFromReplica(replica, mmHeap.pollLast());
        }
        for (Integer v : replica.keySet()) {

      assertEquals(9, multimap.size());
    } else {
      assertEquals(8, multimap.size());
    }

    Multimap<@Nullable String, @Nullable Integer> unmodifiable;
    if (multimap instanceof SortedSetMultimap) {
      unmodifiable =
          Multimaps.unmodifiableSortedSetMultimap(
              (SortedSetMultimap<@Nullable String, @Nullable Integer>) multimap);
    } else if (multimap instanceof SetMultimap) {