Dear Monks,
I would like to avoid 'out of memory' in my program which is caused by big amount of data in data structures.
I have to compare text for equality, and I am storing in Hash. The keys of the hash 'texts' are approximately 1000 characters and I have 500 such entries and I have to search for duplicate entries.
Which technique can help to avoid 'out of memory'.?