I see how to do it shorter.
The solution of using \h gives me pause because it is obscure.
I wanted to know about this shorter method.
But that doesn't necessarily mean that I will use it in the production code.
Update:
My code snippet is just a very, very minor part of a Web Automation program which visits about 100K+ links. I am working with the webmaster for this site and we are developing new features. With our new features, I will only have to visit a max of 2K max web pages (Not 100k). In general a peep-hole optimization for a few lines doesn't matter much. The huge qains have to do with algorithms adjustments. That stuff can yield 50:1 or even 200:1, a huge performance increase.
In reply to Re^2: (Solved) Extracting sometimes null string from text variable
by Marshall
in thread (Solved) Extracting sometimes null string from text variable
by Marshall
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |