{"ast_node_type":"other","tokens":[{"end":79,"kind":"keyword","start":0,"text":"//"}]}
        // four running workers. Based on limited benchmarking, this appears to
        // So, the heuristic below tries to keep one item in the queue for every
        // be more than sufficient to avoid increasing compilation times.