'properties': {
void countingSort(int arr[], int n, int min, int max) {
，更多细节参见搜狗输入法下载
The solver takes the LLB graph and executes it. Each vertex in the DAG is content-addressed, so if you’ve already built a particular step with the same inputs, BuildKit skips it entirely. This is why BuildKit is fast: it doesn’t just cache layers linearly like the old Docker builder. It caches at the operation level across the entire graph, and it can execute independent branches in parallel.，这一点在91视频中也有详细论述
2.3 弹出条件对应法则（重要）