From a2a904713cb2216398f4ff322d1294afe07a7502 Mon Sep 17 00:00:00 2001 From: JP Appel Date: Sat, 20 Apr 2024 18:43:10 -0400 Subject: now call refactored complex_to_grid correctly --- src/serial-fractals.c | 17 ----------------- 1 file changed, 17 deletions(-) (limited to 'src/serial-fractals.c') diff --git a/src/serial-fractals.c b/src/serial-fractals.c index 55cd431..a5f9841 100644 --- a/src/serial-fractals.c +++ b/src/serial-fractals.c @@ -1,6 +1,4 @@ #include "fractals.h" -#include "grids.h" -#include "util.h" /* * Computes the number of iterations it takes for a point z0 to diverge * if the return value is equal to max_iterations, the point lies within the mandelbrot set @@ -17,21 +15,6 @@ size_t mandelbrot(const double complex z0, const size_t max_iterations) { return iteration; } -/* - * Fills a grid with the a complex sit - */ -void mandelbrot_grid(grid_t* grid, vec2 resolution, const size_t iterations){ - if(!grid || !grid->data) return; - const size_t size = grid->size; - - set_grid(grid, 0); //unnecessary step - - - size_t* data = grid->data; - for(size_t i = 0; i < size; i++){ - data[i] = mandelbrot(lattice_to_complex(i, resolution), iterations); - } -} /* * Computes the number of iterations it takes for a point z0 to diverge -- cgit v1.2.3