EmbeddedProgramming/Helper/array_arithmetic.hpp at develop · XuhuaHuang/EmbeddedProgramming · GitHub

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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/**
 * @file array_arithmetic.hpp
 * @author Xuhua Huang
 * @brief
 * @version 0.1
 * @date 2023-04-03
 *
 * cmake -Bbuild -Wno-dev
 * cmake --build build
 *
 * @copyright ueg (c) 2023
 *
 */

#pragma once

#ifndef ARRAY_ARITHMETIC_HPP
#define ARRAY_ARITHMETIC_HPP

#include <array>
#include <iostream>

namespace helper {
namespace array_arithmetic {

template <typename T, std::size_t rows, std::size_t cols>
using mdarray = std::array<std::array<T, cols>, rows>;

template <typename T, std::size_t N>
    requires requires (T t) {
        { std::cout << t } -> std::convertible_to<std::ostream&>;
    }
[[nodiscard]]
inline std::ostream& operator<<(std::ostream& os, const std::array<T, N>& arr) {
    os << "[";
    for (typename std::array<T, N>::const_iterator it = arr.begin(); it != arr.end(); ++it) {
        os << *it;
        if (it != arr.end() - 1) [[likely]] {
            os << ", ";
        } else [[unlikely]] {
            continue;
        }
    }
    os << "]";
    return os;
}

template <typename T, std::size_t N>
    requires requires (T t) {
        { +t } -> std::convertible_to<T>;
    }
[[nodiscard]]
constexpr inline std::array<T, N> operator+(const std::array<T, N>& rhs) {
    /* NRVO variable */
    /// @brief Named Return Value Optimization
    std::array<T, N> ans = std::array<T, N>();
    for (std::size_t i = 0; i < N; ++i) {
        ans[i] = +rhs[i];
    }
    return ans;
}

template <typename T, std::size_t N>
    requires requires (T t) {
        { -t } -> std::convertible_to<T>;
    }
[[nodiscard]]
constexpr inline std::array<T, N> operator-(const std::array<T, N>& rhs) {
    std::array<T, N> ans = std::array<T, N>();
    for (std::size_t i = 0; i < N; ++i) {
        ans[i] = -rhs[i];
    }
    return ans;
}

template <typename T, std::size_t N>
    requires requires (T t) {
        { ~t } -> std::convertible_to<T>;
    }
[[nodiscard]]
constexpr inline std::array<T, N> operator~(const std::array<T, N>& rhs) {
    std::array<T, N> ans = std::array<T, N>();
    for (std::size_t i = 0; i < N; ++i) {
        ans[i] = ~rhs[i];
    }
    return ans;
}

template <typename T, std::size_t N>
    requires requires (T t) {
        { !t } -> std::convertible_to<bool>;
    }
[[nodiscard]]
constexpr inline std::array<bool, N> operator!(const std::array<T, N>& rhs) {
    std::array<bool, N> ans = std::array<T, N>();
    for (std::size_t i = 0; i < N; ++i) {
        ans[i] = !rhs[i];
    }
    return ans;
}

template<typename T, std::size_t N>
    requires requires (T lhs, T rhs) {
        {
            lhs += rhs
        } -> std::convertible_to<T>;
    }
inline std::array<T, N>& operator+=(std::array<T, N>& lhs, const T& rhs)
{
    for (std::size_t i = 0; i < N; ++i)
    {
        lhs[i] += rhs;
    }
    return lhs;
}

template<typename T, std::size_t N>
    requires requires (T lhs, T rhs) {
        {
            lhs += rhs
        } -> std::convertible_to<T>;
    }
inline std::array<T, N>& operator+=(std::array<T, N>& lhs, const std::array<T, N>& rhs)
{
    for (std::size_t i = 0; i < N; ++i)
    {
        lhs[i] += rhs[i];
    }
    return lhs;
}

} // namespace array_arithmetic
} // namespace helper

#endif // !ARRAY_ARITHMETIC_HPP