ial.h

/*********************************************
 *   Program :   ial.h
 *   Authors :   Roman Dobiáš     - xdobia11
 *               Adrián Tomašov   - xtomas32
 *               Jozef Urbanovský - xurban66
 *               Adam Šulc        - xsulca00
 *               Kristián Barna   - xbarna02
 *   Skupina :   2BIB(2016)
 *   Created :   01.10.2016
 *   Compiled:   gcc 4.9.2
 *   Project :   IFJ16
 *
 *   Notes   :   Definition of IAL algorithms
 ********************************************/

#ifndef IFJ_IAL_H
#define IFJ_IAL_H

#include <stdbool.h>
#include "instruction_list.h"

typedef struct dt {
    int type;              // type specifier: void, int, ...
    struct dt *next_param; // pointer to the next parameter of function
    int inter_table;       // TODO: useless ?
    argument_var_t data;   // interpreter data
    unsigned int rank;     // the order of symbol creation
    int is_inicialized;    // reserved for static vars
} data_t;

typedef struct STAB_ELEMENT {
    char *stab_key;
    data_t stab_content;
    struct STAB_ELEMENT *stab_next;
} stab_element_t;

typedef struct {
    unsigned stab_size;

    unsigned (*hash_fun_ptr)(char *id, unsigned);

    unsigned stab_count;
    stab_element_t *arr[];
} stab_t;

typedef struct {
    int i;
    int j;
} interval;

//algorytmy
//rekurzivna funkcia triediaca pole
void ial_qsort(char* arr, int left, int right);
//Knuth–Morris–Pratt algoritmus na vyhľadávanie podreťazca v reťazci
int KMP_hladaj(char *retazec, char *podretazec);

//tabulka symbolov
//alokuje a inicaializuje priestor pre tabulu na 0
stab_t *stable_init(unsigned size);

//uvolni celu tabulku (tabulka + vsetky prvky)
void stable_destroy(stab_t **p_table);

//odstrani jeden prvok z tabulky
int stable_remove_var(stab_t *p_stable, char *id);

//prida prvok do tabulky a vrati odkaz na data. V pripade zlyhania vrati NULL
data_t *stable_add_var(stab_t *p_stable, char *id, data_t p_var);

//vrati ukazatel na dotazovany prvok
data_t *stable_get_var(stab_t *p_stable, char *id);

//prida prvok zadany oddelene ako 3x string (class, function, local); pri nedostatku miest vracia false
int stable_add_concatenate(stab_t *p_stable, char *clss, char *fnct, char *local, data_t data);

//true hodnotu ak sa prvok nasiel
int stable_search(stab_t *p_stable, char *srch_el);

// Searching a key of format 1.2.3......count
data_t *stable_search_variadic(stab_t *p_stable, int count, ...);

// Variadic form of adding a key into table
data_t *stable_add_variadic(stab_t *p_stable, data_t data, int count, ...);

void stable_print(stab_t *stable);

#endif //IFJ_IAL_H