def intersection(set1, set2, *args):
   """
   Returns intersection of tuples/lists of data, where

   1) the number of sets is greater than 1,
   2) the dimensionality of the sets is not pre-defined,
       s1 = [(1,), 'e', [[1, 7], (4L, 3j, ('', None))], ([2], {'a': 'b'})]
   3) the sets are not required to share common dimensionality,
       s2 = (1, 2, 3, None)
   4) the returned object is a one-dimensional list of objects which are
      neither TupleType nor ListType and has no duplicates.
       intersection(s1, s2) == [1, 2, None]
   """
   result = []
   sets = []
   sets_append = sets.append
   result_append = result.append

   sets_append(union(set1))
   sets_append(union(set2))

   for arg in args:
      sets_append(union(arg))

   for obj in sets[0]:
      for i in range(1, len(sets), 1):
         hit = obj in sets[i]
         if not hit:
            break
      if hit:
         result_append(obj)

   return compact(result)

   Returns intersection of tuples/lists of data, where

   1) the number of sets is greater than 1,
   2) the dimensionality of the sets is not pre-defined,
       s1 = [(1,), 'e', [[1, 7], (4L, 3j, ('', None))], ([2], {'a': 'b'})]
   3) the sets are not required to share common dimensionality,
       s2 = (1, 2, 3, None)
   4) the returned object is a one-dimensional list of objects which are
      neither TupleType nor ListType and has no duplicates.
       intersection(s1, s2) == [1, 2, None]
   
recipes/Python/138982_Intersectiunivaried_form/recipe-138982.py