diff options
| author | Julian Weigt <juw@posteo.de> | 2026-01-09 18:11:29 +0000 |
|---|---|---|
| committer | Julian Weigt <juw@posteo.de> | 2026-02-04 16:01:40 +0100 |
| commit | 0f3bdd67534efe0f5c059c070b051d84d1988eee (patch) | |
| tree | 120396d2efb870ce14b38d93466333165fb60bb0 | |
| parent | 6f1ba57b3f0b4121ee4806b6c1a3aa578bfb4d97 (diff) | |
Remove malloc also for maximal function computation.nomalloc
| -rw-r--r-- | charf.c | 16 |
1 files changed, 2 insertions, 14 deletions
@@ -67,16 +67,9 @@ VALUETYPE integratep(VALUETYPE* f, EXPTYPE p, int D){ void compute_maximalfunction(VALUETYPE* f, VALUETYPE* Mf, int D){ /*Sf[i][j] will be the integral of f on [min(i,j),max(i,j)]*/ - //VALUETYPE Sf[N][N]; + VALUETYPE Sf[N][N]; /*Af[i][j] will be the average of f on [min(i,j),max(i,j)]*/ - //VALUETYPE Af[N][N]; - /*Apparently may become too big for stack or something so have to use malloc instead.*/ - VALUETYPE* Sf[N]; - VALUETYPE* Af[N]; - for(int i=0; i<D; i++){ - Sf[i] = malloc(D*sizeof(VALUETYPE)); - Af[i] = malloc(D*sizeof(VALUETYPE)); - } + VALUETYPE Af[N][N]; for(int i=0; i<D; i++) { Sf[i][i] = f[i]; @@ -110,11 +103,6 @@ void compute_maximalfunction(VALUETYPE* f, VALUETYPE* Mf, int D){ printf("\n"); } */ - - for(int i=0; i<D; i++){ - free(Af[i]); - free(Sf[i]); - } } bool over_threshold_charf(double t, int k){ |
