Assembly Language for Beginners

3.18. C++ mov [esp+4], eax lea eax, [esp+14h] mov [esp], eax call _ZNSt6vectorIiSaIiEE9push_backERKi ; std::vector<int,std::a ...

3.18. C++ call _ZNSt6vectorIiSaIiEE9push_backERKi ; std::vector<int,std::allocator<int>>::push_back(⤦ Çint const& ...

3.18. C++ element 0: 1 element 1: 2 _Myfirst=0x8257028, _Mylast=0x8257034, _Myend=0x8257038 size=3, capacity=4 element 0: 1 elem ...

3.18. C++ 10 1 0 5 3 2 6 9 100 20 12 11 99 107 101 1001 1010 All keys that are smaller than the node key’s value are stored on t ...

3.18. C++ void dump_tree_node (struct tree_node *n, bool is_set, bool traverse) { printf ("ptr=0x%p Left=0x%p Parent=0x%p Right= ...

3.18. C++ m[1]="one"; m[6]="six"; m[99]="ninety-nine"; m[5]="five"; m[11]="eleven"; m[1001]="one thousand one"; m[1010]="one tho ...

3.18. C++ first=107 second=[one hundred seven] ptr=0x005BB420 Left=0x005BB3A0 Parent=0x005BB480 Right=0x005BB3A0 Color=1 Isnil=0 ...

3.18. C++ operator--andoperator++move the current node pointer to the predecessor or successor respectively, i.e., the nodes whi ...

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 ...

3.18. C++ it1=m.end(); printf ("m.end():\n"); dump_tree_node ((struct tree_node *)*(void**)&it1, false, false, false); // se ...

3.18. C++ R-------100 [one hundred] L-------20 [twenty] L-------12 [twelve] L-------11 [eleven] R-------99 [ninety-nine] R------ ...

3.18. C++ int M_color; // 0 - Red, 1 - Black struct tree_node M_parent; struct tree_node M_left; struct tree_node *M_right; }; s ...

3.18. C++ R-------456 11, 12 has been inserted root----123 L-------11 R-------12 R-------456 100, 1001 has been inserted root--- ...

3.19 Negative array indices This is the same as allocating memory for a structure usingmalloc()call. In fact,newin C++ is wrappe ...

3.19. NEGATIVE ARRAY INDICES 3.19.3 Arrays started at 1. Fortran and Mathematica defined first element of array as 1th, probably ...

3.19. NEGATIVE ARRAY INDICES 35 mov ecx, DWORD PTR _fakearray$[ebp] 36 ; ecx=address of fakearray[0], ecx+1 is fakearray[1] or a ...

3.20 Packing 12-bit values into array 001DFBDC |00CB0908 ; random garbage + 2 last bytes of array[] 001DFBE0 |0000000A ; last i ...

3.20. PACKING 12-BIT VALUES INTO ARRAY 3.20.3 The algorithm. So the algorithm can be as follows: if the element’s index is even, ...

3.20. PACKING 12-BIT VALUES INTO ARRAY array[array_idx+1]=array[array_idx+1]|val_highest_nibble; array[array_idx+2]=val_lowest_b ...

3.20. PACKING 12-BIT VALUES INTO ARRAY 512th element (0x200) is beginning. I added square brackets in my text editor to show tri ...