def _closest_divisor()

in openai_gemm.py [0:0]

• 6 lines of code
• 4 McCabe index (conditional complexity)

def _closest_divisor(val, div):
    divisors = sorted([(abs(i - div), i) for i in range(2, 8) if val % i == 0])
    if len(divisors):
        return (divisors[0][1], val // divisors[0][1])
    else:
        return (1, val)