Yes, that's cool! First slurp, then split on paragraph chunks, and finally simply match against keywords in the block. That's nice. Could you have not done that without the zero-width positive look-behind? Seems like that would be the best way, but I still wonder...
In reply to Re^2: grabbing dmidecode memory data - there's got to be a better way
by Tommy
in thread grabbing dmidecode memory data - there's got to be a better way
by Tommy
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |