42/42_INT_11_ft_containers
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

new version of map erase

Browse Source
This commit is contained in:
hugogogo
2022-06-30 20:02:18 +02:00
parent a968b4d791
commit ae646ee58a
3 changed files with 287 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

120
tests/tests_map.cpp
View File

@@ -69,8 +69,8 @@ TEST_M(tests_map_operator_assignation)
PRINT(first)
PRINT(second)
second=first; // second now contains 3 ints
first=ft::map<T,U>(); // and first is now empty
second=first; // second now contains 3 ints
first=ft::map<T,U>(); // and first is now empty
std::cout << "Size of first: " << first.size() << '\n';
std::cout << "Size of second: " << second.size() << '\n';
@@ -287,6 +287,122 @@ TEST_M(tests_map_erase)
PRINT(mymap)
// title
TITLE(more complexe tree)
mymap[VALT('b')]=VALU(20);
mymap[VALT('c')]=VALU(30);
mymap[VALT('e')]=VALU(50);
mymap[VALT('g')]=VALU(24);
mymap[VALT('h')]=VALU(64);
mymap[VALT('i')]=VALU(52);
mymap[VALT('j')]=VALU(14);
mymap[VALT('k')]=VALU(12);
mymap[VALT('l')]=VALU(46);
mymap[VALT('m')]=VALU(37);
mymap[VALT('n')]=VALU(31);
mymap[VALT('o')]=VALU(58);
mymap[VALT('p')]=VALU(18);
mymap[VALT('q')]=VALU(25);
mymap[VALT('r')]=VALU(36);
mymap[VALT('s')]=VALU(43);
mymap[VALT('t')]=VALU(49);
mymap[VALT('u')]=VALU(21);
mymap[VALT('v')]=VALU(55);
mymap[VALT('w')]=VALU(33);
mymap[VALT('x')]=VALU(44);
mymap[VALT('y')]=VALU(11);
mymap[VALT('z')]=VALU(22);
mymap.erase (VALT('a'));
mymap[VALT('a')]=VALU(10);
mymap.erase (VALT('b'));
mymap[VALT('b')]=VALU(20);
mymap.erase (VALT('c'));
mymap[VALT('c')]=VALU(30);
mymap.erase (VALT('d'));
mymap[VALT('d')]=VALU(40);
mymap.erase (VALT('e'));
mymap[VALT('e')]=VALU(50);
mymap.erase (VALT('f'));
mymap[VALT('f')]=VALU(60);
mymap.erase (VALT('g'));
mymap[VALT('g')]=VALU(24);
mymap.erase (VALT('h'));
mymap[VALT('h')]=VALU(64);
mymap.erase (VALT('i'));
mymap[VALT('i')]=VALU(52);
mymap.erase (VALT('j'));
mymap[VALT('j')]=VALU(14);
mymap.erase (VALT('k'));
mymap[VALT('k')]=VALU(12);
mymap.erase (VALT('l'));
mymap[VALT('l')]=VALU(46);
mymap.erase (VALT('m'));
mymap[VALT('m')]=VALU(37);
mymap.erase (VALT('n'));
mymap[VALT('n')]=VALU(31);
mymap.erase (VALT('o'));
mymap[VALT('o')]=VALU(58);
mymap.erase (VALT('p'));
mymap[VALT('p')]=VALU(18);
mymap.erase (VALT('q'));
mymap[VALT('q')]=VALU(25);
mymap.erase (VALT('r'));
mymap[VALT('r')]=VALU(36);
mymap.erase (VALT('s'));
mymap[VALT('s')]=VALU(43);
mymap.erase (VALT('t'));
mymap[VALT('t')]=VALU(49);
mymap.erase (VALT('u'));
mymap[VALT('u')]=VALU(21);
mymap.erase (VALT('v'));
mymap[VALT('v')]=VALU(55);
mymap.erase (VALT('w'));
mymap[VALT('w')]=VALU(33);
mymap.erase (VALT('x'));
mymap[VALT('x')]=VALU(44);
mymap.erase (VALT('y'));
mymap[VALT('y')]=VALU(11);
mymap.erase (VALT('z'));
mymap[VALT('z')]=VALU(22);
PRINT(mymap)
// title
TITLE(erasing entire tree)
mymap.erase (VALT('a'));
mymap.erase (VALT('b'));
mymap.erase (VALT('c'));
mymap.erase (VALT('d'));
mymap.erase (VALT('e'));
mymap.erase (VALT('f'));
mymap.erase (VALT('g'));
mymap.erase (VALT('h'));
mymap.erase (VALT('i'));
mymap.erase (VALT('j'));
mymap.erase (VALT('k'));
mymap.erase (VALT('l'));
mymap.erase (VALT('m'));
mymap.erase (VALT('n'));
mymap.erase (VALT('o'));
mymap.erase (VALT('p'));
mymap.erase (VALT('q'));
mymap.erase (VALT('r'));
mymap.erase (VALT('s'));
mymap.erase (VALT('t'));
mymap.erase (VALT('u'));
mymap.erase (VALT('v'));
mymap.erase (VALT('w'));
mymap.erase (VALT('x'));
mymap.erase (VALT('y'));
mymap.erase (VALT('z'));
PRINT(mymap)
DELETE
}