{"ast_node_type":"other","tokens":[{"end":74,"kind":"keyword","start":0,"text":"//"}]}
    // right is annoying, so I am using an in-place fixed-point iteration,
    // would be a DFS, but getting the graph and its ownership
    // which is `O(nt)` where `t` is the depth of type-parameter constraints,