Compile time sort and lookup example

finder.cpp

#include <array>
#include <algorithm>
#include <string_view>

// From https://medium.com/@vgasparyan1995/compile-time-merge-sort-c-bb0ace62cc23
constexpr auto sort(const auto& arr)
{
    auto result = arr;
    auto sortless = [](auto const& a, auto const& b) { return a.first < b.first; };
    std::sort(std::begin(result), std::end(result), sortless);
    return result;
}

bool IsAppInAllowedList(std::wstring_view shortcut, std::wstring_view appid)
{
    constexpr static std::array<std::pair<std::wstring_view, std::wstring_view>, 3> const arr{{
        { L"foo", L"bar" },
        { L"zot", L"quux" },
        { L"fleep", L"moo" },
    }};
    constexpr static auto const sorted = sort(arr);
    auto findless = [](auto const& a, auto const& b) { return a.first < b; };
    auto i = std::lower_bound(std::begin(sorted), std::end(sorted), shortcut, findless);
    return i != std::end(sorted) && (i->first == shortcut);
}

bool quack() {
    return IsAppInAllowedList(L"fleep", L"");
}

bool moo() {
    return IsAppInAllowedList(L"moo", L"kitten");
}

See also https://godbolt.org/z/GexK1nKzc