mapped_functions.hpp

#include "./concepts.hpp"
#include "./map.hpp"
#include "./traits.hpp"
#include <algorithm>
#include <cmath>
#include <complex>
#include <utility>

Detailed Description

Provides some custom implementations of standard mathematical functions used for lazy, coefficient-wise array operations.

Definition in file mapped_functions.hpp.

Go to the source code of this file.

Functions
template<ArrayOrScalar A>
decltype(auto)	nda::conj (A &&a)
	Function conj for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types with a complex value type).
template<ArrayOrScalar A, ArrayOrScalar B> requires (((Scalar<A> && Scalar<B>) || (Array<A> && Array<B> && get_rank<A> == get_rank<B>)) && !is_complex_v<get_value_t<A>> && !is_complex_v<get_value_t<B>>)
auto	nda::max (A &&a, B &&b)
	Function max for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).
template<ArrayOrScalar A, ArrayOrScalar B> requires (((Scalar<A> && Scalar<B>) || (Array<A> && Array<B> && get_rank<A> == get_rank<B>)) && !is_complex_v<get_value_t<A>> && !is_complex_v<get_value_t<B>>)
auto	nda::min (A &&a, B &&b)
	Function min for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).
template<ArrayOrScalar A>
auto	nda::pow (A &&a, double p)
	Function pow for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).
template<ArrayOrScalar A>
auto	nda::reciprocal (A &&a)
	Reciprocal function for nda::ArrayOrScalar types (lazy and coefficient-wise for nda::Array types).