(self, other)
return set(self.generators) == set(other.generators)
Return True if self and other have the same generators.

        Examples
        ========

        >>> from sympy.combinatorics import Permutation
        >>> from sympy.combinatorics.perm_groups import PermutationGroup
        >>> p = Permutation(0, 1, 2, 3, 4, 5)
        >>> G = PermutationGroup([p, p**2])
        >>> H = PermutationGroup([p**2, p])
        >>> G.generators == H.generators
        False
        >>> G == H
        True
Return True if self and other have the same generators.
Return True if self and other have the same generators .
def __eq__(self, other):
        """Return True if self and other have the same generators.

        Examples
        ========

        >>> from sympy.combinatorics import Permutation
        >>> from sympy.combinatorics.perm_groups import PermutationGroup
        >>> p = Permutation(0, 1, 2, 3, 4, 5)
        >>> G = PermutationGroup([p, p**2])
        >>> H = PermutationGroup([p**2, p])
        >>> G.generators == H.generators
        False
        >>> G == H
        True

        """
        if not isinstance(other, PermutationGroup):
            return False
        return set(self.generators) == set(other.generators)
def __eq__ ( self , other ) : if not isinstance ( other , PermutationGroup ) : return False return set ( self . generators ) == set ( other . generators )