mathtoolspy/solver/minimize_algorithm_1dim_golden.py
Function minimize_algorithm_1dim_golden
has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring. Open
Open
def minimize_algorithm_1dim_golden(function, a, b, c, tolerance=DOUBLE_TOL):
'''
Given a function f, and given a bracketing triplet of abscissas ax, bx, cx
(such that bx is between ax and cx, and f(bx) is less than both f(ax) and f(cx)),
this routine performs a golden section search for the minimum, isolating it to
- Read upRead up
Cognitive Complexity
Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.
A method's cognitive complexity is based on a few simple rules:
- Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
- Code is considered more complex for each "break in the linear flow of the code"
- Code is considered more complex when "flow breaking structures are nested"
Further reading
Function minimize_algorithm_1dim_golden
has 5 arguments (exceeds 4 allowed). Consider refactoring. Open
Open
def minimize_algorithm_1dim_golden(function, a, b, c, tolerance=DOUBLE_TOL):