CMAP 관련자료

Introduction

Programmers like me, who learnt STL::map before CMap, always think CMap is difficult to use, and always try to use CMap in the way as a STL::map. In this article, I will explain about CMap and what you should do to use it for your own custom classes. And at the end of this article, I will show an example of how to use CMap correctly with CString* (note, I mean CString pointer and not CString :>)

CMap Internal

The first thing to be noted is that CMap is actually a hash map, and not a tree map (and usually a Red-black tree) as STL::map. Shown below is the internal structure of a CMap.

How to declare a CMap

Many people get confused about CMap‘s declaration CMap<KEY, ARG_KEY, VALUE, ARG_VALUE>, why not just CMap<KEY, VALUE>?

In fact, the ultimate data container in CMap is CPair, and the internal of CPair is {KEY, VALUE}. Therefore, CMap will really store a KEY, and not ARG_KEY. However, if you check with the MFC source code, almost all the internal parameters passing within CMap itself is called with ARG_KEY and ARG_VALUE, therefore, using KEY& as ARG_KEY seems always a correct thing, except when:

  1. You are using primitive date types like int, char, where pass-by-value makes no difference (may be even faster) with pass-by-reference.
  2. If you use CString as KEY, you should use LPCTSTR as ARG_KEY and not CString&, we will talk more about this later.

So what should I do to make CMap work with my ClassX

Well, as I mentioned earlier, CMap is a hash map, a hash map will try to get the “hash value” — a UINT — from the key, and use that hash value as the index in the hash table (well, actually it is hash value % hash table size). If more then one key have the same hash value, they will be linked in a linked list. Therefore, the first thing you have to do is to provide a hash function.

CMap will call a templated function HashKey() to do the hashing. The default implementation and specialized version for LPCSTR and LPCWSTR are listed as follows:

Hide Shrink Copy Code

// inside <afxtemp.h>
template<class ARG_KEY>
AFX_INLINE UINT AFXAPI HashKey(ARG_KEY key)
{
    // default identity hash - works for most primitive values
    return (DWORD)(((DWORD_PTR)key)>>4);
}
// inside <strcore.cpp>
// specialized implementation for LPCWSTR
#if _MSC_VER >= 1100
template<> UINT AFXAPI HashKey<LPCWSTR> (LPCWSTR key)
#else
UINT AFXAPI HashKey(LPCWSTR key)
#endif
{
    UINT nHash = 0;
    while (*key)
        nHash = (nHash<<5) + nHash + *key++;
    return nHash;
}
// specialized implementation for LPCSTR
#if _MSC_VER >= 1100
template<> UINT AFXAPI HashKey<LPCSTR> (LPCSTR key)
#else
UINT AFXAPI HashKey(LPCSTR key)
#endif
{
    UINT nHash = 0;
    while (*key)
        nHash = (nHash<<5) + nHash + *key++;
    return nHash;
}

As you can see, the default behavior is to “assume” that the key is a pointer, and convert it to DWORD, and that’s why you will get “error C2440: ‘type cast’: cannot convert from ‘ClassXXX’ to ‘DWORD_PTR'” if you don’t provide a specialized HashKey() for your ClassX.

And because MFC only has specialized implementations for the LPCSTR and LPCWSTR, and not for CStringA nor CStringW, if you want to use CString in CMap, you have to declare CMap<CString, LPCTSTR....>.

OK, now you know how CMap calculates the hash value, but since more than one key may have the same hash value, CMap needs to traverse the whole linked list to find the one with exactly the same key “content“, not only with the same “hash value“. And when CMap does the matching, it will call CompareElements(), another templated function.

Hide Copy Code

// inside <afxtemp.h>
// noted: when called from CMap,
//        TYPE=KEY, ARG_TYPE=ARG_TYPE
// and note pElement1 is TYPE*, not TYPE
template<class TYPE, class ARG_TYPE>
BOOL AFXAPI CompareElements(const TYPE* pElement1,
                            const ARG_TYPE* pElement2)
{
    ASSERT(AfxIsValidAddress(pElement1,
           sizeof(TYPE), FALSE));
    ASSERT(AfxIsValidAddress(pElement2,
           sizeof(ARG_TYPE), FALSE));
    // for CMap<CString, LPCTSTR...>
    // we are comparing CString == LPCTSTR
    return *pElement1 == *pElement2;
}

Therefore, if you want to use CMap with your own custom ClassX, you will have to provide a specialized implementation for HashKey() and CompareElements().

Example: CMap with CString*

Provided as an example, below is what you need to do to make CMap work with CString*, and of course, using the string content as the key, and not the address of the pointer.

Hide Copy Code

