Assembly Language for Beginners

3.18. C++

if (n->M_right)
dump_tree_node (n->M_right, is_set, traverse, dump_keys_and_values);
};

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)
{
void point_after_struct=((char*)n)+sizeof(struct tree_node);

if (is_set)

printf ("%d\n", *(int*)point_after_struct);

else

{

struct map_pair *p=(struct map_pair *)point_after_struct;

printf ("%d [%s]\n", p->key, p->value);

}

if (n->M_left)
{
printf ("%.sL-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->M_left, is_set);
};
if (n->M_right)
{
printf ("%.sR-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->M_right, is_set);
};
};

void dump_map_and_set(struct tree_struct *m, bool is_set)
{
printf ("ptr=0x%p, M_key_compare=0x%x, M_header=0x%p, M_node_count=%d\n",
m, m->M_key_compare, &m->M_header, m->M_node_count);
dump_tree_node (m->M_header.M_parent, is_set, true, true);
printf ("As a tree:\n");
printf ("root----");
dump_as_tree (1, m->M_header.M_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, true);