style: removing class for test suite

curvefi · Apr 16, 2024 · df64fb1 · df64fb1
1 parent 1e3619e
commit df64fb1
Showing 1 changed file with 120 additions and 121 deletions.
diff --git a/tests/unitary/math/test_multicoin_curve.py b/tests/unitary/math/test_multicoin_curve.py
@@ -1,5 +1,4 @@
 # flake8: noqa
-import unittest
 from itertools import permutations
 
 import hypothesis.strategies as st
@@ -34,130 +33,130 @@
 
 
 # Test with 2 coins
-class TestCurve(unittest.TestCase):
-    @given(
-        x=st.integers(10**9, 10**15 * 10**18),
-        y=st.integers(10**9, 10**15 * 10**18),
-    )
-    @settings(max_examples=MAX_EXAMPLES_MEAN)
-    def test_geometric_mean(self, x, y):
-        val = geometric_mean([x, y])
-        assert val > 0
-        diff = abs((x * y) ** (1 / 2) - val)
-        assert diff / val <= max(1e-10, 1 / min([x, y]))
-
-    @given(
-        x=st.integers(10**9, 10**15 * 10**18),
-        y=st.integers(10**9, 10**15 * 10**18),
-        gamma=st.integers(10**10, 10**18),
-    )
-    @settings(max_examples=MAX_EXAMPLES_RED)
-    def test_reduction_coefficient(self, x, y, gamma):
-        coeff = reduction_coefficient([x, y], gamma)
-        assert coeff <= 10**18
-
-        K = 2**2 * x * y / (x + y) ** 2
-        if gamma > 0:
-            K = (gamma / 1e18) / ((gamma / 1e18) + 1 - K)
-        assert abs(coeff / 1e18 - K) <= 1e-7
-
-    @given(
-        A=st.integers(MIN_A, MAX_A),
-        x=st.integers(10**18, 10**15 * 10**18),  # 1 USD to 1e15 USD
-        yx=st.integers(
-            10**14, 10**18
-        ),  # <- ratio 1e18 * y/x, typically 1e18 * 1
-        perm=st.integers(0, 1),  # <- permutation mapping to values
-        gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
-    )
-    @settings(max_examples=MAX_EXAMPLES_D)
-    def test_D_convergence(self, A, x, yx, perm, gamma):
-        # Price not needed for convergence testing
-        pmap = list(permutations(range(2)))
-
-        y = x * yx // 10**18
-        curve = Curve(A, gamma, 10**18, 2)
-        curve.x = [0] * 2
-        i, j = pmap[perm]
-        curve.x[i] = x
-        curve.x[j] = y
-        assert curve.D() > 0
-
-    @given(
-        A=st.integers(MIN_A, MAX_A),
-        x=st.integers(10**17, 10**15 * 10**18),  # $0.1 .. $1e15
-        yx=st.integers(10**15, 10**21),
-        gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
-        i=st.integers(0, 1),
-        inx=st.integers(10**15, 10**21),
-    )
-    @settings(max_examples=MAX_EXAMPLES_Y)
-    def test_y_convergence(self, A, x, yx, gamma, i, inx):
-        j = 1 - i
-        in_amount = x * inx // 10**18
-        y = x * yx // 10**18
-        curve = Curve(A, gamma, 10**18, 2)
-        curve.x = [x, y]
+@given(
+    x=st.integers(10**9, 10**15 * 10**18),
+    y=st.integers(10**9, 10**15 * 10**18),
+)
+@settings(max_examples=MAX_EXAMPLES_MEAN)
+def test_geometric_mean(x, y):
+    val = geometric_mean([x, y])
+    assert val > 0
+    diff = abs((x * y) ** (1 / 2) - val)
+    assert diff / val <= max(1e-10, 1 / min([x, y]))
+
+
+@given(
+    x=st.integers(10**9, 10**15 * 10**18),
+    y=st.integers(10**9, 10**15 * 10**18),
+    gamma=st.integers(10**10, 10**18),
+)
+@settings(max_examples=MAX_EXAMPLES_RED)
+def test_reduction_coefficient(x, y, gamma):
+    coeff = reduction_coefficient([x, y], gamma)
+    assert coeff <= 10**18
+
+    K = 2**2 * x * y / (x + y) ** 2
+    if gamma > 0:
+        K = (gamma / 1e18) / ((gamma / 1e18) + 1 - K)
+    assert abs(coeff / 1e18 - K) <= 1e-7
+
+
+@given(
+    A=st.integers(MIN_A, MAX_A),
+    x=st.integers(10**18, 10**15 * 10**18),  # 1 USD to 1e15 USD
+    yx=st.integers(
+        10**14, 10**18
+    ),  # <- ratio 1e18 * y/x, typically 1e18 * 1
+    perm=st.integers(0, 1),  # <- permutation mapping to values
+    gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
+)
+@settings(max_examples=MAX_EXAMPLES_D)
+def test_D_convergence(A, x, yx, perm, gamma):
+    # Price not needed for convergence testing
+    pmap = list(permutations(range(2)))
+
+    y = x * yx // 10**18
+    curve = Curve(A, gamma, 10**18, 2)
+    curve.x = [0] * 2
+    i, j = pmap[perm]
+    curve.x[i] = x
+    curve.x[j] = y
+    assert curve.D() > 0
+
+
+@given(
+    A=st.integers(MIN_A, MAX_A),
+    x=st.integers(10**17, 10**15 * 10**18),  # $0.1 .. $1e15
+    yx=st.integers(10**15, 10**21),
+    gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
+    i=st.integers(0, 1),
+    inx=st.integers(10**15, 10**21),
+)
+@settings(max_examples=MAX_EXAMPLES_Y)
+def test_y_convergence(A, x, yx, gamma, i, inx):
+    j = 1 - i
+    in_amount = x * inx // 10**18
+    y = x * yx // 10**18
+    curve = Curve(A, gamma, 10**18, 2)
+    curve.x = [x, y]
+    out_amount = curve.y(in_amount, i, j)
+    assert out_amount > 0
+
+
+@given(
+    A=st.integers(MIN_A, MAX_A),
+    x=st.integers(10**17, 10**15 * 10**18),  # 0.1 USD to 1e15 USD
+    yx=st.integers(5 * 10**14, 20 * 10**20),
+    gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
+    i=st.integers(0, 1),
+    inx=st.integers(3 * 10**15, 3 * 10**20),
+)
+@settings(max_examples=MAX_EXAMPLES_NOLOSS)
+def test_y_noloss(A, x, yx, gamma, i, inx):
+    j = 1 - i
+    y = x * yx // 10**18
+    curve = Curve(A, gamma, 10**18, 2)
+    curve.x = [x, y]
+    in_amount = x * inx // 10**18
+    try:
         out_amount = curve.y(in_amount, i, j)
