Datastructure choices for highspeed and memory efficient detection of duplicate of strings
- by Jonathan Holland
I have a interesting problem that could be solved in a number of ways:
I have a function that takes in a string.
If this function has never seen this string before, it needs to perform some processing.
If the function has seen the string before, it needs to skip processing.
After a specified amount of time, the function should accept duplicate…