parameters: (self, other)
return_statement: return diff1.union(diff2)
docstring: Return the symmetric difference of two OrderedSets as a new set.
          That is, the new set will contain all elements that are in exactly
          one of the sets.
  
          Their order will be preserved, with elements from `self` preceding
          elements from `other`.
  
          Example:
              >>> this = OrderedSet([1, 4, 3, 5, 7])
              >>> other = OrderedSet([9, 7, 1, 3, 2])
              >>> this.symmetric_difference(other)
              OrderedSet([4, 5, 9, 2])
docstring_summary: Return the symmetric difference of two OrderedSets as a new set.
          That is, the new set will contain all elements that are in exactly
          one of the sets.
docstring_tokens: Return the symmetric difference of two OrderedSets as a new set . That is the new set will contain all elements that are in exactly one of the sets .
function: def symmetric_difference(self, other):
          """
          Return the symmetric difference of two OrderedSets as a new set.
          That is, the new set will contain all elements that are in exactly
          one of the sets.
  
          Their order will be preserved, with elements from `self` preceding
          elements from `other`.
  
          Example:
              >>> this = OrderedSet([1, 4, 3, 5, 7])
              >>> other = OrderedSet([9, 7, 1, 3, 2])
              >>> this.symmetric_difference(other)
              OrderedSet([4, 5, 9, 2])
          """
          cls = self.__class__ if isinstance(self, OrderedSet) else OrderedSet
          diff1 = cls(self).difference(other)
          diff2 = cls(other).difference(self)
          return diff1.union(diff2)
function_tokens: def symmetric_difference ( self , other ) : cls = self . __class__ if isinstance ( self , OrderedSet ) else OrderedSet diff1 = cls ( self ) . difference ( other ) diff2 = cls ( other ) . difference ( self ) return diff1 . union ( diff2 )