9
9
10
10
from pandas ._libs import (
11
11
Timestamp , algos as libalgos , index as libindex , lib , tslibs )
12
- from pandas .compat import lzip
13
12
from pandas .compat .numpy import function as nv
14
13
from pandas .errors import PerformanceWarning , UnsortedIndexError
15
14
from pandas .util ._decorators import Appender , cache_readonly , deprecate_kwarg
@@ -402,7 +401,7 @@ def from_tuples(cls, tuples, sortorder=None, names=None):
402
401
elif isinstance (tuples , list ):
403
402
arrays = list (lib .to_object_array_tuples (tuples ).T )
404
403
else :
405
- arrays = lzip (* tuples )
404
+ arrays = zip (* tuples )
406
405
407
406
return MultiIndex .from_arrays (arrays , sortorder = sortorder , names = names )
408
407
@@ -511,7 +510,7 @@ def from_frame(cls, df, sortorder=None, names=None):
511
510
if not isinstance (df , ABCDataFrame ):
512
511
raise TypeError ("Input must be a DataFrame" )
513
512
514
- column_names , columns = lzip (* df .iteritems ())
513
+ column_names , columns = zip (* df .iteritems ())
515
514
names = column_names if names is None else names
516
515
return cls .from_arrays (columns , sortorder = sortorder , names = names )
517
516
@@ -2941,7 +2940,7 @@ def union(self, other, sort=None):
2941
2940
other ._ndarray_values ],
2942
2941
sort = sort )
2943
2942
2944
- return MultiIndex .from_arrays (lzip (* uniq_tuples ), sortorder = 0 ,
2943
+ return MultiIndex .from_arrays (zip (* uniq_tuples ), sortorder = 0 ,
2945
2944
names = result_names )
2946
2945
2947
2946
def intersection (self , other , sort = False ):
@@ -2984,7 +2983,7 @@ def intersection(self, other, sort=False):
2984
2983
codes = [[]] * self .nlevels ,
2985
2984
names = result_names , verify_integrity = False )
2986
2985
else :
2987
- return MultiIndex .from_arrays (lzip (* uniq_tuples ), sortorder = 0 ,
2986
+ return MultiIndex .from_arrays (zip (* uniq_tuples ), sortorder = 0 ,
2988
2987
names = result_names )
2989
2988
2990
2989
def difference (self , other , sort = None ):
@@ -3152,7 +3151,7 @@ def isin(self, values, level=None):
3152
3151
3153
3152
3154
3153
def _sparsify (label_list , start = 0 , sentinel = '' ):
3155
- pivoted = lzip ( * label_list )
3154
+ pivoted = list ( zip ( * label_list ) )
3156
3155
k = len (label_list )
3157
3156
3158
3157
result = pivoted [:start + 1 ]
@@ -3176,7 +3175,7 @@ def _sparsify(label_list, start=0, sentinel=''):
3176
3175
3177
3176
prev = cur
3178
3177
3179
- return lzip ( * result )
3178
+ return list ( zip ( * result ) )
3180
3179
3181
3180
3182
3181
def _get_na_rep (dtype ):
0 commit comments