You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current link finder parses the html page by looking for links, scanning each of the character and the time complexity of this is about O(MN) where M is the size of the html page and N is the size of the link pattern.
Proposal
It is possible that regexp compilation and usage might be faster since the html files are very large.
Notes
There is a need to benchmark the solution and compare with the current implementation
The text was updated successfully, but these errors were encountered:
Current Implementation
The current link finder parses the html page by looking for links, scanning each of the character and the time complexity of this is about O(MN) where M is the size of the html page and N is the size of the link pattern.
Proposal
It is possible that regexp compilation and usage might be faster since the html files are very large.
Notes
The text was updated successfully, but these errors were encountered: