@@ -2097,7 +2097,7 @@ def _sort_levels_monotonic(self, raise_if_incomparable: bool = False) -> MultiIn
20972097 new_levels = []
20982098 new_codes = []
20992099
2100- for lev , level_codes in zip (self .levels , self .codes , strict = False ):
2100+ for lev , level_codes in zip (self .levels , self .codes , strict = True ):
21012101 if not lev .is_monotonic_increasing :
21022102 try :
21032103 # indexer to reorder the levels
@@ -2176,7 +2176,7 @@ def remove_unused_levels(self) -> MultiIndex:
21762176 new_codes = []
21772177
21782178 changed = False
2179- for lev , level_codes in zip (self .levels , self .codes , strict = False ):
2179+ for lev , level_codes in zip (self .levels , self .codes , strict = True ):
21802180 # Since few levels are typically unused, bincount() is more
21812181 # efficient than unique() - however it only accepts positive values
21822182 # (and drops order):
@@ -2243,7 +2243,7 @@ def __getitem__(self, key):
22432243 key = com .cast_scalar_indexer (key )
22442244
22452245 retval = []
2246- for lev , level_codes in zip (self .levels , self .codes , strict = False ):
2246+ for lev , level_codes in zip (self .levels , self .codes , strict = True ):
22472247 if level_codes [key ] == - 1 :
22482248 retval .append (np .nan )
22492249 else :
0 commit comments