Reverse Engineering for Beginners

CHAPTER 51. C++ CHAPTER 51. C++

const char* ALOT_OF_TABS="\t\t\t\t\t\t\t\t\t\t\t";

void dump_as_tree (int tabs, struct tree_node n, bool is_set)
{
if (is_set)
printf ("%d\n", n->first);
else
printf ("%d [%s]\n", n->first, n->second);
if (n->Left->Isnil==0)
{
printf ("%.sL-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->Left, is_set);
};
if (n->Right->Isnil==0)
{
printf ("%.*sR-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->Right, is_set);
};
};

void dump_map_and_set(struct tree_struct *m, bool is_set)
{
printf ("ptr=0x%p, Myhead=0x%p, Mysize=%d\n", m, m->Myhead, m->Mysize);
dump_tree_node (m->Myhead, is_set, true);
printf ("As a tree:\n");
printf ("root----");
dump_as_tree (1, m->Myhead->Parent, is_set);
};

int main()
{
// map

std::map<int, const char*> m;

m[10]="ten";

m[20]="twenty";

m[3]="three";

m[101]="one hundred one";

m[100]="one hundred";

m[12]="twelve";

m[107]="one hundred seven";

m[0]="zero";

m[1]="one";

m[6]="six";

m[99]="ninety-nine";

m[5]="five";

m[11]="eleven";

m[1001]="one thousand one";

m[1010]="one thousand ten";

m[2]="two";

m[9]="nine";

printf ("dumping m as map:\n");

dump_map_and_set ((struct tree_struct *)(void*)&m, false);

std::map<int, const char*>::iterator it1=m.begin();

printf ("m.begin():\n");

dump_tree_node ((struct tree_node *)*(void**)&it1, false, false);

it1=m.end();

printf ("m.end():\n");

dump_tree_node ((struct tree_node *)*(void**)&it1, false, false);

// set

std::set<int> s;

s.insert(123);

s.insert(456);

s.insert(11);

s.insert(12);

s.insert(100);