I have a struct in C which mimics a hashtable, except it is an array of linked lists. The length of the array is predetermined by the hash_length and is set to 2^hash_length. My function here is supposed to free all of the memory allocated by its respective ht_create function. By looping through the array… Read More Is there a "Heap-use after free" in my code here?

I need to provide an iterator for my custom fixed sized hashtable class, I am storing the data in an array of linkedlist. class HashTableNode<T1, T2> { public T1 Key { get; set; } public T2 Value { get; set; } } class HashTableClass<T1, T2> { public LinkedList<HashTableNode<T1, T2>>[] elements; const int defaultSize = 10000;… Read More Iterator for custom Hashtable C#

I am studying C (self-study, not in an educational institution) and have been trying to build a hashtable data structure as part of my learning. Please refer to this hopefully reproducible example: #include <stdio.h> #include <stdlib.h> struct table_item { char *name; char gender; char *birthdate; char *address; }; struct list_node { struct table_item *data; struct… Read More Need help understanding flaw in my efforts to free memory from created hashtable

I have watched several videos as this one, but could not understand how the index value is generated. There is a formula as index = hash & (n-1) but it is not mentioned what the "n" is?. So, could you please explain how that index value is generated? >Solution : The hash is generated based… Read More How Java Hashmap index is generated via hash value?

I’m teaching myself how to use classes in c#. I have a ‘what’s the best way’ question I’m hoping someone with experience can give me guidance on. Say I have a class object for a ‘Teacher’. The class has members for the teacher’s name, grade level, pay rate, and so on. I’d also like to… Read More c# Class object – What is the best way to store/retrieve a multiple-value list?

My code looks like this: def createEventBody(name,description,attendees,location, eventColor = None): eventBody = { ‘Name’: name, #EventName ‘Color’: eventColor, ‘location’: location, ‘description’:description, ‘attendees’: [], } The thing is, I want to add some logic so that the key ‘Color’ is not included if eventColor = None. I was thinking something like this: def createEventBody(name,description,attendees,location, eventColor =… Read More Python if statement to skip dictionary key when creating a dictionary

I have a text file that I read the data from and search the names inside to keep track of it. I want to use Hashing instead of Arrays for the speed of search, and I don’t want to insert a name twice if it’s already included in the hash. (I found some code about… Read More Hashing words in C++?