algebra/include/nil/crypto3/algebra/vector/math.hpp

Go to the documentation of this file.

//---------------------------------------------------------------------------//
// Copyright (c) 2020-2021 Mikhail Komarov <nemo@nil.foundation>
// Copyright (c) 2020-2021 Nikita Kaskov <nbering@nil.foundation>
// Copyright (c) 2020-2021 Ilias Khairullin <ilias@nil.foundation>
//
// MIT License
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//---------------------------------------------------------------------------//
 
#ifndef CRYPTO3_ALGEBRA_VECTOR_MATH_HPP
#define CRYPTO3_ALGEBRA_VECTOR_MATH_HPP
 
#include <nil/crypto3/algebra/vector/utility.hpp>
#include <nil/crypto3/algebra/vector/vector.hpp>
#include <nil/crypto3/algebra/scalar/math.hpp>
 
namespace nil {
    namespace crypto3 {
        namespace algebra {
 
            template<typename T, std::size_t N>
            constexpr vector<T, N> conj(const vector<T, N> &v) {
                return elementwise(algebra::conj<T>, v);
            }
 
            template<typename T, std::size_t N>
            constexpr vector<T, N> sqrt(const vector<T, N> &v) {
                return elementwise(static_cast<T (*)(T)>(sqrt), v);
            }
 
            template<typename T, std::size_t N>
            constexpr vector<nil::crypto3::detail::remove_complex_t<T>, N> real(const vector<T, N> &v) {
                return elementwise([](auto i) { return std::real(i); }, v);
            }
 
            template<typename T, std::size_t N>
            constexpr vector<nil::crypto3::detail::remove_complex_t<T>, N> imag(const vector<T, N> &v) {
                return elementwise([](auto i) { return std::imag(i); }, v);
            }
 
            template<typename T, std::size_t N>
            constexpr vector<nil::crypto3::detail::remove_complex_t<T>, N> abs(const vector<T, N> &v) {
                return elementwise(abs<T>, v);
            }
 
            template<typename T, std::size_t N>
            constexpr T dot(const vector<T, N> &a, const vector<T, N> &b) {
                T r = 0;
                for (std::size_t i = 0; i < vector<T, N>::size; ++i)
                    r += a[i] * conj(b[i]);
                return r;
            }
 
            template<typename T, std::size_t N>
            constexpr T sum(const vector<T, N> &v) {
                return accumulate(v, T(0), std::plus<T>());
            }
 
            template<typename T, std::size_t N>
            constexpr T min(const vector<T, N> &v) {
                return accumulate(v, v[0], [](T a, T b) { return std::min(a, b); });
            }
 
            template<typename T, std::size_t N>
            constexpr T max(const vector<T, N> &v) {
                return accumulate(v, v[0], [](T a, T b) { return std::max(a, b); });
            }
 
            template<typename T, std::size_t N>
            constexpr std::size_t min_index(const vector<T, N> &v) {
                T min = v[0];
                std::size_t index = 0;
                for (std::size_t i = 0; i < vector<T, N>::size; ++i)
                    if (v[i] < min) {
                        index = i;
                        min = v[i];
                    }
                return index;
            }
 
            template<typename T, std::size_t N>
            constexpr std::size_t max_index(const vector<T, N> &v) {
                T max = v[0];
                std::size_t index = 0;
                for (std::size_t i = 0; i < vector<T, N>::size; ++i)
                    if (v[i] > max) {
                        index = i;
                        max = v[i];
                    }
                return index;
            }
 
        }    // namespace algebra
    }        // namespace crypto3
}    // namespace nil
#endif    // CRYPTO3_ALGEBRA_VECTOR_MATH_HPP