template<>
UINT AFXAPI HashKey<CString*> (CString* key)
{
    return (NULL == key) ? 0 : HashKey((LPCTSTR)(*key));
}
// I don't know why, but CompareElements can't work with CString*
// have to define this
typedef CString* LPCString;
template<>
BOOL AFXAPI CompareElements<LPCString, LPCString>
     (const LPCString* pElement1, const LPCString* pElement2)
{
    if ( *pElement1 == *pElement2 ) {
        // true even if pE1==pE2==NULL
        return true;
    } else if ( NULL != *pElement1 && NULL != *pElement2 ) {
        // both are not NULL
        return **pElement1 == **pElement2;
    } else {
        // either one is NULL
        return false;
    }
}

And the main program is as simple as:

Hide Copy Code

int _tmain(int argc, TCHAR* argv[], TCHAR* envp[])
{
    CMap<CString*, CString*, int, int> map;
    CString name1 = "Microsoft";
    CString name2 = "Microsoft";
    map[&name1] = 100;
    int x = map[&name2];
    printf("%s = %d\n", (LPCTSTR)name1, x);*/
    return 0;
}

Hide Copy Code

--------- console output ---------
Microsoft = 100

Please note that the program can compile without error even without the specialized HashKey() and CompareElements(), but of course, the output will then be 0, probably not what you want.

My final note about CMap

  1. CMap is a hash map and STL::map is a tree map, there is no meaning comparing the two for performance (it would be like comparing apples and oranges!). But if you will retrieve the keys in sorted order, then you will have to use STL::map.
  2. The design of HashKey() is critical to the overall performance. You should provide a HashKey() that has a low collision rate (different keys generally would have different hash values) and is easy to calculate (not a MD5 of the string, etc..). And we have to note that — at least for some of the classes — this is not easy.
  3. When using CMap (as well as STL::hash_map), always beware of the hash table size. As quoted in MSDN, “the hash table size should be a prime number. To minimize collisions, the size should be roughly 20 percent larger than the largest anticipated data set”. By default, CMap hash table size is 17, which should be okay for around 10 keys. You can change the hash table size with InitHashTable(UINT nHashSize), and can only do so before the first element is added to the map. You can find more prime numbers here. (And don’t mix-up with CMap(UINT nBlockSize), nBlockSize is to acquire more than one CAssoc to speed up the creation of a new node.)

