Improve duplicate routes/roots checks

[jteresco]

DataProcessing/siteupdate/python-teresco/siteupdate.py

Line 1999 in a48aa24

roots = []

A hash table or other better lookup mechanism can significantly improve the efficiency of the checks that begin here. It's up to almost a minute with the growth of our highway data.

[yakra]

How did you do the markdown for the code snippet above?

[jteresco]

Go to the code view of a file, click on the little grey number, and copy that URL and paste it in. GitHub then makes it look pretty here.

[yakra]

Ah! I copied such a URL and pasted into a comment, but I only previewed it rather than post. I guess that's not enough to work its magic.

[yakra]

Strange, this mechanism doesn't seem to work all the time.
#87 (comment) for example.
You may have seen a notification or email about me responding to that thread; I tried copying & pasting your comment and separating out the URL to its own line. No luck. Tried posting only the URL as a comment. No luck. Weird...

Could this feature only work with some types of code (EG Python) and not others (EG CSV, C++)?

[jteresco]

Switched the lists to sets and this part goes from about a minute to about .2 seconds. Yes, should have made that simple switch years ago.