child
The node's child at the given index, if any.
This method is fairly fast, but its cost is technically log(i)
, so if you might be iterating over a long list of children, you should use children or Tree.walk instead.
Throws
If the index exceeds the child count.
The node's child at the given index, if any.
This method is fairly fast, but its cost is technically log(i)
, so if you might be iterating over a long list of children, you should use children or Tree.walk instead.
Throws
If the index exceeds the child count.
The node's child at the given index, if any.
This method is fairly fast, but its cost is technically log(i)
, so if you might be iterating over a long list of children, you should use children or Tree.walk instead.
Throws
If the index exceeds the child count.
The node's child at the given index, if any.
This method is fairly fast, but its cost is technically log(i)
, so if you might be iterating over a long list of children, you should use children or walk instead.
Throws
If the index exceeds the child count.