“CMAP 관련자료”의 86개의 댓글

  1. Hello! I’ve been reading your weblog for some time now and finally
    got the bravery to go ahead and give you a shout out
    from Atascocita Tx! Just wanted to mention keep up the good
    job!

  2. My programmer is trying to convince me to move to .net from PHP.
    I have always disliked the idea because of the costs.
    But he’s tryiong none the less. I’ve been using WordPress on a number of websites for
    about a year and am nervous about switching to
    another platform. I have heard excellent things about blogengine.net.
    Is there a way I can transfer all my wordpress posts into
    it? Any kind of help would be really appreciated!

  3. I’m amazed, I must say. Rarely do I come across a blog that’s
    both equally educative and interesting, and let me tell you, you have
    hit the nail on the head. The problem is an issue that too few people are speaking intelligently about.
    I am very happy I came across this in my hunt for something concerning this.

  4. Pretty section of content. I just stumbled upon your weblog and in accession capital to assert that
    I get actually enjoyed account your blog posts. Anyway I’ll be subscribing to your augment and
    even I achievement you access consistently quickly.

  5. I just want to tell you that I’m very new to blogs and truly liked this blog. More than likely I’m likely to bookmark your blog . You amazingly come with outstanding stories. Thank you for sharing your webpage.

  6. Simply want to say your article is as surprising.

    The clarity in your post is just nice and i can assume you are
    an expert on this subject. Well with your permission let
    me to grab your feed to keep up to date with forthcoming post.
    Thanks a million and please carry on the enjoyable work.

  7. 핑백: fake glo carts

  8. 핑백: view our profile now

  9. 핑백: mơ thấy ác mộng

  10. 핑백: panzer bp12

  11. 핑백: olej konopny

  12. 핑백: cách nhớ bài catte

  13. 핑백: Skrota bilen

  14. 핑백: Skrotning av bil Uddevalla

  15. 핑백: Betalt for skrotbilar Kungälv

  16. 핑백: bốc mộ là gì

  17. 핑백: Buy Steroids Online

  18. 핑백: https://forex-fx.org/

  19. 핑백: bollywood-slots.info

  20. 핑백: top replica watches

  21. 핑백: garage door repair nepean

  22. 핑백: Adderall for sale

  23. 핑백: rescator dumps

  24. 핑백: Live Porn

  25. 핑백: cvv fullz forum

  26. 핑백: real-gomovies

  27. 핑백: zügelfirma zürich

  28. Thankѕ for another informative website. Where else may I get that type of information written in such an ideal means? Ӏ have a miѕsion that I’m just now working on, and I’ve been at the glance out for such info.

  29. 핑백: ดูอนิเมะตอนเดียวจบ

  30. 핑백: poker online

  31. 핑백: garage door repair etobicoke

  32. 핑백: tai w88

  33. 핑백: http://fks-team.net/registracziya/

  34. 핑백: mơ thấy mua nhà

  35. 핑백: marketmenow

  36. 핑백: Mail Bomber

  37. 핑백: youtube live stream views buy

  38. 핑백: garage door moving slow

  39. 핑백: mơ thấy con sâu

  40. I was suggested this web site by my cousin. I am not sure
    whether this post is written by him as no one else know such detailed about
    my difficulty. You’re wonderful! Thanks!

  41. Magnificent goods from you, man. I have take into accout your stuff prior to and you are simply too wonderful.
    I really like what you’ve received here, certainly like what you’re saying and the best way through which you
    are saying it. You’re making it enjoyable and you still care for to keep it wise.
    I can not wait to learn much more from you. That is actually a tremendous site.

  42. I’d like to thank you for the efforts you’ve put in penning this blog.
    I am hoping to check out the same high-grade content from you later
    on as well. In truth, your creative writing abilities has motivated me to get my very own website now 😉 ps4 games allenferguson ps4 games

  43. whoah this weblog is wonderful i really like reading your articles.
    Keep up the great work! You recognize, a lot of individuals are searching round for this info, you could help
    them greatly.

  44. Simply want to say your article is as astonishing.
    The clarity in your post is simply nice and i could assume you’re
    an expert on this subject. Fine with your permission allow me to grab your feed to keep up to date with forthcoming post.
    Thanks a million and please keep up the gratifying work.

  45. A fascinating discussion is worth comment. I believe that you should write
    more on this subject matter, it may not be a taboo subject but typically folks don’t
    discuss these issues. To the next! Many thanks!!

  46. I do trust all the concepts you’ve introduced on your post.
    They are really convincing and will definitely work. Nonetheless, the
    posts are too quick for beginners. May just you please lengthen them a bit from next time?
    Thank you for the post. asmr 0mniartist

  47. I do not even know how I ended up here, but I thought this post was good.
    I don’t know who you are but certainly you’re
    going to a famous blogger if you are not already 😉 Cheers!

  48. Somebody essentially assist to make critically posts I’d state.
    This is the first time I frequented your web page and to this point?
    I amazed with the analysis you made to make this actual publish extraordinary.
    Wonderful activity!

  49. Hi, I do think this is a great web site. I stumbledupon it 😉
    I’m going to return yet again since i have book marked
    it. Money and freedom is the best way to change, may you be rich and continue to guide others.

  50. Greate post. Keep writing such kind of info on your site. Im really impressed by
    your site.
    Hello there, You have performed an excellent job. I will certainly digg
    it and in my view recommend to my friends. I’m confident they will be benefited from this site.

  51. Heya i am for the primary time here. I came across
    this board and I to find It truly helpful & it helped me out much.
    I am hoping to give something back and aid others such as you helped me.

  52. I blog often and I genuinely appreciate your content.

    Your article has truly peaked my interest. I am going
    to bookmark your website and keep checking for new details about once a week.
    I subscribed to your RSS feed as well.

  53. Heya i’m for the primary time here. I came across this board and I in finding It
    truly helpful & it helped me out a lot. I’m hoping to present something again and help others
    such as you helped me.

  54. scoliosis
    I love your blog.. very nice colors & theme. Did you create this website
    yourself or did you hire someone to do it for you? Plz answer back
    as I’m looking to create my own blog and would
    like to find out where u got this from. many thanks scoliosis

  55. scoliosis
    Hi there! Would you mind if I share your blog with my facebook group?
    There’s a lot of folks that I think would really enjoy your content.
    Please let me know. Many thanks scoliosis

  56. Normally I don’t read article on blogs, however I wish to say that this write-up very compelled me to try and do so!
    Your writing style has been surprised me. Thanks, quite great post.

  57. I was more than happy to uncover this page.
    I want to to thank you for ones time for this wonderful read!!
    I definitely savored every bit of it and i also have you saved as a favorite to look at new things
    in your website.

  58. Oh my goodness! Amazing article dude! Thank you, However
    I am experiencing issues with your RSS. I don’t understand why I can’t subscribe to
    it. Is there anybody having the same RSS issues?

    Anyone that knows the answer can you kindly respond? Thanks!!

  59. Undeniably believe that that you stated. Your favourite justification appeared to
    be on the net the simplest factor to take into account of.
    I say to you, I certainly get irked even as other people consider issues that they just don’t
    recognize about. You managed to hit the nail upon the highest and
    also outlined out the whole thing with no need side-effects ,
    folks could take a signal. Will likely be back
    to get more. Thanks

  60. I was recommended this web site by my cousin. I’m not sure whether this post is written by him as nobody else know such detailed about my difficulty.
    You’re incredible! Thanks!

답글 남기기