def _uncached_match(self, text, pos, cache, error):
        """Return length of match, ``None`` if no match."""
        m = self.re.match(text, pos)
        if m is not None:
            span = m.span()
            node = RegexNode(self, text, pos, pos + span[1] - span[0])
            node.match = m  # TODO: A terrible idea for cache size?
            return node
def _uncached_match ( self , text , pos , cache , error ) : m = self . re . match ( text , pos ) if m is not None : span = m . span ( ) node = RegexNode ( self , text , pos , pos + span [ 1 ] - span [ 0 ] ) node . match = m return node
Return length of match, ``None`` if no match.