Yep. It also makes unit testing possible by letting the caller provide a fake url fetching backend.
-
-
It repurposes some void* field in the node struct for lines > 2^16, but only for text nodes. For other nodes, it searches through neighbors in the tree for text nodes. But the search algorithm would infinite loop if not for a search limit.
-
So I’m pretty sure you could get the wrong line number in both directions or get no line number at all. (Or maybe 65535 if the search fails.)
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.