passagemath-repl 10.5.27__py3-none-any.whl → 10.5.29__py3-none-any.whl

sage/tests/books/judson-abstract-algebra/sylow-sage.py

@@ -0,0 +1,250 @@
+# sage_setup: distribution = sagemath-repl
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-26T21:16:30-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-26T21:16:30-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 15.6 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: def all_sylow(G, p):
+    ....:     '''Form the set of all distinct Sylow p-subgroups of G'''
+    ....:     scriptP = []
+    ....:     P = G.sylow_subgroup(p)
+    ....:     for x in G:
+    ....:         H = P.conjugate(x)
+    ....:         if not(H in scriptP):
+    ....:             scriptP.append(H)
+    ....:     return scriptP
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(18)
+    sage: S2 = G.sylow_subgroup(2); S2
+    Subgroup generated by
+    [(2,18)(3,17)(4,16)(5,15)(6,14)(7,13)(8,12)(9,11),
+     (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)]
+    of (Dihedral group of order 36 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: uniqS2 = all_sylow(G, 2)
+    sage: uniqS2
+    [Permutation Group with generators [(2,18)(3,17)(4,16)(5,15)(6,14)(7,13)(8,12)(9,11), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,7)(2,6)(3,5)(8,18)(9,17)(10,16)(11,15)(12,14), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,13)(2,12)(3,11)(4,10)(5,9)(6,8)(14,18)(15,17), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)(16,18), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,3)(4,18)(5,17)(6,16)(7,15)(8,14)(9,13)(10,12), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,9)(2,8)(3,7)(4,6)(10,18)(11,17)(12,16)(13,15), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,11)(2,10)(3,9)(4,8)(5,7)(12,18)(13,17)(14,16), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,17)(2,16)(3,15)(4,14)(5,13)(6,12)(7,11)(8,10), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)],
+     Permutation Group with generators [(1,5)(2,4)(6,18)(7,17)(8,16)(9,15)(10,14)(11,13), (1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: len(uniqS2)
+    9
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(18)
+    sage: S3 = G.sylow_subgroup(3); S3
+    Subgroup generated by
+    [(1,15,11,7,3,17,13,9,5)(2,16,12,8,4,18,14,10,6),
+     (1,7,13)(2,8,14)(3,9,15)(4,10,16)(5,11,17)(6,12,18)]
+    of (Dihedral group of order 36 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: uniqS3 = all_sylow(G, 3)
+    sage: uniqS3
+    [Permutation Group with generators
+     [(1,15,11,7,3,17,13,9,5)(2,16,12,8,4,18,14,10,6),
+      (1,7,13)(2,8,14)(3,9,15)(4,10,16)(5,11,17)(6,12,18)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: len(uniqS3)
+    1
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S3.is_normal(G)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S3.is_cyclic()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(18)
+    sage: S2 = G.sylow_subgroup(2)
+    sage: S3 = G.sylow_subgroup(3)
+    sage: N2 = G.normalizer(S2); N2
+    Subgroup generated by
+    [(1,10)(2,11)(3,12)(4,13)(5,14)(6,15)(7,16)(8,17)(9,18),
+     (2,18)(3,17)(4,16)(5,15)(6,14)(7,13)(8,12)(9,11)]
+    of (Dihedral group of order 36 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: N2 == S2
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: N3 = G.normalizer(S3); N3
+    Subgroup generated by
+    [(1,15,11,7,3,17,13,9,5)(2,16,12,8,4,18,14,10,6),
+     (1,7,13)(2,8,14)(3,9,15)(4,10,16)(5,11,17)(6,12,18),
+     (2,18)(3,17)(4,16)(5,15)(6,14)(7,13)(8,12)(9,11),
+     (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18)]
+    of (Dihedral group of order 36 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: N3 == G
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(18)
+    sage: a = G("(1,7,13)(2,8,14)(3,9,15)(4,10,16)(5,11,17)(6,12,18)")
+    sage: b = G("(1,5)(2,4)(6,18)(7,17)(8,16)(9,15)(10,14)(11,13)")
+    sage: H = G.subgroup([a, b])
+    sage: H.order()
+    6
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: N = G.normalizer(H)
+    sage: N
+    Subgroup generated by
+    [(1,5)(2,4)(6,18)(7,17)(8,16)(9,15)(10,14)(11,13),
+     (1,7,13)(2,8,14)(3,9,15)(4,10,16)(5,11,17)(6,12,18),
+     (1,2)(3,18)(4,17)(5,16)(6,15)(7,14)(8,13)(9,12)(10,11)]
+    of (Dihedral group of order 36 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: N.order()
+    12
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.is_normal(G)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.is_normal(N)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: DC=DiCyclicGroup(16)
+    sage: DC.order()
+    64
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: DC.is_simple()
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: ns = DC.normal_subgroups()
+    sage: len(ns)
+    9
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(100)
+    sage: a = G([(1,60),  (2,72),  (3,81),  (4,43),  (5,11),  (6,87),
+    ....:         (7,34),  (9,63),  (12,46), (13,28), (14,71), (15,42),
+    ....:         (16,97), (18,57), (19,52), (21,32), (23,47), (24,54),
+    ....:         (25,83), (26,78), (29,89), (30,39), (33,61), (35,56),
+    ....:         (37,67), (44,76), (45,88), (48,59), (49,86), (50,74),
+    ....:         (51,66), (53,99), (55,75), (62,73), (65,79), (68,82),
+    ....:         (77,92), (84,90), (85,98), (94,100)])
+    sage: b = G([(1,86,13,10,47),  (2,53,30,8,38),
+    ....:         (3,40,48,25,17),  (4,29,92,88,43),   (5,98,66,54, 65),
+    ....:         (6,27,51,73,24),  (7,83,16,20,28),   (9,23,89,95,61),
+    ....:         (11,42,46,91,32), (12,14, 81,55,68), (15,90,31,56,37),
+    ....:         (18,69,45,84,76), (19,59,79,35,93),  (21,22,64,39,100),
+    ....:         (26,58,96,85,77), (33,52,94,75,44),  (34,62,87,78,50),
+    ....:         (36,82,60,74,72), (41,80,70,49,67),  (57,63,71,99,97)])
+    sage: a.order(), b.order()
+    (2, 5)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: HS = G.subgroup([a, b])
+    sage: HS.order()
+    44352000
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: HS.is_simple()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: gap.version()  # random
+    '4.10.0'
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = gap('Group( (1,2,3,4,5,6), (1,3,5) )')
+    sage: G
+    Group( [ (1,2,3,4,5,6), (1,3,5) ] )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G.Center()
+    Group( [ (1,3,5)(2,4,6) ] )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G.Centralizer('(1, 3, 5)')
+    Group( [ (1,3,5), (2,4,6), (1,3,5)(2,4,6) ] )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: print(gap.help('SymmetricGroup', pager=False))   # not tested
+"""

sage/tests/books/judson-abstract-algebra/vect-sage-exercises.py

@@ -0,0 +1,48 @@
+# sage_setup: distribution = sagemath-repl
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Exercises 20.7 Sage Exercises
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: M = ZZ^3
+    sage: u = M([1, 0, 0])
+    sage: v = M([2, 2, 0])
+    sage: w = M([0, 0, 4])
+    sage: N = M.submodule([u, v, w])
+"""

sage/tests/books/judson-abstract-algebra/vect-sage.py

@@ -0,0 +1,211 @@
+# sage_setup: distribution = sagemath-repl
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 20.6 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: V = QQ^4; V
+    Vector space of dimension 4 over Rational Field
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: F.<a> = FiniteField(3^4)
+    sage: W = F^5; W
+    Vector space of dimension 5 over Finite Field in a of size 3^4
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: v = vector(QQ, [1, 1/2, 1/3, 1/4]); v
+    (1, 1/2, 1/3, 1/4)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: v in V
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: w = vector(F, [1, a^2, a^4, a^6, a^8]); w
+    (1, a^2, a^3 + 1, a^3 + a^2 + a + 1, a^2 + a + 2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: w in W
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: u = vector(QQ, [ 1, 2,  3, 4,   5,  6])
+    sage: v = vector(QQ, [-1, 2, -4, 8, -16, 32])
+    sage: 3*u - 2*v
+    (5, 2, 17, -4, 47, -46)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: w = vector(F, [1, a^2, a^4, a^6,  a^8])
+    sage: x = vector(F, [1,   a, 2*a,   a,    1])
+    sage: y = vector(F, [1, a^3, a^6, a^9, a^12])
+    sage: a^25*w + a^43*x + a^66*y
+    (a^3 + a^2 + a + 2, a^2 + 2*a, 2*a^3 + a^2 + 2, 2*a^3 + a^2 + a,
+     a^3 + 2*a^2 + a + 2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: u = vector(QQ, [1, -1, 3])
+    sage: v = vector(QQ, [2, 1, -1])
+    sage: w = vector(QQ, [3, 0, 2])
+    sage: S = (QQ^3).subspace([u, v, w]); S
+    Vector space of degree 3 and dimension 2 over Rational Field
+    Basis matrix:
+    [   1    0  2/3]
+    [   0    1 -7/3]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: 3*u - 6*v + (1/2)*w in S
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: vector(QQ, [4, -1, -2]) in S
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S.basis()
+    [(1, 0, 2/3), (0, 1, -7/3)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: u = vector(QQ, [1, -1,  3])
+    sage: v = vector(QQ, [2,  1, -1])
+    sage: w = vector(QQ, [3,  0,  2])
+    sage: u + v == w
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S1 = (QQ^3).subspace([u, v, w])
+    sage: S2 = (QQ^3).subspace([u-v, v-w, w-u])
+    sage: S1 == S2
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: u = vector(QQ, [1, -1,  3,  4])
+    sage: v = vector(QQ, [2,  1, -1, -2])
+    sage: S = (QQ^4).subspace([u, v, 2*u + 3*v, -u + 2*v])
+    sage: S.dimension()
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: F.<a> = FiniteField(3^4)
+    sage: u = vector(F, [a^i for i in range(0,  7, 1)])
+    sage: v = vector(F, [a^i for i in range(0, 14, 2)])
+    sage: w = vector(F, [a^i for i in range(0, 21, 3)])
+    sage: S = (F^7).subspace([u, v, w])
+    sage: S.dimension()
+    3
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S = (F^7).subspace([u, v, a^3*u + a^11*v])
+    sage: S.dimension()
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: F.<a> = FiniteField(7^6)
+    sage: u = 2*a^5 + 6*a^4 + 2*a^3 + 3*a^2 + 2*a + 3
+    sage: v = 4*a^5 + 4*a^4 + 4*a^3 + 6*a^2 + 5*a + 6
+    sage: u + v
+    6*a^5 + 3*a^4 + 6*a^3 + 2*a^2 + 2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: 4*u
+    a^5 + 3*a^4 + a^3 + 5*a^2 + a + 5
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: 2*u + 5*v
+    3*a^5 + 4*a^4 + 3*a^3 + a^2 + a + 1
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: V = F.vector_space(map=False); V
+    Vector space of dimension 6 over Finite Field of size 7
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: R = V.base_ring(); R
+    Finite Field of size 7
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: R == FiniteField(7)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: V.dimension()
+    6
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: x = V(u); x
+    (3, 2, 3, 2, 6, 2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: y = V(v); y
+    (6, 5, 6, 4, 4, 4)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: V(u + v) == V(u) + V(v)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: two = R(2)
+    sage: V(two*u) == two*V(u)
+    True
+"""

sage/tests/memcheck/__init__.py

@@ -0,0 +1 @@
+# sage_setup: distribution = sagemath-repl

sage/tests/memcheck/run_tests.py

@@ -0,0 +1,25 @@
+# sage_setup: distribution = sagemath-repl
+import types
+
+
+def run_tests() -> None:
+    """
+    Run all memcheck tests
+    """
+    from sage.tests.memcheck import symbolic_expression
+    run_tests_in_module(symbolic_expression)
+
+
+def run_tests_in_module(mod: types.ModuleType) -> None:
+    """
+    Run all memcheck tests in the given module
+    """
+    for entry in dir(mod):
+        if not entry.startswith('test_'):
+            continue
+        test_func = getattr(mod, entry)
+        test_func()
+
+
+if __name__ == '__main__':
+    run_tests()

sage/tests/memcheck/run_tests_in_valgrind.py

@@ -0,0 +1,36 @@
+# sage_setup: distribution = sagemath-repl
+"""
+Launch valgrind and run the memory leak tests
+
+
+From the commandline, run
+
+    sage -python -m sage.tests.memcheck.run_tests_in_valgrind
+
+to launch valgrind and execute the memory leak tests. Requires valgrind
+to be installed. Alternatively, run as a unit test:
+
+    sage: from sage.tests.memcheck.run_tests_in_valgrind import run_tests_in_valgrind
+    sage: run_tests_in_valgrind()    # optional - valgrind
+"""
+
+import subprocess
+
+
+def run_tests_in_valgrind() -> None:
+    """
+    Run the sage.tests.memcheck.run_tests module inside valgrind
+    """
+    subprocess.check_call([
+        'valgrind',
+        '--suppressions=src/sage/ext_data/valgrind/valgrind-python.supp',
+        '--show-possibly-lost=no',
+        '--show-reachable=no',
+        './venv/bin/python',
+        '-m',
+        'sage.tests.memcheck.run_tests'
+    ])
+
+
+if __name__ == '__main__':
+    run_tests_in_valgrind()

sage/tests/memcheck/symbolic_expression.py

@@ -0,0 +1,12 @@
+# sage_setup: distribution = sagemath-repl
+from sage.tests.memcheck.verify_no_leak import verify_no_leak
+
+
+def test_sqrt_sqrt_2() -> None:
+    from sage.misc.functional import sqrt
+    T2 = sqrt(2)
+
+    def sqrt_T2() -> None:
+        sqrt(T2)
+
+    verify_no_leak(sqrt_T2)

sage/tests/memcheck/verify_no_leak.py

@@ -0,0 +1,28 @@
+# sage_setup: distribution = sagemath-repl
+from typing import Callable, Any
+import valgrind
+
+
+def verify_no_leak(callback: Callable[[], Any],
+                   repeat: int = 10000,
+                   fuzzy: int = 10,
+                   ) -> None:
+    """
+    Verify that the callback does not generate new definitely lost blocks
+
+    Raises an assertion if the callback leaks memory
+    """
+    callback()   # warm_up
+    initial_blocks = (0, 0, 0, 0)
+    valgrind.memcheck_do_leak_check()
+    initial_blocks = valgrind.memcheck_count_leak_blocks()
+    for _ in range(repeat):
+        callback()
+    valgrind.memcheck_do_leak_check()
+    leak_blocks = valgrind.memcheck_count_leak_blocks()
+    leak = leak_blocks[0] - initial_blocks[0]
+    if leak < repeat - fuzzy:
+        return  # callback did not leak at least once per call
+    blocks = round(leak / repeat, 2)
+    message = f'{callback} leaked {blocks} block on average ({repeat} iterations)'
+    raise AssertionError(message)