1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/*
* Copyright (C) 2022-2025 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#pragma once
#include "shared/source/helpers/debug_helpers.h"
#include <array>
#include <optional>
#include <utility>
template <typename KeyT, typename ValueT, size_t numElements>
struct LookupArray {
using LookupMapArrayT = std::array<std::pair<KeyT, ValueT>, numElements>;
constexpr LookupArray(const LookupMapArrayT &lookupArray) : lookupArray(lookupArray){};
constexpr std::optional<ValueT> find(const KeyT &keyToFind) const {
for (auto &[key, value] : lookupArray) {
if (keyToFind == key) {
return value;
}
}
return std::nullopt;
}
constexpr std::optional<ValueT> findGreaterEqual(const KeyT &keyToFind) const {
for (auto &[key, value] : lookupArray) {
if (key >= keyToFind) {
return value;
}
}
return std::nullopt;
}
constexpr ValueT lookUp(const KeyT &keyToFind) const {
auto value = find(keyToFind);
UNRECOVERABLE_IF(false == value.has_value());
return *value;
}
constexpr ValueT lookUpGreaterEqual(const KeyT &keyToFind) const {
auto value = findGreaterEqual(keyToFind);
UNRECOVERABLE_IF(false == value.has_value());
return *value;
}
constexpr size_t size() const {
return numElements;
}
protected:
LookupMapArrayT lookupArray;
};
|
