Traitement-signal-plantes/Code-C/getArray.c

#include "getArray.h"
#include "fileGestion.h"
//#include <string.h>

long **get(int N, int M) /* Allocate the array */
{
    /* Check if allocation succeeded. (check for NULL pointer) */
    int i;
    long **array;
    array = (long **) malloc(N*sizeof(long *));
    for(i = 0 ; i < N ; i++)
        array[i] = (long *) malloc( M*sizeof(long) );
    return array;
}

void fillRawData(long** p, int N, int M) {
    int i, j;

    char *buffer;
    size_t bufsize = 200;
    buffer = (char *)malloc(bufsize * sizeof(char));
    char* token;

    FILE *f = fopen("rawData.csv","r");
    for(i = 0 ; i < N ; i++){
        if (!getline(&buffer, &bufsize, f)) break; // condition d'arret de la boucle si fichier fini
        //printf("buffer : %s token : ",buffer);
        j = 0;
        while((token = strsep(&buffer,",")) != NULL){     // séparation valeur par virgule initiale : csv
            //printf(token);
            p[i][j] = atoi(token);
            //printf("%d,", p[i][j]);
            //printf("%d, " , p[i][j]);
            j++;
        }
        //printf("\n\n");
    }
}

void printArrayData(long** p, int N, int M) {
    int i, j;
    for(i = 0 ; i < N ; i++){
        printf("line n°%d : %d , %d , %d , %d , %d , %d , %d , %d , %d\n" ,i,p[i][0],p[i][1],p[i][2],p[i][3],p[i][4],p[i][5],p[i][6],p[i][7],p[i][8]);
        }
}

int checkArrayFullyFill(long **p, int N , int M){
    for(int i  = 0 ; i < N ; i++){
            if(p[i][0] == '\0'){ return 1; }
    }
    return 0;
}

void freeArray(long **p, int N) {
    int i;
    for(i = 0 ; i < N ; i++)
        free(p[i]);
    free(p);
}

long **getRawDataArray(int N , int M){
    long **p;
    p = get(N, M);
    fillRawData(p ,N, M);
    //printf("before  test\n");
    if(checkArrayFullyFill(p,N,M)==0){
        //printf("after test 0\n");
        clearRawData(N);
        return p;
    }
    else{
        //printf("after test 1\n");
        return NULL;
    }
}