result += '(curl)'
            }
            return result
        }
    }

    /**
     * Repeatedly match the pattern to the string, calling the closure with the
     * matchers each time there is a match. If there are characters that don't
     * match then blow up. If the closure takes two parameters then the second
     * one is "is this the last match?".
     */

     *
     * <p>If this returns false, then no query can take more than O(log n).
     *
     * <p>Note that for a RegularImmutableSet with elements with truly random hash codes, contains
     * operations take expected O(1) time but with high probability take O(log n) for at least some
     * element. (https://en.wikipedia.org/wiki/Linear_probing#Analysis)
     *
     * <p>This method may return {@code true} even on truly random input, but {@code

   *
   * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
   * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
   * spent a lot of time benchmarking your specific needs, use one of those instead.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,

 * AbstractMapBasedMultimap} calls {@link #createCollection()} to create the collection of values
 * for that key. The subclass should not call {@link #createCollection()} directly, and a new
 * instance should be created every time the method is called.
 *
 * <p>For example, the subclass could pass a {@link java.util.TreeMap} during construction, and
 * {@link #createCollection()} could return a {@link java.util.TreeSet}, in which case the

        long currentTime = roleQueryHelper.getCurrentTime();
        assertTrue(currentTime > 0);

        long currentTimeMillis = System.currentTimeMillis();
        // Allow for small time difference
        assertTrue(Math.abs(currentTime - currentTimeMillis) < 1000);
    }

    @Test
    public void test_constants() {
        assertEquals("userRoles", RoleQueryHelper.USER_ROLES);
    }

  public void testPlatformThreadFactory_default() {
    ThreadFactory factory = MoreExecutors.platformThreadFactory();
    assertThat(factory).isNotNull();
    // Executors#defaultThreadFactory() may return a new instance each time.
    assertEquals(factory.getClass(), Executors.defaultThreadFactory().getClass());
  }

  public void testThreadRenaming() {
    Executor renamingExecutor =

# Interval (seconds) for polling heartbeats and events.
coordinator.poll.interval=60
# Time-to-live (ms) for instance heartbeat documents.
coordinator.heartbeat.ttl=180000
# Time-to-live (ms) for operation lock documents.
coordinator.operation.ttl=7200000
# Maximum number of retries for acquiring an operation lock.
coordinator.operation.retry=3
# Time-to-live (ms) for event notification documents.
coordinator.event.ttl=600000

    assertThat(c1e0.connectionIndex).isEqualTo(1) // Fresh connection.
  }

  /**
   * Check we would use an existing connection to a later DNS result instead of connecting to the
   * first DNS result for the first time.
   */
  @Test
  fun prefersExistingCompatible() {
    server.enqueue(MockResponse())
    server.enqueue(MockResponse())
    val connectCount = AtomicInteger()
    val listener: EventListener =

     * and then to XOR them together.  The strideTable enables us to hash an int followed by 12
     * zero bytes (3 ints), while the byteTable is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

    Crc32cHasher() {
      super(16);
    }

# @param update_command [String] The command used to update the package
#   manager. Required. Think `apt-get update`.
# @param update_tracking_file [String] The location of the file tracking the
#   last time the update command was run. Required. Should be in a place that
#   is cached by vagrant-cachier.
# @param install_command [String] The command used to install a package.
#   Required. Think `apt-get install #{package}`.