class_docstr: Python class for ordered set.
  Code taken from https://github.com/buyalsky/ordered-hash-set/tree/5198b23e01faeac3f5398ab2c08cb013d14b3702.
docstr: Function to remove elements in self._set which are also present in other_set.
  
  :param other_set: The set to obtain difference with. Can be a list, set or OrderedSet.
  :returns: New OrderedSet representing the difference of elements in the self._set and other_set.
docstr_tok: ["Function","to","remove","elements","in","self._set","which","are","also","present","in","other_set",".",":","param","other_set",":","The","set","to","obtain","difference","with",".","Can","be","a","list",",","set","or","OrderedSet",".",":","returns",":","New","OrderedSet","representing","the","difference","of","elements","in","the","self._set","and","other_set","."]
code: def difference(self, other_set):
      """
      Function to remove elements in self._set which are also present in other_set.
  
      :param other_set: The set to obtain difference with. Can be a list, set or OrderedSet.
      :returns: New OrderedSet representing the difference of elements in the self._set and other_set.
      """
      new_set = OrderedSet()
      for element in self._set:
          if element not in other_set:
              new_set.add(element)
      return new_set
  
file_path: dowhy/dowhy/utils/ordered_set.py
label_desc: Use image node_id 7 for calling the OrderedSet obj's underlying member method code with example usage: obj.difference(other_set) and returns: new_set