dmeoli / ADS / 39308102402

98%

push

github

List keeps its cells in an ObjectPool, the cell of remove() serving the next insert(), so that the cells made one after another lie next to each other and a list of items with a trivial destructor dies a block at a time; List< T , false > takes its cells one by one from new and delete, as the short chains of ChainedHashTable do; the test of random insertions and removals against std::deque, of the walk backwards and std::reverse, of copies, moves, swaps and a self-swap between pools, of items with a destructor, and the specification on the list without a pool

36 of 36 new or added lines in 3 files covered. (100.0%)

23092 of 23543 relevant lines covered (98.08%)

8304149.76 hits per line