From ba55162c08b8e661e9f30302475cee771fbd271f Mon Sep 17 00:00:00 2001 From: masiljangajji Date: Thu, 14 Nov 2024 23:00:25 +0900 Subject: [PATCH] docs: clarified that compute is called through invokeAll --- .../parallel-letter-frequency/.approaches/fork-join/content.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/practice/parallel-letter-frequency/.approaches/fork-join/content.md b/exercises/practice/parallel-letter-frequency/.approaches/fork-join/content.md index a532de659..de2cd7307 100644 --- a/exercises/practice/parallel-letter-frequency/.approaches/fork-join/content.md +++ b/exercises/practice/parallel-letter-frequency/.approaches/fork-join/content.md @@ -75,7 +75,7 @@ The core of [`ForkJoinPool`][ForkJoinPool] is the Fork/Join mechanism, which div `THRESHOLD` is the criterion for task division. If the range of texts exceeds the `THRESHOLD`, the task is divided into two subtasks, and [`invokeAll(leftTask, rightTask)`][invokeAll] is called to execute both tasks in parallel. -Each subtask in LetterCountTask will continue calling compute() to divide itself further until the range is smaller than or equal to the `THRESHOLD`. +Each subtask in `LetterCountTask` will continue calling `compute()` (via `invokeAll(leftTask, rightTask)`) to divide itself further until the range is smaller than or equal to the `THRESHOLD`. For tasks that are within the `THRESHOLD`, letter frequency is calculated. The [`Character.isAlphabetic`][isAlphabetic] method identifies all characters classified as alphabetic in Unicode, covering characters from various languages like English, Korean, Japanese, Chinese, etc., returning `true`.