* Get the node's child at the given index, where zero represents the first child. * * This method is fairly fast, but its cost is technically lo

* Iterate over all of the matches in the order that they were found. * * Each match contains the index of the pattern that matched, and a list o

* Get this node's *named* child at the given index. * * See also {@link Node#isNamed}. * This method is fairly fast, but its cost is technica