def iter_entry_points(self, group, name=None):
return (<EOL>entry<EOL>for dist in self<EOL>for entry in dist.get_entry_map(group).values()<EOL>if name is None or name == entry.name<EOL>)<EOL>
Yield entry point objects from `group` matching `name`

        If `name` is None, yields all entry points in `group` from all
        distributions in the working set, otherwise only ones matching
        both `group` and `name` are yielded (in distribution order).