class_docstr: An OrderedSet is a custom MutableSet that remembers its order, so that
  every entry has an index that can be looked up.
  
  Example:
      >>> OrderedSet([1, 1, 2, 3, 2])
      OrderedSet([1, 2, 3])
class_docstr_tok: ["An","OrderedSet","is","a","custom","MutableSet","that","remembers","its","order",",","so","that","every","entry","has","an","index","that","can","be","looked","up",".","Example",":",">",">",">","OrderedSet","(","[","1",",","1",",","2",",","3",",","2","]",")","OrderedSet","(","[","1",",","2",",","3","]",")"]
docstr: 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])
docstr_tok: ["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","]",")"]
code: 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)
  
imports: import itertools
  from collections import deque
label_desc: Use image node_id 24 for calling the OrderedSet obj's underlying member method code with example usage: obj.symmetric_difference(other) and returns: diff1