Closed clason closed 6 months ago
OOps.
(foo/bar
(baz)
(bez))
creates a tree like
(program ; [0, 0] - [15, 0]
(list ; [0, 0] - [2, 8]
(symbol) ; [0, 1] - [0, 8]
(list ; [1, 2] - [1, 7]
(symbol)) ; [1, 3] - [1, 6]
(list ; [2, 2] - [2, 7]
(symbol)))) ; [2, 3] - [2, 6]
Does #34 work better? Then I'll merge that despite the state increase.
Yes, it now does work with the formatter more often.
tbf, both this and #34 does work. But somehow nvim/format-queries.lua somehow doesn't like this as much as #34
Okie, let's go with #34 then. The indeterminacy is bad, though, and should be looked at.
Add
/
to validIDENTIFIER
to supportfoo/bar
supertype nodes in queries, e.g., for Haskell. Followup could add dedicated support for such nodes (if there is a use case).Closes #29.
@lucario387