问std：：map:find的效率与值的数据大小有关吗？

EN

#include <iostream>
#include <map>
#include <windows.h>
using namespace std;

template <int DimT>
struct Value
{
    char Data[DimT];
};

typedef Value<10000> Value10k;
typedef Value<2000> Value2k;


long long Counter() 
{
    LARGE_INTEGER li;
    QueryPerformanceCounter(&li);
    return li.QuadPart;
}

long long Frequency() 
{
    LARGE_INTEGER li;
    QueryPerformanceFrequency(&li);
    return li.QuadPart;
}

void PrintTime(const long long start, const long long finish, const char * const msg)
{
    cout << msg << ": " << (finish - start) * 1000.0 / Frequency() << " ms\n";
}

bool IsEven(int n)
{
    return (n % 2) == 0;
}

int main() 
{
    map<pair<int, int>, Value10k> m1;
    m1[make_pair(0, 0)] = Value10k{};
    m1[make_pair(0, 1)] = Value10k{};
    m1[make_pair(1, 0)] = Value10k{};
    m1[make_pair(1, 1)] = Value10k{};

    constexpr int searchCount = 40000;

    auto start = Counter();
    for (int i = 0; i < searchCount; i++)
    {
        int x{};
        int y{};
        if (IsEven(i))
        {
            x = 0;
            y = 1;
        }
        else
        {
            x = 1;
            y = 0;
        }
        auto search = m1.find(make_pair(x, y));
    }
    auto finish = Counter();
    PrintTime(start, finish, "Value10k");


    map<pair<int, int>, Value2k> m2;
    m2[make_pair(0, 0)] = Value2k{};
    m2[make_pair(0, 1)] = Value2k{};
    m2[make_pair(1, 0)] = Value2k{};
    m2[make_pair(1, 1)] = Value2k{};

    start = Counter();
    for (int i = 0; i < searchCount; i++)
    {
        int x{};
        int y{};
        if (IsEven(i))
        {
            x = 0;
            y = 1;
        }
        else
        {
            x = 1;
            y = 0;
        }
        auto search = m2.find(make_pair(x, y));
    }
    finish = Counter();
    PrintTime(start, finish, "Value2k");
}