Baseline and compare_to are the same: disabling baseline. ×
Fields
| hardware | None |
| os | None |
Parameters
Fields
| Name | Value |
|---|
Parameters
| Name | Value |
|---|
Filter
m3pro-xcode26-main test results
| Run | Order | Start Time | Duration | |
|---|---|---|---|---|
| Current | 551006 | 2025-10-20T19:20:33 | -1 day, 22:45:57 | |
| Previous | 540650 | 2025-10-21T23:32:24 | -1 day, 23:59:55 | |
| No Baseline Run | ||||
Tests Summary
| Status Group | # |
|---|---|
| Performance Improvements | 1 |
| Added Tests | 100 |
| Unchanged Tests | 1804 |
| Total Tests | 1905 |
| Performance Improvements - execution_time | Δ | Previous | Current | σ |
|---|---|---|---|---|
| BM_map_find_string_literal | -6.37% | 20.728 | 19.408 | - |
| Added Tests - execution_time |
|---|
| std::unordered_map<int,_int>::clear()/0 |
| std::unordered_map<int,_int>::clear()/1024 |
| std::unordered_map<int,_int>::clear()/32 |
| std::unordered_map<int,_int>::clear()/8192 |
| std::unordered_map<int,_int>::contains(key)_(existent)/0 |
| std::unordered_map<int,_int>::contains(key)_(existent)/1024 |
| std::unordered_map<int,_int>::contains(key)_(existent)/32 |
| std::unordered_map<int,_int>::contains(key)_(existent)/8192 |
| std::unordered_map<int,_int>::contains(key)_(non-existent)/0 |
| std::unordered_map<int,_int>::contains(key)_(non-existent)/1024 |
| std::unordered_map<int,_int>::contains(key)_(non-existent)/32 |
| std::unordered_map<int,_int>::contains(key)_(non-existent)/8192 |
| std::unordered_map<int,_int>::count(key)_(existent)/0 |
| std::unordered_map<int,_int>::count(key)_(existent)/1024 |
| std::unordered_map<int,_int>::count(key)_(existent)/32 |
| std::unordered_map<int,_int>::count(key)_(existent)/8192 |
| std::unordered_map<int,_int>::count(key)_(non-existent)/0 |
| std::unordered_map<int,_int>::count(key)_(non-existent)/1024 |
| std::unordered_map<int,_int>::count(key)_(non-existent)/32 |
| std::unordered_map<int,_int>::count(key)_(non-existent)/8192 |
| std::unordered_map<int,_int>::ctor(const&)/0 |
| std::unordered_map<int,_int>::ctor(const&)/1024 |
| std::unordered_map<int,_int>::ctor(const&)/32 |
| std::unordered_map<int,_int>::ctor(const&)/8192 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(sorted_sequence)/0 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(sorted_sequence)/1024 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(sorted_sequence)/32 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(sorted_sequence)/8192 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(unsorted_sequence)/0 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(unsorted_sequence)/1024 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(unsorted_sequence)/32 |
| std::unordered_map<int,_int>::ctor(iterator,_iterator)_(unsorted_sequence)/8192 |
| std::unordered_map<int,_int>::erase(iterator)/0 |
| std::unordered_map<int,_int>::erase(iterator)/1024 |
| std::unordered_map<int,_int>::erase(iterator)/32 |
| std::unordered_map<int,_int>::erase(iterator)/8192 |
| std::unordered_map<int,_int>::erase(iterator,_iterator)_(erase_half_the_container)/0 |
| std::unordered_map<int,_int>::erase(iterator,_iterator)_(erase_half_the_container)/1024 |
| std::unordered_map<int,_int>::erase(iterator,_iterator)_(erase_half_the_container)/32 |
| std::unordered_map<int,_int>::erase(iterator,_iterator)_(erase_half_the_container)/8192 |
| std::unordered_map<int,_int>::erase(key)_(existent)/0 |
| std::unordered_map<int,_int>::erase(key)_(existent)/1024 |
| std::unordered_map<int,_int>::erase(key)_(existent)/32 |
| std::unordered_map<int,_int>::erase(key)_(existent)/8192 |
| std::unordered_map<int,_int>::erase(key)_(non-existent)/0 |
| std::unordered_map<int,_int>::erase(key)_(non-existent)/1024 |
| std::unordered_map<int,_int>::erase(key)_(non-existent)/32 |
| std::unordered_map<int,_int>::erase(key)_(non-existent)/8192 |
| std::unordered_map<int,_int>::find(key)_(existent)/0 |
| std::unordered_map<int,_int>::find(key)_(existent)/1024 |
| std::unordered_map<int,_int>::find(key)_(existent)/32 |
| std::unordered_map<int,_int>::find(key)_(existent)/8192 |
| std::unordered_map<int,_int>::find(key)_(non-existent)/0 |
| std::unordered_map<int,_int>::find(key)_(non-existent)/1024 |
| std::unordered_map<int,_int>::find(key)_(non-existent)/32 |
| std::unordered_map<int,_int>::find(key)_(non-existent)/8192 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(all_new_keys)/0 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(all_new_keys)/1024 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(all_new_keys)/32 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(all_new_keys)/8192 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(half_new_keys)/0 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(half_new_keys)/1024 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(half_new_keys)/32 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(half_new_keys)/8192 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_same_type)/0 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_same_type)/1024 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_same_type)/32 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_same_type)/8192 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_zip_view)/0 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_zip_view)/1024 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_zip_view)/32 |
| std::unordered_map<int,_int>::insert(iterator,_iterator)_(product_iterator_from_zip_view)/8192 |
| std::unordered_map<int,_int>::insert(value)_(already_present)/0 |
| std::unordered_map<int,_int>::insert(value)_(already_present)/1024 |
| std::unordered_map<int,_int>::insert(value)_(already_present)/32 |
| std::unordered_map<int,_int>::insert(value)_(already_present)/8192 |
| std::unordered_map<int,_int>::insert(value)_(new_value)/0 |
| std::unordered_map<int,_int>::insert(value)_(new_value)/1024 |
| std::unordered_map<int,_int>::insert(value)_(new_value)/32 |
| std::unordered_map<int,_int>::insert(value)_(new_value)/8192 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(already_present)/0 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(already_present)/1024 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(already_present)/32 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(already_present)/8192 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(new_value)/0 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(new_value)/1024 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(new_value)/32 |
| std::unordered_map<int,_int>::insert_or_assign(key,_value)_(new_value)/8192 |
| std::unordered_map<int,_int>::operator=(const&)_(into_cleared_Container)/0 |
| std::unordered_map<int,_int>::operator=(const&)_(into_cleared_Container)/1024 |
| std::unordered_map<int,_int>::operator=(const&)_(into_cleared_Container)/32 |
| std::unordered_map<int,_int>::operator=(const&)_(into_cleared_Container)/8192 |
| std::unordered_map<int,_int>::operator=(const&)_(into_partially_populated_Container)/0 |
| std::unordered_map<int,_int>::operator=(const&)_(into_partially_populated_Container)/1024 |
| std::unordered_map<int,_int>::operator=(const&)_(into_partially_populated_Container)/32 |
| std::unordered_map<int,_int>::operator=(const&)_(into_partially_populated_Container)/8192 |
| std::unordered_map<int,_int>::operator=(const&)_(into_populated_Container)/0 |
| std::unordered_map<int,_int>::operator=(const&)_(into_populated_Container)/1024 |
| std::unordered_map<int,_int>::operator=(const&)_(into_populated_Container)/32 |
| std::unordered_map<int,_int>::operator=(const&)_(into_populated_Container)/8192 |
Report Time: 0.88s