projects
/
python_utils.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Change locking boundaries for shared dict. Add a unit test.
[python_utils.git]
/
math_utils.py
diff --git
a/math_utils.py
b/math_utils.py
index e0e3f6c10732b9a3ab20a251a225a0e963c362e9..3216d4a9222f3e9760d2f5276b40503e08cfee8f 100644
(file)
--- a/
math_utils.py
+++ b/
math_utils.py
@@
-39,7
+39,7
@@
class RunningMedian(object):
def get_median(self):
if len(self.lowers) == len(self.highers):
def get_median(self):
if len(self.lowers) == len(self.highers):
- return (-self.lowers[0] + self.highers[0])
/
2
+ return (-self.lowers[0] + self.highers[0])
/
2
elif len(self.lowers) > len(self.highers):
return -self.lowers[0]
else:
elif len(self.lowers) > len(self.highers):
return -self.lowers[0]
else:
@@
-143,12
+143,12
@@
def is_prime(n: int) -> bool:
# This is checked so that we can skip middle five numbers in below
# loop
# This is checked so that we can skip middle five numbers in below
# loop
- if
(n % 2 == 0 or n % 3 == 0)
:
+ if
n % 2 == 0 or n % 3 == 0
:
return False
i = 5
while i * i <= n:
return False
i = 5
while i * i <= n:
- if
(n % i == 0 or n % (i + 2) == 0)
:
+ if
n % i == 0 or n % (i + 2) == 0
:
return False
i = i + 6
return True
return False
i = i + 6
return True
@@
-156,4
+156,5
@@
def is_prime(n: int) -> bool:
if __name__ == '__main__':
import doctest
if __name__ == '__main__':
import doctest
+
doctest.testmod()
doctest.testmod()