marauders 0.0.13

A tool for hand-crafted mutation analysis and management
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

# Insert
def insert(k: int, v: int, t: BST) -> BST:
    match t:
        case E():
            return _node(E(), k, v, E())
        case T(k2, v2, l, r):
            """! insert """
            if k < k2:
                return _node(insert(k, v, l), k2, v2, r)
            elif k2 < k:
                return _node(l, k2, v2, insert(k, v, r))
            else:
                return _node(l, k2, v, r)
            """!! insert_1 """
            """!
            return _node(E(), k, v, E())
            """
            """!! insert_2 """
            """!
            if k < k2:
                return _node(insert(k, v, l), k2, v2, r)
            else:
                return _node(l, k2, v, r)
            """
            """!! insert_3 """
            """!
            if k < k2:
                return _node(insert(k, v, l), k2, v2, r)
            elif k2 < k:
                return _node(l, k2, v2, insert(k, v, r))
            else:
                return _node(l, k2, v2, r)
            """
            """ !"""