-        assert out_amount > 0
-
-    @given(
-        A=st.integers(MIN_A, MAX_A),
-        x=st.integers(10**17, 10**15 * 10**18),  # 0.1 USD to 1e15 USD
-        yx=st.integers(5 * 10**14, 20 * 10**20),
-        gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
-        i=st.integers(0, 1),
-        inx=st.integers(3 * 10**15, 3 * 10**20),
+        D1 = curve.D()
+    except ValueError:
+        return  # Convergence checked separately - we deliberately try unsafe numbers
+    is_safe = all(
+        f >= MIN_XD and f <= MAX_XD
+        for f in [xx * 10**18 // D1 for xx in curve.x]
     )
-    @settings(max_examples=MAX_EXAMPLES_NOLOSS)
-    def test_y_noloss(self, A, x, yx, gamma, i, inx):
-        j = 1 - i
-        y = x * yx // 10**18
-        curve = Curve(A, gamma, 10**18, 2)
-        curve.x = [x, y]
-        in_amount = x * inx // 10**18
-        try:
-            out_amount = curve.y(in_amount, i, j)
-            D1 = curve.D()
-        except ValueError:
-            return  # Convergence checked separately - we deliberately try unsafe numbers
-        is_safe = all(
-            f >= MIN_XD and f <= MAX_XD
-            for f in [xx * 10**18 // D1 for xx in curve.x]
-        )
-        curve.x[i] = in_amount
-        curve.x[j] = out_amount
-        try:
-            D2 = curve.D()
-        except ValueError:
-            return  # Convergence checked separately - we deliberately try unsafe numbers
-        is_safe &= all(
-            f >= MIN_XD and f <= MAX_XD
-            for f in [xx * 10**18 // D2 for xx in curve.x]
-        )
-        if is_safe:
-            assert (
-                2 * (D1 - D2) / (D1 + D2) < MIN_FEE
-            )  # Only loss is prevented - gain is ok
-
-    @given(
-        A=st.integers(MIN_A, MAX_A),
-        D=st.integers(10**18, 10**15 * 10**18),  # 1 USD to 1e15 USD
-        xD=st.integers(MIN_XD, MAX_XD),
-        yD=st.integers(MIN_XD, MAX_XD),
-        gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
-        j=st.integers(0, 1),
+    curve.x[i] = in_amount
+    curve.x[j] = out_amount
+    try:
+        D2 = curve.D()
+    except ValueError:
+        return  # Convergence checked separately - we deliberately try unsafe numbers
+    is_safe &= all(
+        f >= MIN_XD and f <= MAX_XD
+        for f in [xx * 10**18 // D2 for xx in curve.x]
     )
-    @settings(max_examples=MAX_EXAMPLES_YD)
-    def test_y_from_D(self, A, D, xD, yD, gamma, j):
-        xp = [D * xD // 10**18, D * yD // 10**18]
-        y = solve_x(A, gamma, xp, D, j)
-        xp[j] = y
-        D2 = solve_D(A, gamma, xp)
+    if is_safe:
         assert (
-            2 * (D - D2) / (D2 + D) < MIN_FEE
+            2 * (D1 - D2) / (D1 + D2) < MIN_FEE
         )  # Only loss is prevented - gain is ok
 
 
-if __name__ == "__main__":
-    unittest.main()
+@given(
+    A=st.integers(MIN_A, MAX_A),
+    D=st.integers(10**18, 10**15 * 10**18),  # 1 USD to 1e15 USD
+    xD=st.integers(MIN_XD, MAX_XD),
+    yD=st.integers(MIN_XD, MAX_XD),
+    gamma=st.integers(MIN_GAMMA, MAX_GAMMA),
+    j=st.integers(0, 1),
+)
+@settings(max_examples=MAX_EXAMPLES_YD)
+def test_y_from_D(A, D, xD, yD, gamma, j):
+    xp = [D * xD // 10**18, D * yD // 10**18]
+    y = solve_x(A, gamma, xp, D, j)
+    xp[j] = y
+    D2 = solve_D(A, gamma, xp)
+    assert (
+        2 * (D - D2) / (D2 + D) < MIN_FEE
+    )  # Only loss is prevented - gain is ok