}

        String baseName;
        String ext = missing ? ".miss" : ".dep";
        Path trackingFile = null;

        StringBuilder indent = new StringBuilder();
        ArrayList<String> trackingData = new ArrayList<>();

        if (collectStepTrace == null && plugin != null) {
            ext = ".plugin";

import okhttp3.Response;

public class SampleHttpClient {
  private final OkHttpClient client;

  public SampleHttpClient() {
    client = new OkHttpClient.Builder().build();
  }

  public void makeCall(HttpUrl url) throws IOException {
    try (Response response = client.newCall(new Request(url, Headers.EMPTY, "GET", null)).execute()) {
      System.out.println(response.body().string());
    }
  }

    private static final long serialVersionUID = 1L;

    /**
     * Creates a new {@link BadPaddingRuntimeException} with the specified cause.
     *
     * @param cause
     *            the cause
     */
    public BadPaddingRuntimeException(final BadPaddingException cause) {
        super("ECL0105", new Object[] { cause.getMessage() }, cause);
    }

            throw ComponentUtil.getResponseManager().new404("Unsupported Open Search Description Document response.");
        }

        return new StreamResponse(osddFile.getName()).contentType(contentType + "; charset=" + encoding).stream(out -> {
            try (InputStream ins = new FileInputStream(osddFile)) {
                out.write(ins);
            }
        });
    }

    /**
     * Sets the OSDD path.

   */
  static BigInteger randomNonNegativeBigInteger(int numBits) {
    int digits = RANDOM_SOURCE.nextInt(numBits);
    if (digits == 0) {
      return new BigInteger(1, RANDOM_SOURCE);
    } else {
      return new BigInteger(digits, RANDOM_SOURCE).setBit(digits);
    }
  }

  /**
   * Equivalent to calling randomPositiveBigInteger(numBits) and then flipping the sign with 50%
   * probability.

        graph.addNode(gen.nextInt(NODE_POOL_SIZE));
      }
      ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes());
      while (graph.edges().size() < NUM_EDGES) {
        graph.putEdge(getRandomElement(nodeList, gen), getRandomElement(nodeList, gen));
      }
      ArrayList<EndpointPair<Integer>> edgeList = new ArrayList<>(graph.edges());

      assertThat(graph.nodes()).hasSize(NUM_NODES);

    return new TestStringMultisetGenerator() {
      @Override
      protected Multiset<String> create(String[] elements) {
        return LinkedHashMultiset.create(asList(elements));
      }

      @Override
      public List<String> order(List<String> insertionOrder) {
        List<String> order = new ArrayList<>();
        for (String s : insertionOrder) {

[[release-highlights]]
== What's new in {minor-version}

coming::[{minor-version}]

Here are the highlights of what's new and improved in {es} {minor-version}!
ifeval::[\\{release-state}\\"!=\\"unreleased\\"]
For detailed information about this release, see the <<es-release-notes>> and
<<breaking-changes>>.
endif::[]
<% if (priorVersions.size() > 0) { %>
// Add previous release to the list
Other versions:

<%

        return pattern.matcher(path).find();
    }

    /**
     * Creates a new dictionary file instance for the given parameters.
     *
     * @param id the encoded identifier for the dictionary file
     * @param path the file path of the dictionary
     * @param timestamp the timestamp of the dictionary file
     * @return a new DictionaryFile instance
     */

        final Map<String, Object> requestBody = new HashMap<>();
        final String keyProp = NAME_PREFIX + id;
        requestBody.put(KEY_PROPERTY, keyProp);
        return requestBody;
    }

    @Override
    protected Map<String, Object> getUpdateMap() {
        final Map<String, Object> updateMap = new HashMap<>();
        updateMap.put(KEY_PROPERTY, NAME_PREFIX + "new");
        return updateMap;
    }

    @Test