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
@@ -2933,7 +2932,7 @@ def union(self, other, sort=None):
2933
2932
other ._ndarray_values ],
2934
2933
sort = sort )
2935
2934
2936
- return MultiIndex .from_arrays (lzip (* uniq_tuples ), sortorder = 0 ,
2935
+ return MultiIndex .from_arrays (zip (* uniq_tuples ), sortorder = 0 ,
2937
2936
names = result_names )
2938
2937
2939
2938
def intersection (self , other , sort = False ):
@@ -2976,7 +2975,7 @@ def intersection(self, other, sort=False):
2976
2975
codes = [[]] * self .nlevels ,
2977
2976
names = result_names , verify_integrity = False )
2978
2977
else :
2979
- return MultiIndex .from_arrays (lzip (* uniq_tuples ), sortorder = 0 ,
2978
+ return MultiIndex .from_arrays (zip (* uniq_tuples ), sortorder = 0 ,
2980
2979
names = result_names )
2981
2980
2982
2981
def difference (self , other , sort = None ):
@@ -3144,7 +3143,7 @@ def isin(self, values, level=None):
3144
3143
3145
3144
3146
3145
def _sparsify (label_list , start = 0 , sentinel = '' ):
3147
- pivoted = lzip ( * label_list )
3146
+ pivoted = list ( zip ( * label_list ) )
3148
3147
k = len (label_list )
3149
3148
3150
3149
result = pivoted [:start + 1 ]
@@ -3168,7 +3167,7 @@ def _sparsify(label_list, start=0, sentinel=''):
3168
3167
3169
3168
prev = cur
3170
3169
3171
- return lzip ( * result )
3170
+ return list ( zip ( * result ) )
3172
3171
3173
3172
3174
3173
def _get_na_rep (dtype ):
0 commit comments