当 worker 线程调用 ForkJoinTask.join() 等待子任务结果时，经过 help-stealing 尝试仍未完成，就会走到补偿逻辑：
Most game engines interact with programming languages similar to the image below.
，详情可参考WPS官方版本下载
// 单调栈：存储索引（而非值），栈内索引对应的nums值保持「单调递减」
almost every regex engine today descends from one of two approaches: Thompson’s NFA construction (1968) or backtracking (1994). Thompson-style engines (grep, RE2, Rust’s regex) give you linear-time guarantees but only support the “standard” fragment - | and *. backtracking engines (the rest, 95% chance the one you’re using) give you a mix of advanced features like backreferences, lookarounds.., but are unreliable, and can blow up to exponential time on adversarial inputs, which is a real security concern known as ReDoS. to be more precise, this exponential behavior is not the only problem with backtracking engines - they also handle the OR (|) operator much slower, but let’s try to start with the big picture.