deadvey/mathgenerator
1
0
Fork 0
mirror of https://github.com/DeaDvey/mathgenerator.git synced 2025-11-28 06:25:23 +01:00
Code Issues Packages Projects Releases Wiki Activity

added 4 test and an "=" in binaryComplement1sFunc

Browse Source
This commit is contained in:
D-T-666
2020-10-17 22:53:55 +04:00
parent f323be51ae
commit 954b47fecd
2 changed files with 35 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
tests/test_mathgen.py
View File

@@ -39,8 +39,42 @@ def test_moduloFunc(maxRes, maxModulo):
assert eval(problem[:-1]) == int(solution)
@given(maxDigits=st.integers(min_value=1, max_value=16))
def test_binaryComplement1sFunc(maxDigits):
assume(maxDigits > 1)
problem, solution = binaryComplement1sFunc(maxDigits)
assert "".join('1' if i == '0' else '0' for i in problem[:-1]) == solution
@given(minNo=st.integers(min_value=1), maxNo=st.integers(min_value=1, max_value=2 ** 50))
def test_squareRootFunc(minNo, maxNo):
assume(maxNo > minNo)
problem, solution = squareRootFunc(minNo, maxNo)
assert eval(problem[:-1]) == float(solution)
@given(maxSquareNum=st.integers(min_value=1))
def test_squareFunc(maxSquareNum):
assume(maxSquareNum > 1)
problem, solution = squareFunc(maxSquareNum)
assert pow(int(problem[:-3]), 2) == int(solution)
@given(maxVal=st.integers(min_value=1))
def test_lcmFunc(maxVal):
assume(maxVal > 1)
problem, solution = lcmFunc(maxVal)
split_arr = problem.split(' ')
mult = int(split_arr[2])*int(split_arr[4])
assert mult if mult != pow(int(split_arr[2]), 2) else int(
split_arr[2]) == int(solution)
@given(maxVal=st.integers(min_value=1))
def test_gcdFunc(maxVal):
assume(maxVal > 1)
problem, solution = gcdFunc(maxVal)
split_arr = problem.split(' ')
mult = int(split_arr[2])*int(split_arr[4])
assert mult if mult != pow(int(split_arr[2]), 2) else int(
split_arr[2]) == int(solution)