C / C++ / MFC

void CMyListBase::OnKeyDown(UINT nChar) 
{
  switch (nChar)
    // Ctrl
    case VK_CONTROL:
      if (true/*m_bKeepLabelLeft && IndexToOrder(0) > 0*/)
        m_bControl = true;
      else
        m_pListCtrl->Default();
      break;
    case VK_LEFT:
     if( m_bControl)
       HandleLCTRLLeft();
     break;
}

class CMyClass
{
	// some CStrings, integers etc!
	// for example:
	CString csName;
	CString csVName;
	int iName;
}
typedef LPCTSTR MyString;
struct str_compare
{
	bool operator()(const MyString& lpStr1, const MyString& lpStr2)
	{
		return wcscmp(lpStr1, lpStr2) == 0; // maybe is here my error, is operator "==" in this place ok???
	}
};
// item for map:
CMyClass myClass;
myClass.csName = L"John";
myClass.csVName = L"Do";
myClass.iAge = 20;
// the hash_map:
hash_map<MyString, CMyClass>myhashmap;
// add items to map:
myhashmap.insert(L"John", myClass);

// iterator to find items in hash_map:
// question, do i need hash_compare for iterators??? Is my hash_compare here in sample code ok?
hash_map<MyString, CMyClass, hash_compare<MyString, str_compare>>::iterator testiterator;
testiterator = myhashmap.find(L"John");
if(myhashmap.end() != testiterator)
	AfxMessageBox("Item found");
else
	AfxMessageBox("Item not found");

#include "stdafx.h"
#include <hash_map>
#include "iostream"
#include "windows.h"
#include "atlstr.h"


class CMyClass
{
public:
	// some CStrings, integers etc!
	// for example:
	CString csName;
	CString csVName;
	int iAge;
};

int _tmain(int argc, _TCHAR* argv[])
{
	// items for map:
	CMyClass instance1;
	instance1.csVName = _T("John-Boy");
	instance1.csName = _T("Walton");
	instance1.iAge = 20;
	CMyClass instance2;
	instance2.csVName = _T("Jim-Bob");
	instance2.csName = _T("Walton");
	instance2.iAge = 16;

	// the hash_map:
	typedef stdext::hash_map<LPCTSTR, CMyClass, stdext::hash_compare<LPCTSTR, std::less<LPCTSTR> > > MyHashMapT;
	typedef MyHashMapT::iterator MyHashMapIt;
	MyHashMapT myhashmap;

	// add items to map:
	std::pair<MyHashMapIt, bool> result = myhashmap.insert( MyHashMapT::value_type( _T("John-Boy")/*instance1.csVName*/, instance1));
	result = myhashmap.insert(  MyHashMapT::value_type( _T("Jim-Bob")/*instance2.csVName*/, instance2));
	
	// iterator to find items in stdext::hash_map:
	MyHashMapIt testiterator = myhashmap.find( _T("John-Boy")/*instance1.csVName*/);
	if( myhashmap.end() != testiterator)
		std::wcout << _T("Item found") << std::endl;
	else
		std::wcout << _T("Item not found") << std::endl;

	return system("pause");
}

// the hash_map:
typedef stdext::hash_map > > MyHashMapT; // this line please

myhashmap.insert(L"John-Boy", instance2);

myhashmap.insert(MyHashMapT::value_type( _T("John-Boy"), instance1));

typedef stdext::hash_map< LPCTSTR, CMyClass, stdext::hash_compare< LPCTSTR, std::less<LPCTSTR> > > MyHashMapT;

I hate how the pre-tag is not able to take its content literally!

std::pair<MyHashMapIt, bool> result = myhashmap.insert( std::pair< LPCTSTR, CMyClass>( _T("John-Boy")/*instance1.csVName*/, instance1));
result = myhashmap.insert(  std::pair< LPCTSTR, CMyClass>( _T("Jim-Bob")/*instance2.csVName*/, instance2));

Ash20 wrote:

such that whenever you invoke the application exe , it will search whether robocopy exe is present at that place , if not it will copy the robocopy exe which is embedded in the Application exe to required location.

Matthew Faithfull wrote:

or do what every one else has done and write your own

George_George wrote:

1. ASSERT;
2. assert;
3. _ASSERT;
4. _assert.

Which one is the most correct to use?

George_George wrote:

I think there is no need to manually define ASSERT and other forms of ASSERT to NULL when in release configuration, right?