Iterator<String> iterator = list.iterator();
    assertThat(tryFind(iterator, equalTo("cool"))).hasValue("cool");
  }

  public void testTryFind_lastElement() {
    Iterable<String> list = Lists.newArrayList("cool", "pants");
    Iterator<String> iterator = list.iterator();
    assertThat(tryFind(iterator, equalTo("pants"))).hasValue("pants");
  }

  public void testTryFind_alwaysTrue() {

    }

    directedGraph.addEdge(N2, N1, E21);
    // View should be updated.
    assertThat(transpose.edgesConnecting(N1, N2)).containsExactly(E21);
    assertThat(transpose.edgeConnecting(N1, N2)).hasValue(E21);
    assertThat(transpose.edgeConnectingOrNull(N1, N2)).isEqualTo(E21);
    AbstractNetworkTest.validateNetwork(transpose);
  }

  @Test
  public void inducedSubgraph_graph() {

        Map<String, Object> map = new HashMap<>();
        map.put("key", "value");
        map.put("nullKey", null);

        assertTrue(MapValueExtractor.hasValue(map, "key"));
        assertFalse(MapValueExtractor.hasValue(map, "nullKey"));
        assertFalse(MapValueExtractor.hasValue(map, "missing"));
    }

  /**
   * Performs a {@linkplain java.lang.invoke.VarHandle#compareAndSet compare-and-set} operation on
   * {@link #valueField} of {@code future}.
   */
  static boolean casValue(AbstractFutureState<?> future, @Nullable Object expect, Object update) {
    return ATOMIC_HELPER.casValue(future, expect, update);
  }

  /** Returns the value of the future, using a volatile read. */
  final @Nullable Object value() {
    return valueField;
  }

        TF_NewShapeAndTypeList(input_shapes_vec.size());
    for (size_t i = 0; i < input_shapes_vec.size(); ++i) {
      const auto& input_shape = input_shapes_vec[i];
      if (input_shape.has_value()) {
        TF_ShapeAndTypeListSetShape(input_shapes, i, input_shape->data(),
                                    input_shape->size());
      } else {
        TF_ShapeAndTypeListSetUnknownShape(input_shapes, i);

      if (owner.value() != this) {
        // nothing to do, we must have been cancelled, don't bother inspecting the future.
        return;
      }
      Object valueToSet = getFutureValue(future);
      if (casValue(owner, this, valueToSet)) {
        complete(
            owner,
            /*
             * Interruption doesn't propagate through a DelegatingToFuture chain (see

      return true;
    }
    return false;
  }

  final @Nullable Listener gasListeners(Listener update) {
    Listener old = listeners;
    listeners = update;
    return old;
  }

  static boolean casValue(AbstractFutureState<?> future, @Nullable Object expect, Object update) {
    if (future.value == expect) {
      future.value = update;
      return true;
    }
    return false;
  }

                + "\"aud\":\"client-123\"," + "\"exp\":1700000000," + "\"iat\":1699999900," + "\"nonce\":\"abc123\","
                + "\"at_hash\":\"hashvalue\"," + "\"c_hash\":\"codehash\"" + "}";
        final Map<String, Object> attributes = new HashMap<>();

        authenticator.parseJwtClaim(jwtClaim, attributes);

     * anything that might slow down execution on such a hot path. Given that the methods are only
     * package-private, I feel OK with just not testing them for NPE.
     *
     * Note that testing casValue is particularly dangerous because it uses Unsafe under some
     * versions of Java, and apparently Unsafe can cause SIGSEGV instead of NPE—almost as if it's
     * not safe.
     */
    concat(

     * anything that might slow down execution on such a hot path. Given that the methods are only
     * package-private, I feel OK with just not testing them for NPE.
     *
     * Note that testing casValue is particularly dangerous because it uses Unsafe under some
     * versions of Java, and apparently Unsafe can cause SIGSEGV instead of NPE—almost as if it's
     * not safe.
     */
    concat(