Alan Benett
May 1st, 1999, 03:41 PM
Hi!
I want to create a sort of dictionary in my programm.
It has the following characteristics:
- Each word has a certain value (a simple integer)
- Words can have the same values (many words!!)
I now want to be able to sort this list of words by the values assigned to the words.
And i need to do fast-searching of single words in the list.
Somehow a CMap <UINT, UINT, CStringList, CStringList&> etc. seems to be bad for searching single words. A CMap <CString, CString&, UINT, UINT> seems to be bad for sorting by values. List- or Array-Classes might be to slow...
Has anybody an idea what might be the best approach to this problem?
Best regards.
Alan.
I want to create a sort of dictionary in my programm.
It has the following characteristics:
- Each word has a certain value (a simple integer)
- Words can have the same values (many words!!)
I now want to be able to sort this list of words by the values assigned to the words.
And i need to do fast-searching of single words in the list.
Somehow a CMap <UINT, UINT, CStringList, CStringList&> etc. seems to be bad for searching single words. A CMap <CString, CString&, UINT, UINT> seems to be bad for sorting by values. List- or Array-Classes might be to slow...
Has anybody an idea what might be the best approach to this problem?
Best regards.
Alan.