code: def unorderable_list_difference(expected, actual):
      """Same behavior as sorted_list_difference but
      for lists of unorderable items (like dicts).
  
      As it does a linear search per item (remove) it
      has O(n*n) performance."""
      missing = []
      while expected:
          item = expected.pop()
          try:
              actual.remove(item)
          except ValueError:
              missing.append(item)
  
      # anything left in actual is unexpected
      return missing, actual
  
file_path: catboost/contrib/tools/python3/src/Lib/unittest/util.py
imports: from collections import namedtuple, Counter
  from os.path import commonprefix
label_desc: Use image node_id 6 for calling a global function with example usage: unorderable_list_difference(expected, actual) and returns: missing,  actual