좋은향기's 프로그램 블로그

#include <locale.h>

_wsetlocale(LC_ALL, L"kor");

LINKER_FLAGS=$(LINKER_FLAGS) –MAP

#include "stdafx.h"

#include <WTypes.h>"

 
DWORD g_dwDummy;

void DummyFunction_A()

{

           int a= 0;

           a++;

           return;

}

void DummyFunction_B()

{

           int b = 0;

           b--;

           return;

}

void DummyFunction_C()

{

           int c = 0;

           c += 2;

           return;

}

int wmain(int argc, _TCHAR* argv[])

{

           HMODULE hInst = ::GetModuleHandle(NULL);

           DummyFunction_A();

           DummyFunction_B();

           printf( "Module Base Address: %#p\n", (void *)hInst);

           printf( "DummyFunction_A() Function Address: %#p\n", (void *)DummyFunction_A);

           printf( "DummyFunction_B() Function Address: %#p\n", (void *)DummyFunction_B);

           printf( "g_dwDummy Global Variable Address: %#p\n", &g_dwDummy);

           return 0;

} 

Preferred load address is 00400000

DummyFunction_A() Address

= 0x00401000(Rva+Base) – 0x00400000(Preferred load Address) + Module Base주소

#include <map>

void map_function()

{

           using namespace std;

           // 선언

           typedef map< UINT, char * > HFILE_MAP;

           typedef HFILE_MAP::iterator HFILE_MAP_ITERATOR;

           HFILE_MAP MAP;

           HFILE_MAP_ITERATOR it;

           char *p1 = new char[16];

           char *p2 = new char[16];

           strcpy(p1, "A1");

           strcpy(p2, "A2");

           // 추가

           MAP.insert( HFILE_MAP::value_type( 1 , p1 ) );

           MAP.insert( HFILE_MAP::value_type( 2 , p2 ) );

           // 검색

           it = MAP.find( 1 );

           if ( it != MAP.end() )

           {

                     char *pFind = (char *)it->second; // "A1"

           }

           else

           {

                     // not exist

           }

           //순회

           for ( it = MAP.begin(); it != MAP.end(); it++)

           {

                     if ( strcmp(it->second, "A2") == 0 )

                     {

                                break;

                     }

           }

           // 삭제

           delete [] it->second;

           MAP.erase( it );

           // 순회 삭제

           for ( it = MAP.begin(); it != MAP.end(); )

           {

                     if ( it->second && IsConditionMatch )

                     {

                                delete [] it->second;

                                it->second = NULL;

                                it = MAP.erase(it++);

                     }

                     else

                     {

                               ++it;

                     }

           }

           // 모든항목삭제

           MAP.clear();

           // 항목갯수

           MAP.empty();

           MAP.size();

}

구분

Usage

헤더파일

#include <vector>

#include <algorithm>

선언

vector<int> V;

전체 삭제

V.clrear();

삭제

V.erase( it );

삽입

V.push_back(1 );

검색

vector<int>::iterator it = find( V.begin(), V.end(), i);

if ( it != V.end() )

{

           // exist

}

else

{

           // not exist

}

카운팅

V.empty()

V.size()