return chars[c - 1];
        } else if ((lv <= needle) && (needle < cv)) {
          return chars[l];
        } else if (needle == rv) {
          return chars[r];
        } else if (needle < cv) {
          rv = cv;
          r = c;
          c = l + (r - l) / 2;
          cv = prob[c];
        } else if (needle == cv) {
          return chars[c];
        } else {
          lv = cv;
          l = c;

              @Override
              public ListenableFuture<Integer> apply(Throwable t) throws Exception {
                if (!wrapInFuture) {
                  throw expectedException;
                } else {
                  return immediateFailedFuture(expectedException);
                }
              }
            });

            if (valueReference.isLoading()) {
              createNewEntry = false;
            } else {
              V value = valueReference.get();
              if (value == null) {
                enqueueNotification(
                    entryKey, hash, value, valueReference.getWeight(), RemovalCause.COLLECTED);
              } else if (map.isExpired(e, now)) {

              @Override
              public ListenableFuture<Integer> apply(Throwable t) throws Exception {
                if (!wrapInFuture) {
                  throw expectedException;
                } else {
                  return immediateFailedFuture(expectedException);
                }
              }
            });

    map.entrySet()
        .removeIf(
            entry -> {
              if (entry.getValue().equals(1)) {
                map.put(entry.getKey(), 2);
                return true;
              } else {
                return false;
              }
            });
    assertEquals(3, map.size());
    assertFalse(map.containsValue(1));
  }

  public void testRemoveIfWithConcurrentRemoval() {

            if (valueReference.isLoading()) {
              createNewEntry = false;
            } else {
              V value = valueReference.get();
              if (value == null) {
                enqueueNotification(
                    entryKey, hash, value, valueReference.getWeight(), RemovalCause.COLLECTED);
              } else if (map.isExpired(e, now)) {

        if (valueEquivalence.equivalent(leftValue, rightValue)) {
          onBoth.put(leftKey, leftValue);
        } else {
          differences.put(leftKey, ValueDifferenceImpl.create(leftValue, rightValue));
        }
      } else {
        onlyOnLeft.put(leftKey, leftValue);
      }
    }
  }

          return chars[c - 1];
        } else if ((lv <= needle) && (needle < cv)) {
          return chars[l];
        } else if (needle == rv) {
          return chars[r];
        } else if (needle < cv) {
          rv = cv;
          r = c;
          c = l + (r - l) / 2;
          cv = prob[c];
        } else if (needle == cv) {
          return chars[c];
        } else {
          lv = cv;
          l = c;

 * complete, some objects captured during the computation are closed.
 *
 * <p>A pipeline of {@code ClosingFuture}s is a tree of steps. Each step represents either an
 * asynchronously-computed intermediate value, or else an exception that indicates the failure or
 * cancellation of the operation so far. The only way to extract the value or exception from a step
 * is by declaring that step to be the last step of the pipeline. Nevertheless, we refer to the

                i--;
            }
            return canon.substring( i + 1 );
        } else if( share != null ) {
            return share + '/';
        } else if( url.getHost().length() > 0 ) {
            return url.getHost() + '/';
        } else {
            return "smb1://";
        }
    }

/**