Tagged Questions
1
vote
0answers
59 views
Managing debug information of C program for Debugger
I am not sure if the title is appropriate.
I have written a parser for CDB files in C# and ANTLR that creates runtime objects for me such that I can pass it to the TCF Agent which takes care of ...
4
votes
2answers
223 views
Overriding GetHashCode in a mutable struct - What NOT to do?
I am using the XNA Framework to make a learning project. It has a Point struct which exposes an X and Y value; for the purpose of optimization, it breaks the rules for proper struct design, since its ...
1
vote
3answers
207 views
what is the javascript internal data structure?
Consider a basic js object:
var obj={x:1,y:'2'};
Is this stored internally as a hashtable or does js use a different mechanism for key value pairs? If they are hash tables does anyone know how they ...
5
votes
1answer
749 views
How do scalable bloom filters work?
I was reading up on scalable bloom filters and could not understand how each time a constituent bloom filters fills up, a new bloom filter with larger size is added.
The elements that contributed to ...
1
vote
1answer
244 views
hash with file instead of array
Is it possible to use hash function but with File instead of Array, and it's gonna be saving the record in a file position and then search will fseek to that position, but I'm not sure how to open a ...
-3
votes
1answer
558 views
Writing-Reading a hashtable to a text file
I'm implementing a hashtable structure for a dictionary. Dictionary is in a text file. There are 2 words on each line. I'm generating the hashtable by using the first word as a key. I'm holding the ...
2
votes
1answer
2k views
How costly are the Python dict and set in-built types?
I have undertaken a project concerning database deduplication. I did some research and have found that the Python dict type actually is a hashmap that uses open addressing.
In the deduplication ...
5
votes
3answers
350 views
Hashing growth strategy
What is a good growth strategy for hash tables? If the number of elements exceeds the number of buckets, I increase the number of buckets with the following formula:
n = int(n * 1.618033988749895) | ...
