@@ -4123,7 +4123,7 @@ def insert(self, loc: int, item) -> MultiIndex:
41234123
41244124 new_levels = []
41254125 new_codes = []
4126- for k , level , level_codes in zip (item , self .levels , self .codes ):
4126+ for k , level , level_codes in zip (item , self .levels , self .codes , strict = True ):
41274127 if k not in level :
41284128 # have to insert into level
41294129 # must insert at end otherwise you have to recompute all the
@@ -4219,7 +4219,7 @@ def _lexsort_depth(codes: list[np.ndarray], nlevels: int) -> int:
42194219
42204220
42214221def sparsify_labels (label_list , start : int = 0 , sentinel : object = "" ):
4222- pivoted = list (zip (* label_list ))
4222+ pivoted = list (zip (* label_list , strict = True ))
42234223 k = len (label_list )
42244224
42254225 result = pivoted [: start + 1 ]
@@ -4228,7 +4228,7 @@ def sparsify_labels(label_list, start: int = 0, sentinel: object = ""):
42284228 for cur in pivoted [start + 1 :]:
42294229 sparse_cur = []
42304230
4231- for i , (p , t ) in enumerate (zip (prev , cur )):
4231+ for i , (p , t ) in enumerate (zip (prev , cur , strict = True )):
42324232 if i == k - 1 :
42334233 sparse_cur .append (t )
42344234 result .append (sparse_cur ) # type: ignore[arg-type]
@@ -4243,7 +4243,7 @@ def sparsify_labels(label_list, start: int = 0, sentinel: object = ""):
42434243
42444244 prev = cur
42454245
4246- return list (zip (* result ))
4246+ return list (zip (* result , strict = True ))
42474247
42484248
42494249def _get_na_rep (dtype : DtypeObj ) -> str :
0 commit comments