(xmin, xmax, ymin, ymax, xn, yn, maxiter, horizon=2.0)
| 14 | |
| 15 | |
| 16 | def mandelbrot_set(xmin, xmax, ymin, ymax, xn, yn, maxiter, horizon=2.0): |
| 17 | X = np.linspace(xmin, xmax, xn).astype(np.float32) |
| 18 | Y = np.linspace(ymin, ymax, yn).astype(np.float32) |
| 19 | C = X + Y[:, None] * 1j |
| 20 | N = np.zeros_like(C, dtype=int) |
| 21 | Z = np.zeros_like(C) |
| 22 | for n in range(maxiter): |
| 23 | I = abs(Z) < horizon |
| 24 | N[I] = n |
| 25 | Z[I] = Z[I]**2 + C[I] |
| 26 | N[N == maxiter-1] = 0 |
| 27 | return Z, N |
| 28 | |
| 29 | |
| 30 | if __name__ == '__main__': |
no outgoing calls
no test coverage detected
searching dependent graphs…