testData.add(createRelatedContent("exact", "Exact Match", ""));
        testData.add(createRelatedContent("regex:test.*", "Regex Match: __QUERY__", ""));
        mockBhv.setTestData(testData);

        relatedContentHelper.load();

        // Test exact match
        String[] results = relatedContentHelper.getRelatedContents("exact");
        assertEquals(1, results.length);

        System.setProperty("java.version", "11.0.1");

        String[] args = new String[] { "8:-Xmx1g", // Exact Java 8
                "11:-Xmx2g", // Exact Java 11
                "17:-Xmx4g", // Exact Java 17
                "11:-XX:+UseG1GC" // Another exact Java 11
        };

        String[] result = JvmUtil.filterJvmOptions(args);
        assertEquals(2, result.length);

        String input = "exact line\nanother line";
        InputStream is = new ByteArrayInputStream(input.getBytes(StandardCharsets.UTF_8));

        InputStreamThread thread = new InputStreamThread(is, StandardCharsets.UTF_8, 10, null);
        thread.start();
        thread.join(1000);

        assertTrue(thread.contains("exact line"));
        assertTrue(thread.contains("another line"));

   * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
   * algorithm, x86 variant</a> (little-endian variant), using the given seed value.
   *
   * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A).
   *
   * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code
   * HashFunction} returned by the original {@code murmur3_32} method.

    public void test_complexConditions() {
        final Map<String, String[]> conditions = new HashMap<>();
        conditions.put("q", new String[] { "search term" });
        conditions.put("epq", new String[] { "exact phrase" });
        conditions.put("oq", new String[] { "word1 word2" });
        conditions.put("nq", new String[] { "exclude" });
        conditions.put("filetype", new String[] { "pdf" });

    } else {
      checkState(yStats.sumOfSquaresOfDeltas() > 0.0);
      return LinearTransformation.vertical(xStats.mean());
    }
  }

  /**
   * {@inheritDoc}
   *
   * <p><b>Note:</b> This tests exact equality of the calculated statistics, including the floating
   * point values. Two instances are guaranteed to be considered equal if one is copied from the

   * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
   * algorithm, x86 variant</a> (little-endian variant), using the given seed value.
   *
   * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A).
   *
   * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code
   * HashFunction} returned by the original {@code murmur3_32} method.

    if (dividend >= 0) {
      return dividend / divisor;
    }

    /*
     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
     * guaranteed to be either exact or one less than the correct value. This follows from fact that
     * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite
     * trivial.
     */

   * multiset itself).
   *
   * <p>Despite the method name, this method attempts to avoid actually copying the data when it is
   * safe to do so. The exact circumstances under which a copy will or will not be performed are
   * undocumented and subject to change.
   *
   * <p>This method is not type-safe, as it may be called on elements that are not mutually
   * comparable.

            }

            @Override
            public void store(CrawlingInfo entity) {
                assertEquals("Test Crawl", entity.getName());
                // Don't check exact expiration time, just verify it's reasonable
                assertNotNull(entity.getExpiredTime());
                assertTrue("Expiration time should be in the future", entity.getExpiredTime().longValue() > currentTime);