type_hash.h

#ifndef TYPE_HASH_H
#define TYPE_HASH_H
 
#include "alloc.h"
#include "error.h"
#include "type_basic.h"
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
 
//#define DEBUG_HASH
//#undef DEBUG_HASH
 
typedef struct {
    uint size;         
    uint num_elements; 
    uint inserts;
    uint collisions; 
    uint* table;     
    uint(*hash_func)(
        uint, uint); 
    bool (*comp)(
        uint, uint); 
} hash_table;
 
hash_table* create_hash_table(
    uchar init, 
    uint(*hash_func)(
        uint, uint), 
    bool (*comp)(
        uint, uint) 
);
 
void delete_hash_table(hash_table* ht 
);
 
uint hash_table_insert(hash_table* ht, 
    uint index      
);
 
// typedef struct {
//     uint* elem;                  //!< An element: a permutation of
//     {0,...,n-1}. uint num;                    //!< Index of the element in
//     the future monoid. uint pred_ele;               //!< The preceding
//     element of the state. uint pred_lab;               //!< The preceding
//     letter of the state. uint* next;                  //!< Array of size
//     size_alpha containing the transitions, one for each letter.
// } mor_elem;
 
// typedef struct {
//     uint nb_elems;
//     uint nb_states;
//     uint nb_letters;
//     uint size;
//     uint* permuts;                  //!< size * nb_states.
//     uint* next;                     //!< size * nb_letters.
//     uint* pred_ele;                //!< size.
//     uint* pred_lab;                //!< size.
// } mor_object;
 
// int comp_mor_elem(uint e1, uint e2, void* param);
 
// uint hash_mor_elem(uint i, uint size, void* param);
 
// mor_object* mor_object_init(uint nb_states, uint nb_letters, uchar init);
 
// void mor_object_free(mor_object* M);
 
// void mor_object_grow(mor_object* M //!< The morphism object.
// );
 
#endif // TYPE_HASH_H