}
      if (systemLoader != null) {
        try {
          return systemLoader.loadClass(FINALIZER_CLASS_NAME);
        } catch (ClassNotFoundException e) {
          // Ignore. Finalizer is simply in a child class loader.
          return null;
        }
      } else {
        return null;
      }
    }
  }

  /**

    int size;
    boolean entriesUsed;

    /**
     * If non-null, a duplicate key we found in a previous buildKeepingLast() or buildOrThrow()
     * call. A later buildOrThrow() can simply report this duplicate immediately.
     */
    @Nullable DuplicateKey duplicateKey;

    /**
     * Creates a new builder. The returned builder is equivalent to the builder generated by {@link

    }

    private <T> T getAs(final String key, final T defaultValue, final Function<String, T> parser) {
        final Object obj = get(key);
        return obj == null ? defaultValue : parser.apply(obj.toString());
    }

    /**
     * Retrieves a setting value as a String.
     * @param key The key of the setting.
     * @param defaultValue The default value if the setting is not found.

   * edges().contains(endpoints)}.
   *
   * <p>Unlike the other {@code EndpointPair}-accepting methods, this method does not throw if the
   * endpoints are unordered and the graph is directed; it simply returns {@code false}. This is for
   * consistency with the behavior of {@link Collection#contains(Object)} (which does not generally
   * throw if the object cannot be present in the collection), and the desire to have this method's

d.a[d.n:d.rate], p) d.n += x p = p[x:] // If the sponge is full, apply the permutation. if d.n == d.rate { d.permute() } } return } // read squeezes an arbitrary number of bytes from the sponge. func (d *Digest) readGeneric(out []byte) (n int, err error) { // If we're still absorbing, pad and apply the permutation. if d.state == spongeAbsorbing { d.padAndPermute() } n = len(out) // Now, do the squeezing. for len(out) > 0 { // Apply the permutation if we've squeezed the sponge dry. if d.n == d.rate...

d.a[d.n:d.rate], p) d.n += x p = p[x:] // If the sponge is full, apply the permutation. if d.n == d.rate { d.permute() } } return } // read squeezes an arbitrary number of bytes from the sponge. func (d *Digest) readGeneric(out []byte) (n int, err error) { // If we're still absorbing, pad and apply the permutation. if d.state == spongeAbsorbing { d.padAndPermute() } n = len(out) // Now, do the squeezing. for len(out) > 0 { // Apply the permutation if we've squeezed the sponge dry. if d.n == d.rate...

import static java.util.Collections.singletonMap;

public class GradleUserManualPlugin implements Plugin<Project> {

    public static final String DOCS_GRADLE_ORG = "https://docs.gradle.org/";

    @Override
    public void apply(Project project) {
        ProjectLayout layout = project.getLayout();
        TaskContainer tasks = project.getTasks();

    assertThat(map).containsEntry(54, 2);
    assertThat(map).containsEntry(443, 3);
    assertThat(map).containsEntry(1, 4);
    assertThat(cache.get(6)).isEqualTo(5);
    assertThat(cache.apply(7)).isEqualTo(6);
  }

  @Test
  public void expireAfterAccess() {
    Cache<Integer, Integer> cache =
        CacheBuilder.newBuilder().expireAfterAccess(1000, MILLISECONDS).ticker(fakeTicker).build();

// the size of 'retvals' is less than the number of outputs. This call sets
// *num_retvals to the number of outputs.
//
// If async execution is enabled, the call may simply enqueue the execution
// and return "non-ready" handles in `retvals`. Note that any handles contained
// in 'op' should not be mutated till the kernel execution actually finishes.
//

            build(request, result, importIds);
        }

        return result;
    }

    @FunctionalInterface
    private interface InterpolateString {
        String apply(String s) throws InterpolationException;
    }

    private List<Profile> getInterpolatedProfiles(
            Model rawModel, DefaultProfileActivationContext context, DefaultModelProblemCollector problems) {