def _uncached_match(self, text, pos, cache, error):
        new_pos = pos
        children = []
        while True:
            node = self.members[0].match_core(text, new_pos, cache, error)
            if node is None:
                break
            children.append(node)
            length = node.end - node.start
            if length == 0:  # Don't loop infinitely.
                break
            new_pos += length
        if self.min >= len(children):
            return Node(self.name, text, pos, new_pos, children)
dataset/ETHPy150Open erikrose/parsimonious/parsimonious/expressions.py/OneOrMore._uncached_match/swapped operands of `>=`