versionChecks.forEach { (versionMatcher, failureMatcher) ->
        if (versionMatcher.matches(PlatformVersion) && failureMatcher.matches(e)) {
          return
        }
      }

      throw e
    }

    fun failIfExpected() {
      versionChecks.forEach { (versionMatcher, failureMatcher) ->
        if (versionMatcher.matches(PlatformVersion)) {
          val description = StringDescription()

				t.Fatalf("Test %d: %s: Failed to fetch the copied object: <ERROR> %s", i+1, instanceType, err)
			}
			if _, err = io.Copy(buffer, r); err != nil {
				r.Close()
				t.Fatalf("Test %d: %s: Failed to fetch the copied object: <ERROR> %s", i+1, instanceType, err)
			}
			r.Close()
			if !bytes.Equal(testCase.data, buffer.Bytes()) {

    assertFailsWith<IllegalArgumentException> {
      table.map(0x110000, Buffer())
    }
  }

  @Test fun binarySearchEvenSizedRange() {
    val table = listOf(1, 3, 5, 7, 9, 11)

    // Search for matches.
    assertEquals(0, binarySearch(0, 6) { index -> 1.compareTo(table[index]) })
    assertEquals(1, binarySearch(0, 6) { index -> 3.compareTo(table[index]) })

import com.google.common.base.CharMatcher.NamedFastMatcher;
import java.util.BitSet;

/**
 * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with
 * linear probing to check for matches.
 *
 * @author Christopher Swenson
 */
@GwtIncompatible // no precomputation is done in GWT
final class SmallCharMatcher extends NamedFastMatcher {
  static final int MAX_SIZE = 1023;
  private final char[] table;

        }

        @Override
        public ResponseProcessor getResponseProcessor() {
            return responseProcessor;
        }
    }

    /**
     * Conditional test rule that matches based on URL pattern
     */
    public static class UrlPatternRule implements Rule {
        private static final long serialVersionUID = 1L;
        private final String ruleId;
        private final String urlPattern;

            if (StringUtil.isNotBlank(regex)) {
                clientMap.put(Pattern.compile(regex), client);
            }
        }
    }

    /**
     * Retrieves a client that matches the given URL key.
     * @param urlKey The URL key to match.
     * @return The matching CrawlerClient instance, or null if no match is found.
     */
    public CrawlerClient getClient(final String urlKey) {

 *   <li>{@linkplain State#TERMINATED TERMINATED}
 * </ul>
 *
 * <p>There are deviations from this if there are failures or if {@link Service#stopAsync} is called
 * before the {@link Service} reaches the {@linkplain State#RUNNING RUNNING} state. The set of legal
 * transitions form a <a href="http://en.wikipedia.org/wiki/Directed_acyclic_graph">DAG</a>,

   * > GeneralizedTime.
   */
  internal val time: DerAdapter<Long> =
    object : DerAdapter<Long> {
      override fun matches(header: DerHeader): Boolean = Adapters.UTC_TIME.matches(header) || Adapters.GENERALIZED_TIME.matches(header)

      override fun fromDer(reader: DerReader): Long {
        val peekHeader =
          reader.peekHeader()

        }

        /**
         * Check if this file info matches the given attributes
         *
         * @param otherSize size to compare
         * @param otherLastModified last modified time to compare
         * @param otherAttributes attributes to compare
         * @return true if attributes match
         */
        public boolean matches(long otherSize, long otherLastModified, long otherAttributes) {

 *   <li>{@linkplain State#TERMINATED TERMINATED}
 * </ul>
 *
 * <p>There are deviations from this if there are failures or if {@link Service#stopAsync} is called
 * before the {@link Service} reaches the {@linkplain State#RUNNING RUNNING} state. The set of legal
 * transitions form a <a href="http://en.wikipedia.org/wiki/Directed_acyclic_graph">DAG</a>,