187
187
'SymmetricalLogLocator' , 'LogitLocator' )
188
188
189
189
190
- # Work around numpy/numpy#6127.
191
- def _divmod (x , y ):
192
- if isinstance (x , np .generic ):
193
- x = x .item ()
194
- if isinstance (y , np .generic ):
195
- y = y .item ()
196
- return divmod (x , y )
197
-
198
-
199
190
def _mathdefault (s ):
200
191
return '\\ mathdefault{%s}' % s
201
192
@@ -1665,7 +1656,7 @@ def view_limits(self, vmin, vmax):
1665
1656
vmax += 1
1666
1657
1667
1658
if rcParams ['axes.autolimit_mode' ] == 'round_numbers' :
1668
- exponent , remainder = _divmod (
1659
+ exponent , remainder = divmod (
1669
1660
math .log10 (vmax - vmin ), math .log10 (max (self .numticks - 1 , 1 )))
1670
1661
exponent -= (remainder < .5 )
1671
1662
scale = max (self .numticks - 1 , 1 ) ** (- exponent )
@@ -1690,30 +1681,30 @@ def __init__(self, base):
1690
1681
1691
1682
def lt (self , x ):
1692
1683
'return the largest multiple of base < x'
1693
- d , m = _divmod (x , self ._base )
1684
+ d , m = divmod (x , self ._base )
1694
1685
if closeto (m , 0 ) and not closeto (m / self ._base , 1 ):
1695
1686
return (d - 1 ) * self ._base
1696
1687
return d * self ._base
1697
1688
1698
1689
def le (self , x ):
1699
1690
'return the largest multiple of base <= x'
1700
- d , m = _divmod (x , self ._base )
1691
+ d , m = divmod (x , self ._base )
1701
1692
if closeto (m / self ._base , 1 ): # was closeto(m, self._base)
1702
1693
#looks like floating point error
1703
1694
return (d + 1 ) * self ._base
1704
1695
return d * self ._base
1705
1696
1706
1697
def gt (self , x ):
1707
1698
'return the smallest multiple of base > x'
1708
- d , m = _divmod (x , self ._base )
1699
+ d , m = divmod (x , self ._base )
1709
1700
if closeto (m / self ._base , 1 ):
1710
1701
#looks like floating point error
1711
1702
return (d + 2 ) * self ._base
1712
1703
return (d + 1 ) * self ._base
1713
1704
1714
1705
def ge (self , x ):
1715
1706
'return the smallest multiple of base >= x'
1716
- d , m = _divmod (x , self ._base )
1707
+ d , m = divmod (x , self ._base )
1717
1708
if closeto (m , 0 ) and not closeto (m / self ._base , 1 ):
1718
1709
return d * self ._base
1719
1710
return (d + 1 ) * self ._base
@@ -1808,14 +1799,14 @@ def closeto(self, ms, edge):
1808
1799
1809
1800
def le (self , x ):
1810
1801
'Return the largest n: n*step <= x.'
1811
- d , m = _divmod (x , self .step )
1802
+ d , m = divmod (x , self .step )
1812
1803
if self .closeto (m / self .step , 1 ):
1813
1804
return (d + 1 )
1814
1805
return d
1815
1806
1816
1807
def ge (self , x ):
1817
1808
'Return the smallest n: n*step >= x.'
1818
- d , m = _divmod (x , self .step )
1809
+ d , m = divmod (x , self .step )
1819
1810
if self .closeto (m / self .step , 0 ):
1820
1811
return d
1821
1812
return (d + 1 )
0 commit comments