def iter_matches(self, term):

        S = Traverser(term)
        for m, syms in _match(S, self._net):
            for i in m:
                rule = self.rules[i]
                subs = _process_match(rule, syms)
                if subs is not None:
                    yield rule, subs
A generator that lazily finds matchings for term from the RuleSet.
dataset/ETHPy150Open dask/dask/dask/rewrite.py/RuleSet.iter_matches