Return to Answer

HASH_CONS_TABLE hash_cons_table_create(HASH_CONS_HASH hashf, HASH_CONS_EQUAL equalf)
{
 HASH_CONS_TABLE hc = malloc(sizeof(hc));
 if (hc == NULL)
 {
 fprintf(stderr, "Memory allocation of the hashcons table failed, program exiting.\n");
 return hc;
 }
 hc->hashf = hashf;
 hc->equalf = equalf;
 hc->size = 0;
 return hc;
}
HASH_CONS_TABLE hash_cons_table_delete(HASH_CONS_TABLE hc)
{
 for (size_t i = 0; i < hc->capacity)
 {
 if (hc->table[i])
 {
 free(hc->table[i]);
 }
 }
 free(hc->table);
 free(hc);
 return NULL;
}

Hash_Cons_Table_Ptr hash_cons_table_create(Hash_Cons_Hash hashf, Hash_Cons_Equal equalf)
{
 Hash_Cons_Table_Ptr hc = malloc(sizeof(*hc));
 if (hc == NULL)
 {
 fprintf(stderr, "Memory allocation of the hashcons table failed, program exiting.\n");
 return NULL;
 }
 memset(hc, 0, sizeof(*hc));
 hc->hashf = hashf;
 hc->equalf = equalf;
 return hc;
}
HASH_CONS_TABLE hash_cons_table_delete(HASH_CONS_TABLE hc)
{
 for (size_t i = 0; i < hc->capacity)
 {
 if (hc->table[i])
 {
 free(hc->table[i]);
 }
 }
 free(hc->table);
 free(hc);
 return NULL;
}

In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal. The term hash consing originates from implementations of Lisp that attempt to reuse cons cells that have been constructed before, avoiding the penalty of memory allocation. 2. Rather than just providing a link to a PDF file for the definition of It uses larger twin primes as the capacity and double hashing (open addressing) put at least some of the text in the PDF in the question and make that a link to the PDF for more information. 3. Include the entire program in the embedded code. 4. Remove commented out code before a code review, it shows that the code may not be ready for a code review.

In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal. The term hash consing originates from implementations of Lisp that attempt to reuse cons cells that have been constructed before, avoiding the penalty of memory allocation.

2. Rather than just providing a link to a PDF file for the definition of It uses larger twin primes as the capacity and double hashing (open addressing) put at least some of the text in the PDF in the question and make that a link to the PDF for more information.
3. Include the entire program in the embedded code.
4. Remove commented out code before a code review, it shows that the code may not be ready for a code review.

1. A definition of what a hash cons is, I had to google it: In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal. The term hash consing originates from implementations of Lisp that attempt to reuse cons cells that have been constructed before, avoiding the penalty of memory allocation.
2. Rather than just providing a link to a PDF file for the definition of It uses larger twin primes as the capacity and double hashing (open addressing) put at least some of the text in the PDF in the question and make that a link to the PDF for more information.
3. Include the entire program in the embedded code.
4. Remove commented out code before a code review, it shows that the code may not be ready for a code review.

1. A definition of what a hash cons is, I had to google it:

In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal. The term hash consing originates from implementations of Lisp that attempt to reuse cons cells that have been constructed before, avoiding the penalty of memory allocation. 2. Rather than just providing a link to a PDF file for the definition of It uses larger twin primes as the capacity and double hashing (open addressing) put at least some of the text in the PDF in the question and make that a link to the PDF for more information. 3. Include the entire program in the embedded code. 4. Remove commented out code before a code review, it shows that the code may not be ready for a code review.