aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/src/serial-fractals.c
diff options
context:
space:
mode:
authorJP Appel <jeanpierre.appel01@gmail.com>2024-04-20 18:43:10 -0400
committerJP Appel <jeanpierre.appel01@gmail.com>2024-04-20 18:43:10 -0400
commita2a904713cb2216398f4ff322d1294afe07a7502 (patch)
treee2fa950fbb726574121aa0bb0b2febdde5e8214e /src/serial-fractals.c
parentd367b424d5ad862b6191270c9190aff261d1e581 (diff)
now call refactored complex_to_grid correctly
Diffstat (limited to 'src/serial-fractals.c')
-rw-r--r--src/serial-fractals.c17
1 files changed, 0 insertions, 17 deletions
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