mockBhv.setTestData(testData);

        int count = relatedQueryHelper.load();
        assertEquals(1, count); // One virtual host key (empty)

        String[] results = relatedQueryHelper.getRelatedQueries("java");
        assertEquals(3, results.length);
        assertEquals("programming", results[0]);

    }

    @Test
    public void test_load_simpleTerms() {
        List<RelatedContent> testData = new ArrayList<>();
        testData.add(createRelatedContent("java", "Java Programming", ""));
        testData.add(createRelatedContent("python", "Python Programming", ""));
        mockBhv.setTestData(testData);

        int count = relatedContentHelper.load();
        assertEquals(1, count); // One virtual host key (empty)

    "Framework :: Pydantic :: 2",
    "Intended Audience :: Developers",
    "Programming Language :: Python :: 3 :: Only",
    "Programming Language :: Python :: 3.10",
    "Programming Language :: Python :: 3.11",
    "Programming Language :: Python :: 3.12",
    "Programming Language :: Python :: 3.13",
    "Programming Language :: Python :: 3.14",
    "Topic :: Internet :: WWW/HTTP :: HTTP Servers",

        // assertEquals(0, result.size()); // Commented out due to variable scope
    }

    @Test
    public void test_buildQuery_withVariousKeywords() {
        List<String> keywordList = Arrays.asList("java", "programming", "search", "");
        List<FilterFunctionBuilder> functionBuilders = new ArrayList<>();

        try {
            keyMatchHelper.buildQuery(keywordList, functionBuilders);
        } catch (Exception e) {

American English was chosen for the following reasons:

* **Current predominance**: The majority of existing Gradle code and documentation already uses American English
* **Industry standard**: Most widely used programming languages, frameworks, and tools (Java, Kotlin, JavaScript, etc.) use American English in their APIs and documentation
* **Consistency with dependencies**: Gradle's ecosystem and dependencies predominantly use American English

### French instructions about technical terms

Do not try to translate everything. In particular, keep common programming terms (e.g. `framework`, `endpoint`, `plug-in`, `payload`).

Keep class names, function names, modules, file names, and CLI commands unchanged.

### List of English terms and their preferred French translations

    double mean = values.next().doubleValue();
    while (values.hasNext()) {
      double value = values.next().doubleValue();
      count++;
      if (isFinite(value) && isFinite(mean)) {
        // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
        mean += (value - mean) / count;
      } else {
        mean = calculateNewMeanNonFinite(mean, value);
      }
    }
    return mean;
  }

  /**

    long count = 1;
    double mean = checkFinite(values[0]);
    for (int index = 1; index < values.length; ++index) {
      checkFinite(values[index]);
      count++;
      // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
      mean += (values[index] - mean) / count;
    }
    return mean;
  }

  /**
   * Returns the <a href="http://en.wikipedia.org/wiki/Arithmetic_mean">arithmetic mean</a> of

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *

   *
   * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
   * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *