I’m working on the CS50 speller problem and running into an issue. My program is reading way more misspelled words than it should. I’ve traced the problem to my check function. From what I can tell, ...

I think this is a design problem. I’m trying to implement a hash table library in C89 in which the user will be able to insert mixed-type literal keys and values, e.g., HT_SET_LITERAL(&ht, "...

I need to find the union of many (about 1M) 64-bit integer vectors, each has about 10K integers. There are duplicates in each array and also duplicates among different arrays. A simple algorithm is to ...

I am trying to make an std::unordered_set whose key is of type std::tuple. The below code compiled by MSVC gives me: Error C3848 expression having type 'const _Hasher' would lose some const-volatile ...

EDIT: As one of the people commenting mentioned, this question only concerns this specific implementation: https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/java/util/HashMap.java#...

I have a hashtable below (which holds server related info) with a ‘template’ key value. I have a loop which duplicates the value and assigns with a new key Then in the new key values I would modify ...

I wrote some code where I tried to make list members unique by converting the list to a hash and then using the keys of that hash as elements. This worked without complaint in Perl 5.18, but now fails ...

I have been asked what is a problem with hash function: h(S) = ((sum(S[i]*x**i)) mod p) mod m, where i = {1, ..., s-1}. S - some long string, x - some positive number, s - length of S, p - number(...

I’m trying create some automations to help with general activities on an environment and was trying to think of a clean accessible way to store and access info via powershell hashmaps $test=@{ &...

Given an array of n integers in the range [-n²,n²], how can I find any two indices i<j where the absolute difference between the elements equals the distance between their positions? I'm looking ...

I'm writing some C code using GLib and using GHashTable to store some data. However, sometimes I need to do a "reverse lookup" where I need to find the first key that matches a given value. ...

I'm working on a code which is supposed to load a dictionary and check if the words in a text is correct. The code compiles when working with small lists (for dictionary) yet I get 'segmentation error:...

I am not much of a programmer but i have read some where that hash tables are fast when checking existence of data. I have a list containing 4 million elements of at least 120 bytes each which i need ...

#define SIZE 100000 // 1. hash_function() is a function that return an int // 2. snowflake_node typedef struct snowflake_node { int snowflake[6]; struct snowflake_node *next; } snowflake_node; ...

I approached a problem when I tried to use XXH3_64bit from <xxhash.h> module over the wrapper with __fastcall for GHashTable initialization, but the type definition for GHashFunc requires the ...