Project: aptanastudio
Issue APSTUD-4388: Consider improving performance of AST merging in CompositeParser
While looking over an issue related to offsets when parsing nested languages in RHTML/HTML, I noticed that we have code that effectively merges nodes into the top-level AST. I believe the current implementation can be improved considerably, performance-wise. Currently, all nodes are flattened into a list and that list is traversed for each node being inserted into the tree. Instead, we should take advantage of the existing functionality in IParseNode#getNodeAtOffset.
Story points: 13