In python2.7: 2 for loops are always a little inefficient, especially in python. Is there a better way to write the following filter function? It tags a line from a log file, if it is useful. Otherwise the line will be ignored. Because there are different possible interesting lines, it tries different compiled regexes for each line, until it finds one. Note that no more regexes are checked for a line, after the first one successfully matched.

def filter_lines(instream, filters):
    """ignore lines that aren't needed

    :param instream: an input stream like sys.stdin
    :param filters: a list of compiled regexes
    :yield: a tupel (line, regex)
    for line in instream:
        for regex in filters:
            if regex.match(line):
                yield (line,regex)

(The "tagging" is done with the regex object itself, because it can be used later on for retrieving substrings of a line, like filename and row number in an occuring error)


I wouldn’t worry about performance of the loop here. The slow thing isn’t the loop, it’s the matching of the expressions.

That said, I’d express the nested loops via list comprehension instead.

def filter_lines(instream, filters):
    return ((line, regex) for regex in filters for line in instream if regex.match(line))

Or alternatively, using higher-order list functions:

def filter_lines(instream, filters):
    return filter(lambda (line, rx): rx.match(line), itertools.product(instream, filters))
  • \$\begingroup\$ I can't check this right now, but my guess is that your first alternative is way, way faster then my 2 nested for loops. Anyway, it's not perfect, because it still continues to match other regexes if one already successfully matched one line. \$\endgroup\$
    – erikbstack
    Aug 6 '12 at 15:55
  • 1
    \$\begingroup\$ @erikb Ah, I completely missed that aspect, to be honest. And I’m not sure why this code should be faster than yours. Unfortunately, I don’t see a good way of breaking out of the loop early without two explicit nested loops, sorry. \$\endgroup\$ Aug 6 '12 at 16:11

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.