diff --git a/docs/doxygen/html/_boost_numpy_ndarray_helper_8hpp_source.html b/docs/doxygen/html/_boost_numpy_ndarray_helper_8hpp_source.html index c95023c7c..d48b24b37 100644 --- a/docs/doxygen/html/_boost_numpy_ndarray_helper_8hpp_source.html +++ b/docs/doxygen/html/_boost_numpy_ndarray_helper_8hpp_source.html @@ -346,7 +346,7 @@
339 #endif // #if defined(NUMCPP_INCLUDE_BOOST_PYTHON_INTERFACE) && !defined(NUMCPP_NO_USE_BOOST)
StlAlgorithms.hpp
Types.hpp
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:143
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:142
nc::utils::num2str
std::string num2str(dtype inNumber)
Definition: num2str.hpp:46
nc
Definition: Coordinate.hpp:45
nc::astype
NdArray< dtypeOut > astype(const NdArray< dtype > inArray)
Definition: astype.hpp:45
diff --git a/docs/doxygen/html/_cluster_8hpp_source.html b/docs/doxygen/html/_cluster_8hpp_source.html index f8a1177b2..ff079f631 100644 --- a/docs/doxygen/html/_cluster_8hpp_source.html +++ b/docs/doxygen/html/_cluster_8hpp_source.html @@ -379,8 +379,8 @@
nc::imageProcessing::Pixel::col
uint32 col
Definition: Pixel.hpp:55
nc::imageProcessing::Pixel::row
uint32 row
Definition: Pixel.hpp:54
nc::imageProcessing::Pixel::str
std::string str() const
Definition: Pixel.hpp:136
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:143
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:142
nc::utils::num2str
std::string num2str(dtype inNumber)
Definition: num2str.hpp:46
nc
Definition: Coordinate.hpp:45
nc::max
NdArray< dtype > max(const NdArray< dtype > &inArray, Axis inAxis=Axis::NONE)
Definition: max.hpp:44
diff --git a/docs/doxygen/html/_cluster_maker_8hpp_source.html b/docs/doxygen/html/_cluster_maker_8hpp_source.html index a46cb4cde..a4faf0014 100644 --- a/docs/doxygen/html/_cluster_maker_8hpp_source.html +++ b/docs/doxygen/html/_cluster_maker_8hpp_source.html @@ -405,7 +405,7 @@
nc::imageProcessing::ClusterMaker::size
uint32 size() noexcept
Definition: ClusterMaker.hpp:111
nc::imageProcessing::ClusterMaker::operator[]
const Cluster< dtype > & operator[](uint32 inIndex) const noexcept
Definition: ClusterMaker.hpp:124
nc::imageProcessing::Pixel
Holds the information for a single pixel.
Definition: Pixel.hpp:47
-
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:208
+
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:207
nc
Definition: Coordinate.hpp:45
nc::min
NdArray< dtype > min(const NdArray< dtype > &inArray, Axis inAxis=Axis::NONE)
Definition: min.hpp:44
nc::int32
std::int32_t int32
Definition: Types.hpp:36
diff --git a/docs/doxygen/html/_functions_2cube_8hpp_source.html b/docs/doxygen/html/_functions_2cube_8hpp_source.html index 683e9c8e2..74bf0fb62 100644 --- a/docs/doxygen/html/_functions_2cube_8hpp_source.html +++ b/docs/doxygen/html/_functions_2cube_8hpp_source.html @@ -149,7 +149,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc::utils::cube
constexpr dtype cube(dtype inValue) noexcept
Definition: Utils/cube.hpp:44
nc
Definition: Coordinate.hpp:45
nc::cube
constexpr dtype cube(dtype inValue) noexcept
Definition: Functions/cube.hpp:45
diff --git a/docs/doxygen/html/_functions_2power_8hpp_source.html b/docs/doxygen/html/_functions_2power_8hpp_source.html index a199f7a39..cb8a690ce 100644 --- a/docs/doxygen/html/_functions_2power_8hpp_source.html +++ b/docs/doxygen/html/_functions_2power_8hpp_source.html @@ -175,7 +175,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc::utils::power
dtype power(dtype inValue, uint8 inPower) noexcept
Definition: Utils/power.hpp:48
nc
Definition: Coordinate.hpp:45
nc::power
constexpr dtype power(dtype inValue, uint8 inExponent) noexcept
Definition: Functions/power.hpp:52
diff --git a/docs/doxygen/html/_functions_2powerf_8hpp_source.html b/docs/doxygen/html/_functions_2powerf_8hpp_source.html index 31c283393..1c974a7a1 100644 --- a/docs/doxygen/html/_functions_2powerf_8hpp_source.html +++ b/docs/doxygen/html/_functions_2powerf_8hpp_source.html @@ -175,7 +175,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc::utils::powerf
auto powerf(dtype1 inValue, const dtype2 inPower) noexcept
Definition: Utils/powerf.hpp:49
nc
Definition: Coordinate.hpp:45
nc::powerf
auto powerf(dtype1 inValue, dtype2 inExponent) noexcept
Definition: Functions/powerf.hpp:52
diff --git a/docs/doxygen/html/_nd_array_core_8hpp_source.html b/docs/doxygen/html/_nd_array_core_8hpp_source.html index 5deccce67..25e3e40f0 100644 --- a/docs/doxygen/html/_nd_array_core_8hpp_source.html +++ b/docs/doxygen/html/_nd_array_core_8hpp_source.html @@ -3957,23 +3957,23 @@
nc::endian::isLittleEndian
bool isLittleEndian() noexcept
Definition: Endian.hpp:44
nc::endian::byteSwap
dtype byteSwap(dtype value) noexcept
Definition: Endian.hpp:63
nc::random::detail::f
dtype f(GeneratorType &generator, dtype inDofN, dtype inDofD)
Definition: f.hpp:58
-
nc::stl_algorithms::any_of
bool any_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:79
-
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:706
-
nc::stl_algorithms::none_of
bool none_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:409
-
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:288
-
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:744
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
-
nc::stl_algorithms::all_of
bool all_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:58
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
-
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:208
-
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:836
-
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:367
-
nc::stl_algorithms::replace
void replace(ForwardIt first, ForwardIt last, const T &oldValue, const T &newValue) noexcept
Definition: StlAlgorithms.hpp:472
-
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:248
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
-
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:429
-
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:327
-
nc::stl_algorithms::fill
void fill(ForwardIt first, ForwardIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:186
+
nc::stl_algorithms::any_of
bool any_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:78
+
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:705
+
nc::stl_algorithms::none_of
bool none_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:408
+
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:287
+
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:743
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
+
nc::stl_algorithms::all_of
bool all_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:57
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
+
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:207
+
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:835
+
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:366
+
nc::stl_algorithms::replace
void replace(ForwardIt first, ForwardIt last, const T &oldValue, const T &newValue) noexcept
Definition: StlAlgorithms.hpp:471
+
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:247
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
+
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:428
+
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:326
+
nc::stl_algorithms::fill
void fill(ForwardIt first, ForwardIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:185
nc::utils::num2str
std::string num2str(dtype inNumber)
Definition: num2str.hpp:46
nc::utils::power
dtype power(dtype inValue, uint8 inPower) noexcept
Definition: Utils/power.hpp:48
nc::utils::value2str
std::string value2str(dtype inValue)
Definition: value2str.hpp:48
diff --git a/docs/doxygen/html/_nd_array_operators_8hpp_source.html b/docs/doxygen/html/_nd_array_operators_8hpp_source.html index 2b0dfb682..f919f29f1 100644 --- a/docs/doxygen/html/_nd_array_operators_8hpp_source.html +++ b/docs/doxygen/html/_nd_array_operators_8hpp_source.html @@ -1786,8 +1786,8 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
complex.hpp
essentiallyEqual.hpp
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc::utils::essentiallyEqual
bool essentiallyEqual(dtype inValue1, dtype inValue2) noexcept
Definition: essentiallyEqual.hpp:51
nc
Definition: Coordinate.hpp:45
nc::operator&
NdArray< dtype > operator&(const NdArray< dtype > &lhs, const NdArray< dtype > &rhs)
Definition: NdArrayOperators.hpp:1487
diff --git a/docs/doxygen/html/_poly1d_8hpp_source.html b/docs/doxygen/html/_poly1d_8hpp_source.html index adb7b4f2f..936f3ffd4 100644 --- a/docs/doxygen/html/_poly1d_8hpp_source.html +++ b/docs/doxygen/html/_poly1d_8hpp_source.html @@ -641,8 +641,8 @@
essentiallyEqual.hpp
inv.hpp
nc::linalg::inv
NdArray< double > inv(const NdArray< dtype > &inArray)
Definition: inv.hpp:56
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
nc::utils::num2str
std::string num2str(dtype inNumber)
Definition: num2str.hpp:46
nc::utils::power
dtype power(dtype inValue, uint8 inPower) noexcept
Definition: Utils/power.hpp:48
nc::utils::essentiallyEqual
bool essentiallyEqual(dtype inValue1, dtype inValue2) noexcept
Definition: essentiallyEqual.hpp:51
diff --git a/docs/doxygen/html/_quaternion_8hpp_source.html b/docs/doxygen/html/_quaternion_8hpp_source.html index a1a0ec114..d8a78a496 100644 --- a/docs/doxygen/html/_quaternion_8hpp_source.html +++ b/docs/doxygen/html/_quaternion_8hpp_source.html @@ -857,10 +857,10 @@
dot.hpp
essentiallyEqual.hpp
hat.hpp
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:143
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:142
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
nc::utils::num2str
std::string num2str(dtype inNumber)
Definition: num2str.hpp:46
nc::utils::essentiallyEqual
bool essentiallyEqual(dtype inValue1, dtype inValue2) noexcept
Definition: essentiallyEqual.hpp:51
nc::utils::sqr
constexpr dtype sqr(dtype inValue) noexcept
Definition: sqr.hpp:44
diff --git a/docs/doxygen/html/_r_n_g_8hpp_source.html b/docs/doxygen/html/_r_n_g_8hpp_source.html index 970e1a588..760ef57bd 100644 --- a/docs/doxygen/html/_r_n_g_8hpp_source.html +++ b/docs/doxygen/html/_r_n_g_8hpp_source.html @@ -157,7 +157,7 @@
81 
82  //============================================================================
83  // Method Description:
-
88  RNG(int seed) :
+
88  explicit RNG(int seed) :
89  generator_(seed){};
90 
91  //============================================================================
diff --git a/docs/doxygen/html/_random_2bernoulli_8hpp_source.html b/docs/doxygen/html/_random_2bernoulli_8hpp_source.html index 1bccc5ad1..661c1fa8c 100644 --- a/docs/doxygen/html/_random_2bernoulli_8hpp_source.html +++ b/docs/doxygen/html/_random_2bernoulli_8hpp_source.html @@ -188,7 +188,7 @@
nc::random::detail::bernoulli
bool bernoulli(GeneratorType &generator, double inP=0.5)
Definition: Random/bernoulli.hpp:55
nc::random::bernoulli
bool bernoulli(double inP=0.5)
Definition: Random/bernoulli.hpp:103
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_random_2beta_8hpp_source.html b/docs/doxygen/html/_random_2beta_8hpp_source.html index 251339343..a395c0595 100644 --- a/docs/doxygen/html/_random_2beta_8hpp_source.html +++ b/docs/doxygen/html/_random_2beta_8hpp_source.html @@ -210,7 +210,7 @@
nc::random::detail::beta
dtype beta(GeneratorType &generator, dtype inAlpha, dtype inBeta)
Definition: Random/beta.hpp:63
nc::random::beta
dtype beta(dtype inAlpha, dtype inBeta)
Definition: Random/beta.hpp:136
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_random_2gamma_8hpp_source.html b/docs/doxygen/html/_random_2gamma_8hpp_source.html index 623a5b4a3..12eb925d0 100644 --- a/docs/doxygen/html/_random_2gamma_8hpp_source.html +++ b/docs/doxygen/html/_random_2gamma_8hpp_source.html @@ -206,7 +206,7 @@
nc::random::detail::gamma
dtype gamma(GeneratorType &generator, dtype inGammaShape, dtype inScaleValue=1)
Definition: Random/gamma.hpp:59
nc::random::gamma
dtype gamma(dtype inGammaShape, dtype inScaleValue=1)
Definition: Random/gamma.hpp:131
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_random_2laplace_8hpp_source.html b/docs/doxygen/html/_random_2laplace_8hpp_source.html index c5f52b8b7..dab7dd26e 100644 --- a/docs/doxygen/html/_random_2laplace_8hpp_source.html +++ b/docs/doxygen/html/_random_2laplace_8hpp_source.html @@ -186,7 +186,7 @@
nc::random::detail::laplace
dtype laplace(GeneratorType &generator, dtype inLoc=0, dtype inScale=1)
Definition: Random/laplace.hpp:61
nc::random::laplace
dtype laplace(dtype inLoc=0, dtype inScale=1)
Definition: Random/laplace.hpp:114
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_special_2bernoulli_8hpp_source.html b/docs/doxygen/html/_special_2bernoulli_8hpp_source.html index 98601bc19..e6b04ba79 100644 --- a/docs/doxygen/html/_special_2bernoulli_8hpp_source.html +++ b/docs/doxygen/html/_special_2bernoulli_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bernoilli
double bernoilli(uint32 n)
Definition: Special/bernoulli.hpp:50
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::uint32
std::uint32_t uint32
Definition: Types.hpp:40
diff --git a/docs/doxygen/html/_special_2beta_8hpp_source.html b/docs/doxygen/html/_special_2beta_8hpp_source.html index da40a9218..188e316e8 100644 --- a/docs/doxygen/html/_special_2beta_8hpp_source.html +++ b/docs/doxygen/html/_special_2beta_8hpp_source.html @@ -172,7 +172,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::beta
auto beta(dtype1 a, dtype2 b)
Definition: Special/beta.hpp:59
nc::special::beta
auto beta(const NdArray< dtype1 > &inArrayA, const NdArray< dtype2 > &inArrayB)
Definition: Special/beta.hpp:82
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_special_2gamma_8hpp_source.html b/docs/doxygen/html/_special_2gamma_8hpp_source.html index 1a42475a4..cbd62613a 100644 --- a/docs/doxygen/html/_special_2gamma_8hpp_source.html +++ b/docs/doxygen/html/_special_2gamma_8hpp_source.html @@ -159,7 +159,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::gamma
auto gamma(dtype inValue)
Definition: Special/gamma.hpp:51
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/_stl_algorithms_8hpp.html b/docs/doxygen/html/_stl_algorithms_8hpp.html index a8d8fc60e..419160eb1 100644 --- a/docs/doxygen/html/_stl_algorithms_8hpp.html +++ b/docs/doxygen/html/_stl_algorithms_8hpp.html @@ -114,7 +114,6 @@ #include <iterator>
#include <numeric>
#include <utility>
-#include <version>

Go to the source code of this file.

diff --git a/docs/doxygen/html/_stl_algorithms_8hpp_source.html b/docs/doxygen/html/_stl_algorithms_8hpp_source.html index 3718b5b41..c282bd7f6 100644 --- a/docs/doxygen/html/_stl_algorithms_8hpp_source.html +++ b/docs/doxygen/html/_stl_algorithms_8hpp_source.html @@ -112,622 +112,621 @@
31 #include <iterator>
32 #include <numeric>
33 #include <utility>
-
34 #include <version>
-
35 
-
36 #if defined(__cpp_lib_execution) && defined(__cpp_lib_parallel_algorithm) && defined(NUMCPP_USE_MULTITHREAD)
-
37 #define PARALLEL_ALGORITHMS_SUPPORTED
-
38 #define CONDITIONAL_NO_EXCEPT
-
39 #include <execution>
-
40 #else
-
41 #define CONDITIONAL_NO_EXCEPT noexcept
-
42 #endif
-
43 
-
44 namespace nc
-
45 {
-
46  namespace stl_algorithms
-
47  {
-
48  //============================================================================
-
49  // Method Description:
-
57  template<class InputIt, class UnaryPredicate>
-
58  bool all_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
-
59  {
-
60  return std::all_of(
-
61 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
62  std::execution::par_unseq,
-
63 #endif
-
64  first,
-
65  last,
-
66  p);
-
67  }
-
68 
-
69  //============================================================================
-
70  // Method Description:
-
78  template<class InputIt, class UnaryPredicate>
-
79  bool any_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
-
80  {
-
81  return std::any_of(
-
82 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
83  std::execution::par_unseq,
-
84 #endif
-
85  first,
-
86  last,
-
87  p);
-
88  }
-
89 
-
90  //============================================================================
-
91  // Method Description:
-
99  template<class InputIt, class OutputIt>
-
100  OutputIt copy(InputIt first, InputIt last, OutputIt destination) CONDITIONAL_NO_EXCEPT
-
101  {
-
102  return std::copy(
-
103 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
104  std::execution::par_unseq,
-
105 #endif
-
106  first,
-
107  last,
-
108  destination);
-
109  }
-
110 
-
111  //============================================================================
-
112  // Method Description:
-
120  template<class InputIt, class T>
-
121  typename std::iterator_traits<InputIt>::difference_type
-
122  count(InputIt first, InputIt last, const T& value) CONDITIONAL_NO_EXCEPT
-
123  {
-
124  return std::count(
-
125 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
126  std::execution::par_unseq,
-
127 #endif
-
128  first,
-
129  last,
-
130  value);
-
131  }
-
132 
-
133  //============================================================================
-
134  // Method Description:
-
142  template<class InputIt1, class InputIt2>
-
143  bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) CONDITIONAL_NO_EXCEPT
-
144  {
-
145  return std::equal(
-
146 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
147  std::execution::par_unseq,
-
148 #endif
-
149  first1,
-
150  last1,
-
151  first2);
-
152  }
-
153 
-
154  //============================================================================
-
155  // Method Description:
-
164  template<class InputIt1, class InputIt2, class BinaryPredicate>
-
165  bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) CONDITIONAL_NO_EXCEPT
-
166  {
-
167  return std::equal(
-
168 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
169  std::execution::par_unseq,
-
170 #endif
-
171  first1,
-
172  last1,
-
173  first2,
-
174  p);
-
175  }
-
176 
-
177  //============================================================================
-
178  // Method Description:
-
185  template<class ForwardIt, class T>
-
186  void fill(ForwardIt first, ForwardIt last, const T& value) CONDITIONAL_NO_EXCEPT
-
187  {
-
188  return std::fill(
-
189 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
190  std::execution::par_unseq,
-
191 #endif
-
192  first,
-
193  last,
-
194  value);
-
195  }
-
196 
-
197  //============================================================================
-
198  // Method Description:
-
207  template<class InputIt, class T>
-
208  InputIt find(InputIt first, InputIt last, const T& value) CONDITIONAL_NO_EXCEPT
-
209  {
-
210  return std::find(
-
211 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
212  std::execution::par_unseq,
-
213 #endif
-
214  first,
-
215  last,
-
216  value);
-
217  }
-
218 
-
219  //============================================================================
-
220  // Method Description:
-
227  template<class InputIt, class UnaryFunction>
-
228  void for_each(InputIt first, InputIt last, UnaryFunction f)
-
229  {
-
230  std::for_each(
-
231 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
232  std::execution::par_unseq,
-
233 #endif
-
234  first,
-
235  last,
-
236  f);
-
237  }
-
238 
-
239  //============================================================================
-
240  // Method Description:
-
247  template<class ForwardIt>
-
248  bool is_sorted(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
-
249  {
-
250  return std::is_sorted(
-
251 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
252  std::execution::par_unseq,
-
253 #endif
-
254  first,
-
255  last);
-
256  }
-
257 
-
258  //============================================================================
-
259  // Method Description:
-
267  template<class ForwardIt, class Compare>
-
268  bool is_sorted(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
269  {
-
270  return std::is_sorted(
-
271 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
272  std::execution::par_unseq,
-
273 #endif
-
274  first,
-
275  last,
-
276  comp);
-
277  }
-
278 
-
279  //============================================================================
-
280  // Method Description:
-
287  template<class ForwardIt>
-
288  ForwardIt max_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
-
289  {
-
290  return std::max_element(
-
291 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
292  std::execution::par_unseq,
-
293 #endif
-
294  first,
-
295  last);
-
296  }
-
297 
-
298  //============================================================================
-
299  // Method Description:
-
307  template<class ForwardIt, class Compare>
-
308  ForwardIt max_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
309  {
-
310  return std::max_element(
-
311 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
312  std::execution::par_unseq,
-
313 #endif
-
314  first,
-
315  last,
-
316  comp);
-
317  }
-
318 
-
319  //============================================================================
-
320  // Method Description:
-
326  template<class ForwardIt>
-
327  ForwardIt min_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
-
328  {
-
329  return std::min_element(
-
330 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
331  std::execution::par_unseq,
-
332 #endif
-
333  first,
-
334  last);
-
335  }
-
336 
-
337  //============================================================================
-
338  // Method Description:
-
346  template<class ForwardIt, class Compare>
-
347  ForwardIt min_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
348  {
-
349  return std::min_element(
-
350 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
351  std::execution::par_unseq,
-
352 #endif
-
353  first,
-
354  last,
-
355  comp);
-
356  }
-
357 
-
358  //============================================================================
-
359  // Method Description:
-
366  template<class ForwardIt>
-
367  std::pair<ForwardIt, ForwardIt> minmax_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
-
368  {
-
369  return std::minmax_element(
-
370 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
371  std::execution::par_unseq,
-
372 #endif
-
373  first,
-
374  last);
-
375  }
-
376 
-
377  //============================================================================
-
378  // Method Description:
-
386  template<class ForwardIt, class Compare>
-
387  std::pair<ForwardIt, ForwardIt>
-
388  minmax_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
389  {
-
390  return std::minmax_element(
-
391 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
392  std::execution::par_unseq,
-
393 #endif
-
394  first,
-
395  last,
-
396  comp);
-
397  }
-
398 
-
399  //============================================================================
-
400  // Method Description:
-
408  template<class InputIt, class UnaryPredicate>
-
409  bool none_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
-
410  {
-
411  return std::none_of(
-
412 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
413  std::execution::par_unseq,
-
414 #endif
-
415  first,
-
416  last,
-
417  p);
-
418  }
-
419 
-
420  //============================================================================
-
421  // Method Description:
-
428  template<class RandomIt>
-
429  void nth_element(RandomIt first, RandomIt nth, RandomIt last) CONDITIONAL_NO_EXCEPT
-
430  {
-
431  std::nth_element(
-
432 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
433  std::execution::par_unseq,
-
434 #endif
-
435  first,
-
436  nth,
-
437  last);
-
438  }
-
439 
-
440  //============================================================================
-
441  // Method Description:
-
449  template<class RandomIt, class Compare>
-
450  void nth_element(RandomIt first, RandomIt nth, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
451  {
-
452  std::nth_element(
-
453 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
454  std::execution::par_unseq,
-
455 #endif
-
456  first,
-
457  nth,
-
458  last,
-
459  comp);
-
460  }
-
461 
-
462  //============================================================================
-
463  // Method Description:
-
471  template<class ForwardIt, class T>
-
472  void replace(ForwardIt first, ForwardIt last, const T& oldValue, const T& newValue) CONDITIONAL_NO_EXCEPT
-
473  {
-
474  std::replace(
-
475 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
476  std::execution::par_unseq,
-
477 #endif
-
478  first,
-
479  last,
-
480  oldValue,
-
481  newValue);
-
482  }
-
483 
-
484  //============================================================================
-
485  // Method Description:
-
491  template<class BidirIt>
-
492  void reverse(BidirIt first, BidirIt last) CONDITIONAL_NO_EXCEPT
-
493  {
-
494  std::reverse(
-
495 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
496  std::execution::par_unseq,
-
497 #endif
-
498  first,
-
499  last);
-
500  }
-
501 
-
502  //============================================================================
-
503  // Method Description:
-
510  template<class ForwardIt>
-
511  void rotate(ForwardIt first, ForwardIt firstN, ForwardIt last) CONDITIONAL_NO_EXCEPT
-
512  {
-
513  std::rotate(
-
514 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
515  std::execution::par_unseq,
-
516 #endif
-
517  first,
-
518  firstN,
-
519  last);
-
520  }
-
521 
-
522  //============================================================================
-
523  // Method Description:
-
533  template<class InputIt1, class InputIt2, class OutputIt>
-
534  OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
-
535  {
-
536  return std::set_difference(
-
537 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
538  std::execution::par_unseq,
-
539 #endif
-
540  first1,
-
541  last1,
-
542  first2,
-
543  last2,
-
544  destination);
-
545  }
-
546 
-
547  //============================================================================
-
548  // Method Description:
-
559  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
-
560  OutputIt set_difference(InputIt1 first1,
-
561  InputIt1 last1,
-
562  InputIt2 first2,
-
563  InputIt2 last2,
-
564  OutputIt destination,
-
565  Compare comp) CONDITIONAL_NO_EXCEPT
-
566  {
-
567  return std::set_difference(
-
568 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
569  std::execution::par_unseq,
-
570 #endif
-
571  first1,
-
572  last1,
-
573  first2,
-
574  last2,
-
575  destination,
-
576  comp);
-
577  }
-
578 
-
579  //============================================================================
-
580  // Method Description:
-
590  template<class InputIt1, class InputIt2, class OutputIt>
-
591  OutputIt set_intersection(InputIt1 first1,
-
592  InputIt1 last1,
-
593  InputIt2 first2,
-
594  InputIt2 last2,
-
595  OutputIt destination) CONDITIONAL_NO_EXCEPT
-
596  {
-
597  return std::set_intersection(
-
598 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
599  std::execution::par_unseq,
-
600 #endif
-
601  first1,
-
602  last1,
-
603  first2,
-
604  last2,
-
605  destination);
-
606  }
-
607 
-
608  //============================================================================
-
609  // Method Description:
-
620  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
-
621  OutputIt set_intersection(InputIt1 first1,
-
622  InputIt1 last1,
-
623  InputIt2 first2,
-
624  InputIt2 last2,
-
625  OutputIt destination,
-
626  Compare comp) CONDITIONAL_NO_EXCEPT
-
627  {
-
628  return std::set_intersection(
-
629 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
630  std::execution::par_unseq,
-
631 #endif
-
632  first1,
-
633  last1,
-
634  first2,
-
635  last2,
-
636  destination,
-
637  comp);
-
638  }
-
639 
-
640  //============================================================================
-
641  // Method Description:
-
651  template<class InputIt1, class InputIt2, class OutputIt>
-
652  OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
-
653  CONDITIONAL_NO_EXCEPT
-
654  {
-
655  return std::set_union(
-
656 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
657  std::execution::par_unseq,
-
658 #endif
-
659  first1,
-
660  last1,
-
661  first2,
-
662  last2,
-
663  destination);
-
664  }
-
665 
-
666  //============================================================================
-
667  // Method Description:
-
678  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
-
679  OutputIt set_union(InputIt1 first1,
-
680  InputIt1 last1,
-
681  InputIt2 first2,
-
682  InputIt2 last2,
-
683  OutputIt destination,
-
684  Compare comp) CONDITIONAL_NO_EXCEPT
-
685  {
-
686  return std::set_union(
-
687 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
688  std::execution::par_unseq,
-
689 #endif
-
690  first1,
-
691  last1,
-
692  first2,
-
693  last2,
-
694  destination,
-
695  comp);
-
696  }
-
697 
-
698  //============================================================================
-
699  // Method Description:
-
705  template<class RandomIt>
-
706  void sort(RandomIt first, RandomIt last) CONDITIONAL_NO_EXCEPT
-
707  {
-
708  return std::sort(
-
709 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
710  std::execution::par_unseq,
-
711 #endif
-
712  first,
-
713  last);
-
714  }
-
715 
-
716  //============================================================================
-
717  // Method Description:
-
724  template<class RandomIt, class Compare>
-
725  void sort(RandomIt first, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
726  {
-
727  return std::sort(
-
728 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
729  std::execution::par_unseq,
-
730 #endif
-
731  first,
-
732  last,
-
733  comp);
-
734  }
-
735 
-
736  //============================================================================
-
737  // Method Description:
-
743  template<class RandomIt>
-
744  void stable_sort(RandomIt first, RandomIt last) CONDITIONAL_NO_EXCEPT
-
745  {
-
746  std::stable_sort(
-
747 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
748  std::execution::par_unseq,
-
749 #endif
-
750  first,
-
751  last);
-
752  }
-
753 
-
754  //============================================================================
-
755  // Method Description:
-
762  template<class RandomIt, class Compare>
-
763  void stable_sort(RandomIt first, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
-
764  {
-
765  std::stable_sort(
-
766 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
767  std::execution::par_unseq,
-
768 #endif
-
769  first,
-
770  last,
-
771  comp);
-
772  }
-
773 
-
774  //============================================================================
-
775  // Method Description:
-
784  template<class InputIt, class OutputIt, class UnaryOperation>
-
785  OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
-
786  {
-
787  return std::transform(
-
788 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
789  std::execution::par_unseq,
-
790 #endif
-
791  first,
-
792  last,
-
793  destination,
-
794  unaryFunction);
-
795  }
-
796 
-
797  //============================================================================
-
798  // Method Description:
-
808  template<class InputIt1, class InputIt2, class OutputIt, class BinaryOperation>
-
809  OutputIt transform(InputIt1 first1,
-
810  InputIt1 last1,
-
811  InputIt2 first2,
-
812  OutputIt destination,
-
813  BinaryOperation unaryFunction)
-
814  {
-
815  return std::transform(
-
816 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
817  std::execution::par_unseq,
-
818 #endif
-
819  first1,
-
820  last1,
-
821  first2,
-
822  destination,
-
823  unaryFunction);
-
824  }
-
825 
-
826  //============================================================================
-
827  // Method Description:
-
835  template<class InputIt, class OutputIt>
-
836  constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) CONDITIONAL_NO_EXCEPT
-
837  {
-
838  return std::unique_copy(
-
839 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
840  std::execution::par_unseq,
-
841 #endif
-
842  first,
-
843  last,
-
844  destination);
-
845  }
-
846 
-
847  //============================================================================
-
848  // Method Description:
-
857  template<class InputIt, class OutputIt, class BinaryPredicate>
-
858  constexpr OutputIt unique_copy(InputIt first,
-
859  InputIt last,
-
860  OutputIt destination,
-
861  BinaryPredicate binaryFunction) CONDITIONAL_NO_EXCEPT
-
862  {
-
863  return std::unique_copy(
-
864 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
-
865  std::execution::par_unseq,
-
866 #endif
-
867  first,
-
868  last,
-
869  destination,
-
870  binaryFunction);
-
871  }
-
872  } // namespace stl_algorithms
-
873 } // namespace nc
-
CONDITIONAL_NO_EXCEPT
#define CONDITIONAL_NO_EXCEPT
Definition: StlAlgorithms.hpp:41
+
34 
+
35 #if defined(__cpp_lib_parallel_algorithm) && defined(NUMCPP_USE_MULTITHREAD)
+
36 #define PARALLEL_ALGORITHMS_SUPPORTED
+
37 #define CONDITIONAL_NO_EXCEPT
+
38 #include <execution>
+
39 #else
+
40 #define CONDITIONAL_NO_EXCEPT noexcept
+
41 #endif
+
42 
+
43 namespace nc
+
44 {
+
45  namespace stl_algorithms
+
46  {
+
47  //============================================================================
+
48  // Method Description:
+
56  template<class InputIt, class UnaryPredicate>
+
57  bool all_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
+
58  {
+
59  return std::all_of(
+
60 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
61  std::execution::par_unseq,
+
62 #endif
+
63  first,
+
64  last,
+
65  p);
+
66  }
+
67 
+
68  //============================================================================
+
69  // Method Description:
+
77  template<class InputIt, class UnaryPredicate>
+
78  bool any_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
+
79  {
+
80  return std::any_of(
+
81 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
82  std::execution::par_unseq,
+
83 #endif
+
84  first,
+
85  last,
+
86  p);
+
87  }
+
88 
+
89  //============================================================================
+
90  // Method Description:
+
98  template<class InputIt, class OutputIt>
+
99  OutputIt copy(InputIt first, InputIt last, OutputIt destination) CONDITIONAL_NO_EXCEPT
+
100  {
+
101  return std::copy(
+
102 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
103  std::execution::par_unseq,
+
104 #endif
+
105  first,
+
106  last,
+
107  destination);
+
108  }
+
109 
+
110  //============================================================================
+
111  // Method Description:
+
119  template<class InputIt, class T>
+
120  typename std::iterator_traits<InputIt>::difference_type
+
121  count(InputIt first, InputIt last, const T& value) CONDITIONAL_NO_EXCEPT
+
122  {
+
123  return std::count(
+
124 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
125  std::execution::par_unseq,
+
126 #endif
+
127  first,
+
128  last,
+
129  value);
+
130  }
+
131 
+
132  //============================================================================
+
133  // Method Description:
+
141  template<class InputIt1, class InputIt2>
+
142  bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) CONDITIONAL_NO_EXCEPT
+
143  {
+
144  return std::equal(
+
145 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
146  std::execution::par_unseq,
+
147 #endif
+
148  first1,
+
149  last1,
+
150  first2);
+
151  }
+
152 
+
153  //============================================================================
+
154  // Method Description:
+
163  template<class InputIt1, class InputIt2, class BinaryPredicate>
+
164  bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) CONDITIONAL_NO_EXCEPT
+
165  {
+
166  return std::equal(
+
167 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
168  std::execution::par_unseq,
+
169 #endif
+
170  first1,
+
171  last1,
+
172  first2,
+
173  p);
+
174  }
+
175 
+
176  //============================================================================
+
177  // Method Description:
+
184  template<class ForwardIt, class T>
+
185  void fill(ForwardIt first, ForwardIt last, const T& value) CONDITIONAL_NO_EXCEPT
+
186  {
+
187  return std::fill(
+
188 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
189  std::execution::par_unseq,
+
190 #endif
+
191  first,
+
192  last,
+
193  value);
+
194  }
+
195 
+
196  //============================================================================
+
197  // Method Description:
+
206  template<class InputIt, class T>
+
207  InputIt find(InputIt first, InputIt last, const T& value) CONDITIONAL_NO_EXCEPT
+
208  {
+
209  return std::find(
+
210 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
211  std::execution::par_unseq,
+
212 #endif
+
213  first,
+
214  last,
+
215  value);
+
216  }
+
217 
+
218  //============================================================================
+
219  // Method Description:
+
226  template<class InputIt, class UnaryFunction>
+
227  void for_each(InputIt first, InputIt last, UnaryFunction f)
+
228  {
+
229  std::for_each(
+
230 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
231  std::execution::par_unseq,
+
232 #endif
+
233  first,
+
234  last,
+
235  f);
+
236  }
+
237 
+
238  //============================================================================
+
239  // Method Description:
+
246  template<class ForwardIt>
+
247  bool is_sorted(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
+
248  {
+
249  return std::is_sorted(
+
250 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
251  std::execution::par_unseq,
+
252 #endif
+
253  first,
+
254  last);
+
255  }
+
256 
+
257  //============================================================================
+
258  // Method Description:
+
266  template<class ForwardIt, class Compare>
+
267  bool is_sorted(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
268  {
+
269  return std::is_sorted(
+
270 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
271  std::execution::par_unseq,
+
272 #endif
+
273  first,
+
274  last,
+
275  comp);
+
276  }
+
277 
+
278  //============================================================================
+
279  // Method Description:
+
286  template<class ForwardIt>
+
287  ForwardIt max_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
+
288  {
+
289  return std::max_element(
+
290 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
291  std::execution::par_unseq,
+
292 #endif
+
293  first,
+
294  last);
+
295  }
+
296 
+
297  //============================================================================
+
298  // Method Description:
+
306  template<class ForwardIt, class Compare>
+
307  ForwardIt max_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
308  {
+
309  return std::max_element(
+
310 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
311  std::execution::par_unseq,
+
312 #endif
+
313  first,
+
314  last,
+
315  comp);
+
316  }
+
317 
+
318  //============================================================================
+
319  // Method Description:
+
325  template<class ForwardIt>
+
326  ForwardIt min_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
+
327  {
+
328  return std::min_element(
+
329 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
330  std::execution::par_unseq,
+
331 #endif
+
332  first,
+
333  last);
+
334  }
+
335 
+
336  //============================================================================
+
337  // Method Description:
+
345  template<class ForwardIt, class Compare>
+
346  ForwardIt min_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
347  {
+
348  return std::min_element(
+
349 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
350  std::execution::par_unseq,
+
351 #endif
+
352  first,
+
353  last,
+
354  comp);
+
355  }
+
356 
+
357  //============================================================================
+
358  // Method Description:
+
365  template<class ForwardIt>
+
366  std::pair<ForwardIt, ForwardIt> minmax_element(ForwardIt first, ForwardIt last) CONDITIONAL_NO_EXCEPT
+
367  {
+
368  return std::minmax_element(
+
369 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
370  std::execution::par_unseq,
+
371 #endif
+
372  first,
+
373  last);
+
374  }
+
375 
+
376  //============================================================================
+
377  // Method Description:
+
385  template<class ForwardIt, class Compare>
+
386  std::pair<ForwardIt, ForwardIt>
+
387  minmax_element(ForwardIt first, ForwardIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
388  {
+
389  return std::minmax_element(
+
390 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
391  std::execution::par_unseq,
+
392 #endif
+
393  first,
+
394  last,
+
395  comp);
+
396  }
+
397 
+
398  //============================================================================
+
399  // Method Description:
+
407  template<class InputIt, class UnaryPredicate>
+
408  bool none_of(InputIt first, InputIt last, UnaryPredicate p) CONDITIONAL_NO_EXCEPT
+
409  {
+
410  return std::none_of(
+
411 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
412  std::execution::par_unseq,
+
413 #endif
+
414  first,
+
415  last,
+
416  p);
+
417  }
+
418 
+
419  //============================================================================
+
420  // Method Description:
+
427  template<class RandomIt>
+
428  void nth_element(RandomIt first, RandomIt nth, RandomIt last) CONDITIONAL_NO_EXCEPT
+
429  {
+
430  std::nth_element(
+
431 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
432  std::execution::par_unseq,
+
433 #endif
+
434  first,
+
435  nth,
+
436  last);
+
437  }
+
438 
+
439  //============================================================================
+
440  // Method Description:
+
448  template<class RandomIt, class Compare>
+
449  void nth_element(RandomIt first, RandomIt nth, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
450  {
+
451  std::nth_element(
+
452 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
453  std::execution::par_unseq,
+
454 #endif
+
455  first,
+
456  nth,
+
457  last,
+
458  comp);
+
459  }
+
460 
+
461  //============================================================================
+
462  // Method Description:
+
470  template<class ForwardIt, class T>
+
471  void replace(ForwardIt first, ForwardIt last, const T& oldValue, const T& newValue) CONDITIONAL_NO_EXCEPT
+
472  {
+
473  std::replace(
+
474 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
475  std::execution::par_unseq,
+
476 #endif
+
477  first,
+
478  last,
+
479  oldValue,
+
480  newValue);
+
481  }
+
482 
+
483  //============================================================================
+
484  // Method Description:
+
490  template<class BidirIt>
+
491  void reverse(BidirIt first, BidirIt last) CONDITIONAL_NO_EXCEPT
+
492  {
+
493  std::reverse(
+
494 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
495  std::execution::par_unseq,
+
496 #endif
+
497  first,
+
498  last);
+
499  }
+
500 
+
501  //============================================================================
+
502  // Method Description:
+
509  template<class ForwardIt>
+
510  void rotate(ForwardIt first, ForwardIt firstN, ForwardIt last) CONDITIONAL_NO_EXCEPT
+
511  {
+
512  std::rotate(
+
513 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
514  std::execution::par_unseq,
+
515 #endif
+
516  first,
+
517  firstN,
+
518  last);
+
519  }
+
520 
+
521  //============================================================================
+
522  // Method Description:
+
532  template<class InputIt1, class InputIt2, class OutputIt>
+
533  OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
+
534  {
+
535  return std::set_difference(
+
536 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
537  std::execution::par_unseq,
+
538 #endif
+
539  first1,
+
540  last1,
+
541  first2,
+
542  last2,
+
543  destination);
+
544  }
+
545 
+
546  //============================================================================
+
547  // Method Description:
+
558  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
+
559  OutputIt set_difference(InputIt1 first1,
+
560  InputIt1 last1,
+
561  InputIt2 first2,
+
562  InputIt2 last2,
+
563  OutputIt destination,
+
564  Compare comp) CONDITIONAL_NO_EXCEPT
+
565  {
+
566  return std::set_difference(
+
567 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
568  std::execution::par_unseq,
+
569 #endif
+
570  first1,
+
571  last1,
+
572  first2,
+
573  last2,
+
574  destination,
+
575  comp);
+
576  }
+
577 
+
578  //============================================================================
+
579  // Method Description:
+
589  template<class InputIt1, class InputIt2, class OutputIt>
+
590  OutputIt set_intersection(InputIt1 first1,
+
591  InputIt1 last1,
+
592  InputIt2 first2,
+
593  InputIt2 last2,
+
594  OutputIt destination) CONDITIONAL_NO_EXCEPT
+
595  {
+
596  return std::set_intersection(
+
597 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
598  std::execution::par_unseq,
+
599 #endif
+
600  first1,
+
601  last1,
+
602  first2,
+
603  last2,
+
604  destination);
+
605  }
+
606 
+
607  //============================================================================
+
608  // Method Description:
+
619  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
+
620  OutputIt set_intersection(InputIt1 first1,
+
621  InputIt1 last1,
+
622  InputIt2 first2,
+
623  InputIt2 last2,
+
624  OutputIt destination,
+
625  Compare comp) CONDITIONAL_NO_EXCEPT
+
626  {
+
627  return std::set_intersection(
+
628 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
629  std::execution::par_unseq,
+
630 #endif
+
631  first1,
+
632  last1,
+
633  first2,
+
634  last2,
+
635  destination,
+
636  comp);
+
637  }
+
638 
+
639  //============================================================================
+
640  // Method Description:
+
650  template<class InputIt1, class InputIt2, class OutputIt>
+
651  OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
+
652  CONDITIONAL_NO_EXCEPT
+
653  {
+
654  return std::set_union(
+
655 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
656  std::execution::par_unseq,
+
657 #endif
+
658  first1,
+
659  last1,
+
660  first2,
+
661  last2,
+
662  destination);
+
663  }
+
664 
+
665  //============================================================================
+
666  // Method Description:
+
677  template<class InputIt1, class InputIt2, class OutputIt, class Compare>
+
678  OutputIt set_union(InputIt1 first1,
+
679  InputIt1 last1,
+
680  InputIt2 first2,
+
681  InputIt2 last2,
+
682  OutputIt destination,
+
683  Compare comp) CONDITIONAL_NO_EXCEPT
+
684  {
+
685  return std::set_union(
+
686 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
687  std::execution::par_unseq,
+
688 #endif
+
689  first1,
+
690  last1,
+
691  first2,
+
692  last2,
+
693  destination,
+
694  comp);
+
695  }
+
696 
+
697  //============================================================================
+
698  // Method Description:
+
704  template<class RandomIt>
+
705  void sort(RandomIt first, RandomIt last) CONDITIONAL_NO_EXCEPT
+
706  {
+
707  return std::sort(
+
708 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
709  std::execution::par_unseq,
+
710 #endif
+
711  first,
+
712  last);
+
713  }
+
714 
+
715  //============================================================================
+
716  // Method Description:
+
723  template<class RandomIt, class Compare>
+
724  void sort(RandomIt first, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
725  {
+
726  return std::sort(
+
727 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
728  std::execution::par_unseq,
+
729 #endif
+
730  first,
+
731  last,
+
732  comp);
+
733  }
+
734 
+
735  //============================================================================
+
736  // Method Description:
+
742  template<class RandomIt>
+
743  void stable_sort(RandomIt first, RandomIt last) CONDITIONAL_NO_EXCEPT
+
744  {
+
745  std::stable_sort(
+
746 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
747  std::execution::par_unseq,
+
748 #endif
+
749  first,
+
750  last);
+
751  }
+
752 
+
753  //============================================================================
+
754  // Method Description:
+
761  template<class RandomIt, class Compare>
+
762  void stable_sort(RandomIt first, RandomIt last, Compare comp) CONDITIONAL_NO_EXCEPT
+
763  {
+
764  std::stable_sort(
+
765 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
766  std::execution::par_unseq,
+
767 #endif
+
768  first,
+
769  last,
+
770  comp);
+
771  }
+
772 
+
773  //============================================================================
+
774  // Method Description:
+
783  template<class InputIt, class OutputIt, class UnaryOperation>
+
784  OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
+
785  {
+
786  return std::transform(
+
787 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
788  std::execution::par_unseq,
+
789 #endif
+
790  first,
+
791  last,
+
792  destination,
+
793  unaryFunction);
+
794  }
+
795 
+
796  //============================================================================
+
797  // Method Description:
+
807  template<class InputIt1, class InputIt2, class OutputIt, class BinaryOperation>
+
808  OutputIt transform(InputIt1 first1,
+
809  InputIt1 last1,
+
810  InputIt2 first2,
+
811  OutputIt destination,
+
812  BinaryOperation unaryFunction)
+
813  {
+
814  return std::transform(
+
815 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
816  std::execution::par_unseq,
+
817 #endif
+
818  first1,
+
819  last1,
+
820  first2,
+
821  destination,
+
822  unaryFunction);
+
823  }
+
824 
+
825  //============================================================================
+
826  // Method Description:
+
834  template<class InputIt, class OutputIt>
+
835  constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) CONDITIONAL_NO_EXCEPT
+
836  {
+
837  return std::unique_copy(
+
838 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
839  std::execution::par_unseq,
+
840 #endif
+
841  first,
+
842  last,
+
843  destination);
+
844  }
+
845 
+
846  //============================================================================
+
847  // Method Description:
+
856  template<class InputIt, class OutputIt, class BinaryPredicate>
+
857  constexpr OutputIt unique_copy(InputIt first,
+
858  InputIt last,
+
859  OutputIt destination,
+
860  BinaryPredicate binaryFunction) CONDITIONAL_NO_EXCEPT
+
861  {
+
862  return std::unique_copy(
+
863 #ifdef PARALLEL_ALGORITHMS_SUPPORTED
+
864  std::execution::par_unseq,
+
865 #endif
+
866  first,
+
867  last,
+
868  destination,
+
869  binaryFunction);
+
870  }
+
871  } // namespace stl_algorithms
+
872 } // namespace nc
+
CONDITIONAL_NO_EXCEPT
#define CONDITIONAL_NO_EXCEPT
Definition: StlAlgorithms.hpp:40
nc::random::detail::f
dtype f(GeneratorType &generator, dtype inDofN, dtype inDofD)
Definition: f.hpp:58
-
nc::stl_algorithms::any_of
bool any_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:79
-
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:706
-
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:268
-
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:122
-
nc::stl_algorithms::set_union
OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:652
-
nc::stl_algorithms::none_of
bool none_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:409
-
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:308
-
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:288
-
nc::stl_algorithms::set_union
OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:679
-
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:744
-
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:725
-
nc::stl_algorithms::reverse
void reverse(BidirIt first, BidirIt last) noexcept
Definition: StlAlgorithms.hpp:492
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:165
-
nc::stl_algorithms::all_of
bool all_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:58
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
-
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:208
-
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:763
-
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:836
-
nc::stl_algorithms::set_difference
OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:560
-
nc::stl_algorithms::set_difference
OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
Definition: StlAlgorithms.hpp:534
-
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:367
-
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:450
-
nc::stl_algorithms::replace
void replace(ForwardIt first, ForwardIt last, const T &oldValue, const T &newValue) noexcept
Definition: StlAlgorithms.hpp:472
-
nc::stl_algorithms::set_intersection
OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:591
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:143
-
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:248
-
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:347
-
nc::stl_algorithms::rotate
void rotate(ForwardIt first, ForwardIt firstN, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:511
-
nc::stl_algorithms::set_intersection
OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:621
-
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:388
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
-
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination, BinaryPredicate binaryFunction) noexcept
Definition: StlAlgorithms.hpp:858
-
nc::stl_algorithms::transform
OutputIt transform(InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt destination, BinaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:809
-
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:429
-
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:327
-
nc::stl_algorithms::fill
void fill(ForwardIt first, ForwardIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:186
+
nc::stl_algorithms::any_of
bool any_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:78
+
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:705
+
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:267
+
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:121
+
nc::stl_algorithms::set_union
OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:651
+
nc::stl_algorithms::none_of
bool none_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:408
+
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:307
+
nc::stl_algorithms::max_element
ForwardIt max_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:287
+
nc::stl_algorithms::set_union
OutputIt set_union(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:678
+
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:743
+
nc::stl_algorithms::sort
void sort(RandomIt first, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:724
+
nc::stl_algorithms::reverse
void reverse(BidirIt first, BidirIt last) noexcept
Definition: StlAlgorithms.hpp:491
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:164
+
nc::stl_algorithms::all_of
bool all_of(InputIt first, InputIt last, UnaryPredicate p) noexcept
Definition: StlAlgorithms.hpp:57
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
+
nc::stl_algorithms::find
InputIt find(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:207
+
nc::stl_algorithms::stable_sort
void stable_sort(RandomIt first, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:762
+
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:835
+
nc::stl_algorithms::set_difference
OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:559
+
nc::stl_algorithms::set_difference
OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
Definition: StlAlgorithms.hpp:533
+
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:366
+
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:449
+
nc::stl_algorithms::replace
void replace(ForwardIt first, ForwardIt last, const T &oldValue, const T &newValue) noexcept
Definition: StlAlgorithms.hpp:471
+
nc::stl_algorithms::set_intersection
OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:590
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:142
+
nc::stl_algorithms::is_sorted
bool is_sorted(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:247
+
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:346
+
nc::stl_algorithms::rotate
void rotate(ForwardIt first, ForwardIt firstN, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:510
+
nc::stl_algorithms::set_intersection
OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
Definition: StlAlgorithms.hpp:620
+
nc::stl_algorithms::minmax_element
std::pair< ForwardIt, ForwardIt > minmax_element(ForwardIt first, ForwardIt last, Compare comp) noexcept
Definition: StlAlgorithms.hpp:387
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
+
nc::stl_algorithms::unique_copy
constexpr OutputIt unique_copy(InputIt first, InputIt last, OutputIt destination, BinaryPredicate binaryFunction) noexcept
Definition: StlAlgorithms.hpp:857
+
nc::stl_algorithms::transform
OutputIt transform(InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt destination, BinaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:808
+
nc::stl_algorithms::nth_element
void nth_element(RandomIt first, RandomIt nth, RandomIt last) noexcept
Definition: StlAlgorithms.hpp:428
+
nc::stl_algorithms::min_element
ForwardIt min_element(ForwardIt first, ForwardIt last) noexcept
Definition: StlAlgorithms.hpp:326
+
nc::stl_algorithms::fill
void fill(ForwardIt first, ForwardIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:185
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/abs_8hpp_source.html b/docs/doxygen/html/abs_8hpp_source.html index 07498ca94..dacccaff2 100644 --- a/docs/doxygen/html/abs_8hpp_source.html +++ b/docs/doxygen/html/abs_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::abs
auto abs(dtype inValue) noexcept
Definition: abs.hpp:49
nc::abs
auto abs(const NdArray< dtype > &inArray)
Definition: abs.hpp:66
diff --git a/docs/doxygen/html/airy__ai_8hpp_source.html b/docs/doxygen/html/airy__ai_8hpp_source.html index 2d5cdb429..9e58e8b2d 100644 --- a/docs/doxygen/html/airy__ai_8hpp_source.html +++ b/docs/doxygen/html/airy__ai_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::airy_ai
auto airy_ai(const NdArray< dtype > &inArray)
Definition: airy_ai.hpp:69
nc::special::airy_ai
auto airy_ai(dtype inValue)
Definition: airy_ai.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/airy__ai__prime_8hpp_source.html b/docs/doxygen/html/airy__ai__prime_8hpp_source.html index 8a5a9caeb..de5a2fb78 100644 --- a/docs/doxygen/html/airy__ai__prime_8hpp_source.html +++ b/docs/doxygen/html/airy__ai__prime_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::airy_ai_prime
auto airy_ai_prime(dtype inValue)
Definition: airy_ai_prime.hpp:52
nc::special::airy_ai_prime
auto airy_ai_prime(const NdArray< dtype > &inArray)
Definition: airy_ai_prime.hpp:69
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/airy__bi_8hpp_source.html b/docs/doxygen/html/airy__bi_8hpp_source.html index b48f5ce5d..5d64a751b 100644 --- a/docs/doxygen/html/airy__bi_8hpp_source.html +++ b/docs/doxygen/html/airy__bi_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::airy_bi
auto airy_bi(dtype inValue)
Definition: airy_bi.hpp:52
nc::special::airy_bi
auto airy_bi(const NdArray< dtype > &inArray)
Definition: airy_bi.hpp:69
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/airy__bi__prime_8hpp_source.html b/docs/doxygen/html/airy__bi__prime_8hpp_source.html index ea252c0cb..86a010746 100644 --- a/docs/doxygen/html/airy__bi__prime_8hpp_source.html +++ b/docs/doxygen/html/airy__bi__prime_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::airy_bi_prime
auto airy_bi_prime(const NdArray< dtype > &inArray)
Definition: airy_bi_prime.hpp:69
nc::special::airy_bi_prime
auto airy_bi_prime(dtype inValue)
Definition: airy_bi_prime.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/angle_8hpp_source.html b/docs/doxygen/html/angle_8hpp_source.html index 03cfec30d..be722719b 100644 --- a/docs/doxygen/html/angle_8hpp_source.html +++ b/docs/doxygen/html/angle_8hpp_source.html @@ -147,7 +147,7 @@
StlAlgorithms.hpp
nc::NdArray
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:72
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::angle
auto angle(const std::complex< dtype > &inValue)
Definition: angle.hpp:48
diff --git a/docs/doxygen/html/append_8hpp_source.html b/docs/doxygen/html/append_8hpp_source.html index 4a2c075e6..d4c42a777 100644 --- a/docs/doxygen/html/append_8hpp_source.html +++ b/docs/doxygen/html/append_8hpp_source.html @@ -195,7 +195,7 @@
nc::Shape
A Shape Class for NdArrays.
Definition: Core/Shape.hpp:41
nc::Shape::rows
uint32 rows
Definition: Core/Shape.hpp:44
nc::Shape::cols
uint32 cols
Definition: Core/Shape.hpp:45
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
nc
Definition: Coordinate.hpp:45
nc::Axis
Axis
Enum To describe an axis.
Definition: Types.hpp:47
nc::Axis::ROW
@ ROW
diff --git a/docs/doxygen/html/apply_function_8hpp_source.html b/docs/doxygen/html/apply_function_8hpp_source.html index 213ed782b..529f33efa 100644 --- a/docs/doxygen/html/apply_function_8hpp_source.html +++ b/docs/doxygen/html/apply_function_8hpp_source.html @@ -128,7 +128,7 @@
nc::NdArray
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:72
nc::NdArray::end
iterator end() noexcept
Definition: NdArrayCore.hpp:1479
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::applyFunction
void applyFunction(NdArray< dtype > &inArray, const std::function< dtype(dtype)> &inFunc)
Definition: applyFunction.hpp:47
diff --git a/docs/doxygen/html/arccos_8hpp_source.html b/docs/doxygen/html/arccos_8hpp_source.html index e65b207e6..fe8e7a7d8 100644 --- a/docs/doxygen/html/arccos_8hpp_source.html +++ b/docs/doxygen/html/arccos_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arccos
auto arccos(dtype inValue) noexcept
Definition: arccos.hpp:49
diff --git a/docs/doxygen/html/arccosh_8hpp_source.html b/docs/doxygen/html/arccosh_8hpp_source.html index 155a7d4eb..73de9a755 100644 --- a/docs/doxygen/html/arccosh_8hpp_source.html +++ b/docs/doxygen/html/arccosh_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arccosh
auto arccosh(dtype inValue) noexcept
Definition: arccosh.hpp:49
diff --git a/docs/doxygen/html/arcsin_8hpp_source.html b/docs/doxygen/html/arcsin_8hpp_source.html index 92a5d5461..2b308be4c 100644 --- a/docs/doxygen/html/arcsin_8hpp_source.html +++ b/docs/doxygen/html/arcsin_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arcsin
auto arcsin(dtype inValue) noexcept
Definition: arcsin.hpp:49
diff --git a/docs/doxygen/html/arcsinh_8hpp_source.html b/docs/doxygen/html/arcsinh_8hpp_source.html index 4ccb54bc9..96e8f62a1 100644 --- a/docs/doxygen/html/arcsinh_8hpp_source.html +++ b/docs/doxygen/html/arcsinh_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arcsinh
auto arcsinh(dtype inValue) noexcept
Definition: arcsinh.hpp:49
diff --git a/docs/doxygen/html/arctan2_8hpp_source.html b/docs/doxygen/html/arctan2_8hpp_source.html index da6ee2b02..66dff1b4d 100644 --- a/docs/doxygen/html/arctan2_8hpp_source.html +++ b/docs/doxygen/html/arctan2_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arctan2
auto arctan2(dtype inY, dtype inX) noexcept
Definition: arctan2.hpp:51
diff --git a/docs/doxygen/html/arctan_8hpp_source.html b/docs/doxygen/html/arctan_8hpp_source.html index f17c8c793..263a05c95 100644 --- a/docs/doxygen/html/arctan_8hpp_source.html +++ b/docs/doxygen/html/arctan_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arctan
auto arctan(dtype inValue) noexcept
Definition: arctan.hpp:49
diff --git a/docs/doxygen/html/arctanh_8hpp_source.html b/docs/doxygen/html/arctanh_8hpp_source.html index 4cd2b293b..6e68d714f 100644 --- a/docs/doxygen/html/arctanh_8hpp_source.html +++ b/docs/doxygen/html/arctanh_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::arctanh
auto arctanh(dtype inValue) noexcept
Definition: arctanh.hpp:49
diff --git a/docs/doxygen/html/array__equiv_8hpp_source.html b/docs/doxygen/html/array__equiv_8hpp_source.html index 47c2cb3d5..b38f02dd8 100644 --- a/docs/doxygen/html/array__equiv_8hpp_source.html +++ b/docs/doxygen/html/array__equiv_8hpp_source.html @@ -147,7 +147,7 @@
StlAlgorithms.hpp
nc::DtypeInfo
Holds info about the dtype.
Definition: DtypeInfo.hpp:41
nc::NdArray
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:72
-
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:143
+
nc::stl_algorithms::equal
bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
Definition: StlAlgorithms.hpp:142
nc::utils::essentiallyEqual
bool essentiallyEqual(dtype inValue1, dtype inValue2) noexcept
Definition: essentiallyEqual.hpp:51
nc
Definition: Coordinate.hpp:45
nc::array_equiv
bool array_equiv(const NdArray< dtype > &inArray1, const NdArray< dtype > &inArray2) noexcept
Definition: array_equiv.hpp:54
diff --git a/docs/doxygen/html/average_8hpp_source.html b/docs/doxygen/html/average_8hpp_source.html index b0b6c0772..f39cb4137 100644 --- a/docs/doxygen/html/average_8hpp_source.html +++ b/docs/doxygen/html/average_8hpp_source.html @@ -337,7 +337,7 @@
nc::Shape::rows
uint32 rows
Definition: Core/Shape.hpp:44
nc::Shape::cols
uint32 cols
Definition: Core/Shape.hpp:45
mean.hpp
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::Axis
Axis
Enum To describe an axis.
Definition: Types.hpp:47
nc::Axis::ROW
@ ROW
diff --git a/docs/doxygen/html/bessel__in_8hpp_source.html b/docs/doxygen/html/bessel__in_8hpp_source.html index db5d3eedf..776ad5aef 100644 --- a/docs/doxygen/html/bessel__in_8hpp_source.html +++ b/docs/doxygen/html/bessel__in_8hpp_source.html @@ -170,7 +170,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_in
auto bessel_in(dtype1 inV, dtype2 inX)
Definition: bessel_in.hpp:59
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__in__prime_8hpp_source.html b/docs/doxygen/html/bessel__in__prime_8hpp_source.html index 607445ae1..37f61c1a7 100644 --- a/docs/doxygen/html/bessel__in__prime_8hpp_source.html +++ b/docs/doxygen/html/bessel__in__prime_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_in_prime
auto bessel_in_prime(dtype1 inV, dtype2 inX)
Definition: bessel_in_prime.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__jn_8hpp_source.html b/docs/doxygen/html/bessel__jn_8hpp_source.html index 97fd1955d..cfe38fd59 100644 --- a/docs/doxygen/html/bessel__jn_8hpp_source.html +++ b/docs/doxygen/html/bessel__jn_8hpp_source.html @@ -170,7 +170,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_jn
auto bessel_jn(dtype1 inV, dtype2 inX)
Definition: bessel_jn.hpp:59
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__jn__prime_8hpp_source.html b/docs/doxygen/html/bessel__jn__prime_8hpp_source.html index 552f307eb..55d4ee893 100644 --- a/docs/doxygen/html/bessel__jn__prime_8hpp_source.html +++ b/docs/doxygen/html/bessel__jn__prime_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_jn_prime
auto bessel_jn_prime(dtype1 inV, dtype2 inX)
Definition: bessel_jn_prime.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__kn_8hpp_source.html b/docs/doxygen/html/bessel__kn_8hpp_source.html index f8c2176d0..ef6d05d90 100644 --- a/docs/doxygen/html/bessel__kn_8hpp_source.html +++ b/docs/doxygen/html/bessel__kn_8hpp_source.html @@ -170,7 +170,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_kn
auto bessel_kn(dtype1 inV, dtype2 inX)
Definition: bessel_kn.hpp:59
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__kn__prime_8hpp_source.html b/docs/doxygen/html/bessel__kn__prime_8hpp_source.html index 68d6f3ab4..a1052103f 100644 --- a/docs/doxygen/html/bessel__kn__prime_8hpp_source.html +++ b/docs/doxygen/html/bessel__kn__prime_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_kn_prime
auto bessel_kn_prime(dtype1 inV, dtype2 inX)
Definition: bessel_kn_prime.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__yn_8hpp_source.html b/docs/doxygen/html/bessel__yn_8hpp_source.html index 46fcd8e64..9c9678272 100644 --- a/docs/doxygen/html/bessel__yn_8hpp_source.html +++ b/docs/doxygen/html/bessel__yn_8hpp_source.html @@ -170,7 +170,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_yn
auto bessel_yn(dtype1 inV, dtype2 inX)
Definition: bessel_yn.hpp:59
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bessel__yn__prime_8hpp_source.html b/docs/doxygen/html/bessel__yn__prime_8hpp_source.html index b782b9848..a2a5ad74c 100644 --- a/docs/doxygen/html/bessel__yn__prime_8hpp_source.html +++ b/docs/doxygen/html/bessel__yn__prime_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::bessel_yn_prime
auto bessel_yn_prime(dtype1 inV, dtype2 inX)
Definition: bessel_yn_prime.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bincount_8hpp_source.html b/docs/doxygen/html/bincount_8hpp_source.html index dcda7f1f4..072987994 100644 --- a/docs/doxygen/html/bincount_8hpp_source.html +++ b/docs/doxygen/html/bincount_8hpp_source.html @@ -204,7 +204,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::max
NdArray< dtype > max(Axis inAxis=Axis::NONE) const
Definition: NdArrayCore.hpp:2940
nc::NdArray::zeros
NdArray< dtype > & zeros() noexcept
Definition: NdArrayCore.hpp:4668
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
nc::max
NdArray< dtype > max(const NdArray< dtype > &inArray, Axis inAxis=Axis::NONE)
Definition: max.hpp:44
nc::bincount
NdArray< dtype > bincount(const NdArray< dtype > &inArray, uint16 inMinLength=1)
Definition: bincount.hpp:58
diff --git a/docs/doxygen/html/binomial_8hpp_source.html b/docs/doxygen/html/binomial_8hpp_source.html index 21b447067..122ff3b4c 100644 --- a/docs/doxygen/html/binomial_8hpp_source.html +++ b/docs/doxygen/html/binomial_8hpp_source.html @@ -205,7 +205,7 @@
nc::random::detail::binomial
dtype binomial(GeneratorType &generator, dtype inN, double inP=0.5)
Definition: binomial.hpp:59
nc::random::binomial
dtype binomial(dtype inN, double inP=0.5)
Definition: binomial.hpp:130
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/bit__count_8hpp_source.html b/docs/doxygen/html/bit__count_8hpp_source.html index 05e81c918..2b91ddeaa 100644 --- a/docs/doxygen/html/bit__count_8hpp_source.html +++ b/docs/doxygen/html/bit__count_8hpp_source.html @@ -156,8 +156,8 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:122
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:121
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::bit_count
constexpr int bit_count(dtype inValue) noexcept
Definition: bit_count.hpp:45
diff --git a/docs/doxygen/html/cauchy_8hpp_source.html b/docs/doxygen/html/cauchy_8hpp_source.html index 53a43b238..16bd8dcaa 100644 --- a/docs/doxygen/html/cauchy_8hpp_source.html +++ b/docs/doxygen/html/cauchy_8hpp_source.html @@ -195,7 +195,7 @@
nc::random::detail::cauchy
dtype cauchy(GeneratorType &generator, dtype inMean=0, dtype inSigma=1)
Definition: cauchy.hpp:57
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
nc::random::cauchy
dtype cauchy(dtype inMean=0, dtype inSigma=1)
Definition: cauchy.hpp:114
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/cbrt_8hpp_source.html b/docs/doxygen/html/cbrt_8hpp_source.html index 16a859370..b29ea9c65 100644 --- a/docs/doxygen/html/cbrt_8hpp_source.html +++ b/docs/doxygen/html/cbrt_8hpp_source.html @@ -149,7 +149,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::cbrt
double cbrt(dtype inValue) noexcept
Definition: cbrt.hpp:48
nc::cbrt
NdArray< double > cbrt(const NdArray< dtype > &inArray)
Definition: cbrt.hpp:65
diff --git a/docs/doxygen/html/ceil_8hpp_source.html b/docs/doxygen/html/ceil_8hpp_source.html index db8447f93..0c070e341 100644 --- a/docs/doxygen/html/ceil_8hpp_source.html +++ b/docs/doxygen/html/ceil_8hpp_source.html @@ -149,7 +149,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::ceil
dtype ceil(dtype inValue) noexcept
Definition: ceil.hpp:48
nc::ceil
NdArray< dtype > ceil(const NdArray< dtype > &inArray)
Definition: ceil.hpp:65
diff --git a/docs/doxygen/html/chebyshev__t_8hpp_source.html b/docs/doxygen/html/chebyshev__t_8hpp_source.html index 92b483cb7..d2564cc25 100644 --- a/docs/doxygen/html/chebyshev__t_8hpp_source.html +++ b/docs/doxygen/html/chebyshev__t_8hpp_source.html @@ -158,7 +158,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::polynomial::chebyshev_t
NdArray< double > chebyshev_t(uint32 n, const NdArray< dtype > &inArrayX)
Definition: chebyshev_t.hpp:69
nc::polynomial::chebyshev_t
double chebyshev_t(uint32 n, dtype x)
Definition: chebyshev_t.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::uint32
std::uint32_t uint32
Definition: Types.hpp:40
diff --git a/docs/doxygen/html/chebyshev__u_8hpp_source.html b/docs/doxygen/html/chebyshev__u_8hpp_source.html index f68f39c41..4f50d0645 100644 --- a/docs/doxygen/html/chebyshev__u_8hpp_source.html +++ b/docs/doxygen/html/chebyshev__u_8hpp_source.html @@ -158,7 +158,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::polynomial::chebyshev_u
double chebyshev_u(uint32 n, dtype x)
Definition: chebyshev_u.hpp:52
nc::polynomial::chebyshev_u
NdArray< double > chebyshev_u(uint32 n, const NdArray< dtype > &inArrayX)
Definition: chebyshev_u.hpp:69
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::uint32
std::uint32_t uint32
Definition: Types.hpp:40
diff --git a/docs/doxygen/html/chi_square_8hpp_source.html b/docs/doxygen/html/chi_square_8hpp_source.html index 0e67ee06e..dc4b6ae4c 100644 --- a/docs/doxygen/html/chi_square_8hpp_source.html +++ b/docs/doxygen/html/chi_square_8hpp_source.html @@ -195,7 +195,7 @@
nc::random::detail::chiSquare
dtype chiSquare(GeneratorType &generator, dtype inDof)
Definition: chiSquare.hpp:58
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
nc::random::chiSquare
dtype chiSquare(dtype inDof)
Definition: chiSquare.hpp:117
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/choice_8hpp_source.html b/docs/doxygen/html/choice_8hpp_source.html index de10e8b6c..0b82ba401 100644 --- a/docs/doxygen/html/choice_8hpp_source.html +++ b/docs/doxygen/html/choice_8hpp_source.html @@ -188,7 +188,7 @@
nc::random::detail::permutation
NdArray< dtype > permutation(GeneratorType &generator, dtype inValue)
Definition: permutation.hpp:55
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
nc::random::choice
dtype choice(const NdArray< dtype > &inArray)
Definition: choice.hpp:101
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
nc::replace
NdArray< dtype > replace(const NdArray< dtype > &inArray, dtype oldValue, dtype newValue)
Definition: replace.hpp:45
nc::uint32
std::uint32_t uint32
Definition: Types.hpp:40
diff --git a/docs/doxygen/html/classnc_1_1random_1_1_r_n_g.html b/docs/doxygen/html/classnc_1_1random_1_1_r_n_g.html index 214510174..cc594633b 100644 --- a/docs/doxygen/html/classnc_1_1random_1_1_r_n_g.html +++ b/docs/doxygen/html/classnc_1_1random_1_1_r_n_g.html @@ -347,7 +347,7 @@

-inline +inlineexplicit

diff --git a/docs/doxygen/html/comp__ellint__1_8hpp_source.html b/docs/doxygen/html/comp__ellint__1_8hpp_source.html index c5f58452c..a17149851 100644 --- a/docs/doxygen/html/comp__ellint__1_8hpp_source.html +++ b/docs/doxygen/html/comp__ellint__1_8hpp_source.html @@ -171,7 +171,7 @@
nc::special::comp_ellint_1
auto comp_ellint_1(dtype inK)
Definition: comp_ellint_1.hpp:58
nc::special::comp_ellint_1
auto comp_ellint_1(const NdArray< dtype > &inArrayK)
Definition: comp_ellint_1.hpp:79
nc::special::ellint_1
auto ellint_1(dtype1 inK, dtype2 inP)
Definition: ellint_1.hpp:60
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/comp__ellint__2_8hpp_source.html b/docs/doxygen/html/comp__ellint__2_8hpp_source.html index 020dc7745..50b5f5626 100644 --- a/docs/doxygen/html/comp__ellint__2_8hpp_source.html +++ b/docs/doxygen/html/comp__ellint__2_8hpp_source.html @@ -171,7 +171,7 @@
nc::special::ellint_2
auto ellint_2(dtype1 inK, dtype2 inP)
Definition: ellint_2.hpp:60
nc::special::comp_ellint_2
auto comp_ellint_2(const NdArray< dtype > &inArrayK)
Definition: comp_ellint_2.hpp:79
nc::special::comp_ellint_2
auto comp_ellint_2(dtype inK)
Definition: comp_ellint_2.hpp:58
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/comp__ellint__3_8hpp_source.html b/docs/doxygen/html/comp__ellint__3_8hpp_source.html index fee066fff..56f042cf3 100644 --- a/docs/doxygen/html/comp__ellint__3_8hpp_source.html +++ b/docs/doxygen/html/comp__ellint__3_8hpp_source.html @@ -182,7 +182,7 @@
nc::special::comp_ellint_3
auto comp_ellint_3(const NdArray< dtype1 > &inArrayK, const NdArray< dtype2 > &inArrayV)
Definition: comp_ellint_3.hpp:83
nc::special::comp_ellint_3
auto comp_ellint_3(dtype1 inK, dtype2 inV)
Definition: comp_ellint_3.hpp:60
nc::special::ellint_3
auto ellint_3(dtype1 inK, dtype2 inV, dtype3 inP)
Definition: ellint_3.hpp:61
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/complex_8hpp_source.html b/docs/doxygen/html/complex_8hpp_source.html index e1554d981..72cacb93c 100644 --- a/docs/doxygen/html/complex_8hpp_source.html +++ b/docs/doxygen/html/complex_8hpp_source.html @@ -184,7 +184,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::imag
auto imag(const std::complex< dtype > &inValue)
Definition: imag.hpp:47
nc::complex
auto complex(dtype inReal)
Definition: complex.hpp:47
diff --git a/docs/doxygen/html/concatenate_8hpp_source.html b/docs/doxygen/html/concatenate_8hpp_source.html index 9d98aeb7c..a8d0e8fa4 100644 --- a/docs/doxygen/html/concatenate_8hpp_source.html +++ b/docs/doxygen/html/concatenate_8hpp_source.html @@ -166,7 +166,7 @@
nc::NdArray
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:72
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
column_stack.hpp
-
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:100
+
nc::stl_algorithms::copy
OutputIt copy(InputIt first, InputIt last, OutputIt destination) noexcept
Definition: StlAlgorithms.hpp:99
nc
Definition: Coordinate.hpp:45
nc::column_stack
NdArray< dtype > column_stack(const std::initializer_list< NdArray< dtype >> &inArrayList)
Definition: column_stack.hpp:49
nc::row_stack
NdArray< dtype > row_stack(const std::initializer_list< NdArray< dtype >> &inArrayList)
Definition: row_stack.hpp:49
diff --git a/docs/doxygen/html/conj_8hpp_source.html b/docs/doxygen/html/conj_8hpp_source.html index f22bb0e4a..23f7e0147 100644 --- a/docs/doxygen/html/conj_8hpp_source.html +++ b/docs/doxygen/html/conj_8hpp_source.html @@ -147,7 +147,7 @@
StlAlgorithms.hpp
nc::NdArray
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:72
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::conj
auto conj(const std::complex< dtype > &inValue)
Definition: conj.hpp:48
nc::conj
auto conj(const NdArray< std::complex< dtype >> &inArray)
Definition: conj.hpp:65
diff --git a/docs/doxygen/html/copy_sign_8hpp_source.html b/docs/doxygen/html/copy_sign_8hpp_source.html index c2c22b60f..65c33b0ad 100644 --- a/docs/doxygen/html/copy_sign_8hpp_source.html +++ b/docs/doxygen/html/copy_sign_8hpp_source.html @@ -152,7 +152,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::abs
auto abs(dtype inValue) noexcept
Definition: abs.hpp:49
nc::copySign
NdArray< dtype > copySign(const NdArray< dtype > &inArray1, const NdArray< dtype > &inArray2)
Definition: copySign.hpp:51
diff --git a/docs/doxygen/html/cos_8hpp_source.html b/docs/doxygen/html/cos_8hpp_source.html index fbeda2208..def2a81b3 100644 --- a/docs/doxygen/html/cos_8hpp_source.html +++ b/docs/doxygen/html/cos_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::cos
auto cos(dtype inValue) noexcept
Definition: cos.hpp:49
nc::cos
auto cos(const NdArray< dtype > &inArray)
Definition: cos.hpp:66
diff --git a/docs/doxygen/html/cosh_8hpp_source.html b/docs/doxygen/html/cosh_8hpp_source.html index 3db95163f..cb9193e2f 100644 --- a/docs/doxygen/html/cosh_8hpp_source.html +++ b/docs/doxygen/html/cosh_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::cosh
auto cosh(const NdArray< dtype > &inArray)
Definition: cosh.hpp:66
nc::cosh
auto cosh(dtype inValue) noexcept
Definition: cosh.hpp:49
diff --git a/docs/doxygen/html/count__nonzero_8hpp_source.html b/docs/doxygen/html/count__nonzero_8hpp_source.html index 1ad09014b..e0533b150 100644 --- a/docs/doxygen/html/count__nonzero_8hpp_source.html +++ b/docs/doxygen/html/count__nonzero_8hpp_source.html @@ -185,7 +185,7 @@
nc::Shape
A Shape Class for NdArrays.
Definition: Core/Shape.hpp:41
nc::Shape::rows
uint32 rows
Definition: Core/Shape.hpp:44
nc::Shape::cols
uint32 cols
Definition: Core/Shape.hpp:45
-
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:122
+
nc::stl_algorithms::count
std::iterator_traits< InputIt >::difference_type count(InputIt first, InputIt last, const T &value) noexcept
Definition: StlAlgorithms.hpp:121
nc
Definition: Coordinate.hpp:45
nc::Axis
Axis
Enum To describe an axis.
Definition: Types.hpp:47
nc::Axis::ROW
@ ROW
diff --git a/docs/doxygen/html/cyclic__hankel__1_8hpp_source.html b/docs/doxygen/html/cyclic__hankel__1_8hpp_source.html index 576a0c76c..332280059 100644 --- a/docs/doxygen/html/cyclic__hankel__1_8hpp_source.html +++ b/docs/doxygen/html/cyclic__hankel__1_8hpp_source.html @@ -161,7 +161,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::cyclic_hankel_1
auto cyclic_hankel_1(dtype1 inV, dtype2 inX)
Definition: cyclic_hankel_1.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/cyclic__hankel__2_8hpp_source.html b/docs/doxygen/html/cyclic__hankel__2_8hpp_source.html index e58a2ac94..c6fe71638 100644 --- a/docs/doxygen/html/cyclic__hankel__2_8hpp_source.html +++ b/docs/doxygen/html/cyclic__hankel__2_8hpp_source.html @@ -161,7 +161,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::cyclic_hankel_2
auto cyclic_hankel_2(dtype1 inV, dtype2 inX)
Definition: cyclic_hankel_2.hpp:54
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/deg2rad_8hpp_source.html b/docs/doxygen/html/deg2rad_8hpp_source.html index 0cf422d8c..13d38279a 100644 --- a/docs/doxygen/html/deg2rad_8hpp_source.html +++ b/docs/doxygen/html/deg2rad_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::constants::pi
constexpr double pi
Pi.
Definition: Constants.hpp:43
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::deg2rad
constexpr auto deg2rad(dtype inValue) noexcept
Definition: deg2rad.hpp:47
diff --git a/docs/doxygen/html/diff_8hpp_source.html b/docs/doxygen/html/diff_8hpp_source.html index 63ff19780..832651e96 100644 --- a/docs/doxygen/html/diff_8hpp_source.html +++ b/docs/doxygen/html/diff_8hpp_source.html @@ -213,7 +213,7 @@
nc::Shape
A Shape Class for NdArrays.
Definition: Core/Shape.hpp:41
nc::Shape::rows
uint32 rows
Definition: Core/Shape.hpp:44
nc::Shape::cols
uint32 cols
Definition: Core/Shape.hpp:45
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::Axis
Axis
Enum To describe an axis.
Definition: Types.hpp:47
nc::Axis::ROW
@ ROW
diff --git a/docs/doxygen/html/digamma_8hpp_source.html b/docs/doxygen/html/digamma_8hpp_source.html index bbf1c2d95..7af9c8b58 100644 --- a/docs/doxygen/html/digamma_8hpp_source.html +++ b/docs/doxygen/html/digamma_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::digamma
auto digamma(const NdArray< dtype > &inArray)
Definition: digamma.hpp:69
nc::special::digamma
auto digamma(dtype inValue)
Definition: digamma.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/discrete_8hpp_source.html b/docs/doxygen/html/discrete_8hpp_source.html index 3a4eb5ee2..8ef5d518b 100644 --- a/docs/doxygen/html/discrete_8hpp_source.html +++ b/docs/doxygen/html/discrete_8hpp_source.html @@ -185,7 +185,7 @@
nc::random::detail::discrete
dtype discrete(GeneratorType &generator, const NdArray< double > &inWeights)
Definition: discrete.hpp:57
nc::random::discrete
dtype discrete(const NdArray< double > &inWeights)
Definition: discrete.hpp:106
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/ellint__1_8hpp_source.html b/docs/doxygen/html/ellint__1_8hpp_source.html index 4fd08c1c4..e823207c8 100644 --- a/docs/doxygen/html/ellint__1_8hpp_source.html +++ b/docs/doxygen/html/ellint__1_8hpp_source.html @@ -181,7 +181,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::ellint_1
auto ellint_1(const NdArray< dtype1 > &inArrayK, const NdArray< dtype2 > &inArrayP)
Definition: ellint_1.hpp:83
nc::special::ellint_1
auto ellint_1(dtype1 inK, dtype2 inP)
Definition: ellint_1.hpp:60
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/ellint__2_8hpp_source.html b/docs/doxygen/html/ellint__2_8hpp_source.html index 4a13d89d3..59864581c 100644 --- a/docs/doxygen/html/ellint__2_8hpp_source.html +++ b/docs/doxygen/html/ellint__2_8hpp_source.html @@ -181,7 +181,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::ellint_2
auto ellint_2(const NdArray< dtype1 > &inArrayK, const NdArray< dtype2 > &inArrayP)
Definition: ellint_2.hpp:83
nc::special::ellint_2
auto ellint_2(dtype1 inK, dtype2 inP)
Definition: ellint_2.hpp:60
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/erf_8hpp_source.html b/docs/doxygen/html/erf_8hpp_source.html index 6382a272c..dadbe39ea 100644 --- a/docs/doxygen/html/erf_8hpp_source.html +++ b/docs/doxygen/html/erf_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::erf
auto erf(const NdArray< dtype > &inArray)
Definition: erf.hpp:69
nc::special::erf
auto erf(dtype inValue)
Definition: erf.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/erf__inv_8hpp_source.html b/docs/doxygen/html/erf__inv_8hpp_source.html index c4ea51c3e..66671e8aa 100644 --- a/docs/doxygen/html/erf__inv_8hpp_source.html +++ b/docs/doxygen/html/erf__inv_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::erf_inv
auto erf_inv(dtype inValue)
Definition: erf_inv.hpp:52
nc::special::erf_inv
auto erf_inv(const NdArray< dtype > &inArray)
Definition: erf_inv.hpp:69
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/erfc_8hpp_source.html b/docs/doxygen/html/erfc_8hpp_source.html index efee103be..9e852b760 100644 --- a/docs/doxygen/html/erfc_8hpp_source.html +++ b/docs/doxygen/html/erfc_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::erfc
auto erfc(dtype inValue)
Definition: erfc.hpp:51
nc::special::erfc
auto erfc(const NdArray< dtype > &inArray)
Definition: erfc.hpp:68
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/erfc__inv_8hpp_source.html b/docs/doxygen/html/erfc__inv_8hpp_source.html index 422357d03..2edb0dd6a 100644 --- a/docs/doxygen/html/erfc__inv_8hpp_source.html +++ b/docs/doxygen/html/erfc__inv_8hpp_source.html @@ -160,7 +160,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::erfc_inv
auto erfc_inv(const NdArray< dtype > &inArray)
Definition: erfc_inv.hpp:69
nc::special::erfc_inv
auto erfc_inv(dtype inValue)
Definition: erfc_inv.hpp:52
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/exp2_8hpp_source.html b/docs/doxygen/html/exp2_8hpp_source.html index a064943df..4d7dd7fad 100644 --- a/docs/doxygen/html/exp2_8hpp_source.html +++ b/docs/doxygen/html/exp2_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::exp2
auto exp2(const NdArray< dtype > &inArray)
Definition: exp2.hpp:65
nc::exp2
auto exp2(dtype inValue) noexcept
Definition: exp2.hpp:48
diff --git a/docs/doxygen/html/exp_8hpp_source.html b/docs/doxygen/html/exp_8hpp_source.html index b7ee7c5a2..3a02c89ec 100644 --- a/docs/doxygen/html/exp_8hpp_source.html +++ b/docs/doxygen/html/exp_8hpp_source.html @@ -152,7 +152,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::exp
auto exp(const NdArray< dtype > &inArray)
Definition: exp.hpp:66
nc::exp
auto exp(dtype inValue) noexcept
Definition: exp.hpp:49
diff --git a/docs/doxygen/html/expint_8hpp_source.html b/docs/doxygen/html/expint_8hpp_source.html index 0179e73a7..9397c0091 100644 --- a/docs/doxygen/html/expint_8hpp_source.html +++ b/docs/doxygen/html/expint_8hpp_source.html @@ -170,7 +170,7 @@
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::expint
auto expint(dtype inX)
Definition: expint.hpp:58
nc::special::expint
auto expint(const NdArray< dtype > &inArrayX)
Definition: expint.hpp:79
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/expm1_8hpp_source.html b/docs/doxygen/html/expm1_8hpp_source.html index 794a9282e..3243e4684 100644 --- a/docs/doxygen/html/expm1_8hpp_source.html +++ b/docs/doxygen/html/expm1_8hpp_source.html @@ -151,7 +151,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::expm1
auto expm1(dtype inValue) noexcept
Definition: expm1.hpp:48
nc::exp
auto exp(dtype inValue) noexcept
Definition: exp.hpp:49
diff --git a/docs/doxygen/html/exponential_8hpp_source.html b/docs/doxygen/html/exponential_8hpp_source.html index 747ee4823..d6bb17ea8 100644 --- a/docs/doxygen/html/exponential_8hpp_source.html +++ b/docs/doxygen/html/exponential_8hpp_source.html @@ -181,7 +181,7 @@
nc::random::detail::exponential
dtype exponential(GeneratorType &generator, dtype inScaleValue=1)
Definition: exponential.hpp:56
nc::random::exponential
dtype exponential(dtype inScaleValue=1)
Definition: exponential.hpp:105
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/extreme_value_8hpp_source.html b/docs/doxygen/html/extreme_value_8hpp_source.html index baa488f81..122dae62f 100644 --- a/docs/doxygen/html/extreme_value_8hpp_source.html +++ b/docs/doxygen/html/extreme_value_8hpp_source.html @@ -205,7 +205,7 @@
nc::random::detail::extremeValue
dtype extremeValue(GeneratorType &generator, dtype inA=1, dtype inB=1)
Definition: extremeValue.hpp:56
nc::random::extremeValue
dtype extremeValue(dtype inA=1, dtype inB=1)
Definition: extremeValue.hpp:121
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/f_8hpp_source.html b/docs/doxygen/html/f_8hpp_source.html index 845efdee3..e136aad7b 100644 --- a/docs/doxygen/html/f_8hpp_source.html +++ b/docs/doxygen/html/f_8hpp_source.html @@ -205,7 +205,7 @@
nc::random::detail::f
dtype f(GeneratorType &generator, dtype inDofN, dtype inDofD)
Definition: f.hpp:58
nc::random::f
dtype f(dtype inDofN, dtype inDofD)
Definition: f.hpp:127
nc::random::generator_
static std::mt19937_64 generator_
generator function
Definition: generator.hpp:37
-
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:228
+
nc::stl_algorithms::for_each
void for_each(InputIt first, InputIt last, UnaryFunction f)
Definition: StlAlgorithms.hpp:227
nc
Definition: Coordinate.hpp:45
diff --git a/docs/doxygen/html/factorial_8hpp_source.html b/docs/doxygen/html/factorial_8hpp_source.html index b34e35489..4a071a10b 100644 --- a/docs/doxygen/html/factorial_8hpp_source.html +++ b/docs/doxygen/html/factorial_8hpp_source.html @@ -168,7 +168,7 @@
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
nc::special::factorial
double factorial(uint32 inValue)
Definition: factorial.hpp:51
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::uint32
std::uint32_t uint32
Definition: Types.hpp:40
diff --git a/docs/doxygen/html/fix_8hpp_source.html b/docs/doxygen/html/fix_8hpp_source.html index b02670110..68d42db00 100644 --- a/docs/doxygen/html/fix_8hpp_source.html +++ b/docs/doxygen/html/fix_8hpp_source.html @@ -150,7 +150,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::ceil
dtype ceil(dtype inValue) noexcept
Definition: ceil.hpp:48
nc::floor
dtype floor(dtype inValue) noexcept
Definition: floor.hpp:48
diff --git a/docs/doxygen/html/flip_8hpp_source.html b/docs/doxygen/html/flip_8hpp_source.html index 66fd80931..c72f0fde5 100644 --- a/docs/doxygen/html/flip_8hpp_source.html +++ b/docs/doxygen/html/flip_8hpp_source.html @@ -162,7 +162,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::transpose
NdArray< dtype > transpose() const
Definition: NdArrayCore.hpp:4650
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::reverse
void reverse(BidirIt first, BidirIt last) noexcept
Definition: StlAlgorithms.hpp:492
+
nc::stl_algorithms::reverse
void reverse(BidirIt first, BidirIt last) noexcept
Definition: StlAlgorithms.hpp:491
nc
Definition: Coordinate.hpp:45
nc::Axis
Axis
Enum To describe an axis.
Definition: Types.hpp:47
nc::Axis::ROW
@ ROW
diff --git a/docs/doxygen/html/floor_8hpp_source.html b/docs/doxygen/html/floor_8hpp_source.html index 4fc0e15d7..888294e14 100644 --- a/docs/doxygen/html/floor_8hpp_source.html +++ b/docs/doxygen/html/floor_8hpp_source.html @@ -149,7 +149,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::floor
dtype floor(dtype inValue) noexcept
Definition: floor.hpp:48
nc::floor
NdArray< dtype > floor(const NdArray< dtype > &inArray)
Definition: floor.hpp:65
diff --git a/docs/doxygen/html/fmax_8hpp_source.html b/docs/doxygen/html/fmax_8hpp_source.html index 3eb3fdca4..89a2b9c7a 100644 --- a/docs/doxygen/html/fmax_8hpp_source.html +++ b/docs/doxygen/html/fmax_8hpp_source.html @@ -164,7 +164,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::max
NdArray< dtype > max(const NdArray< dtype > &inArray, Axis inAxis=Axis::NONE)
Definition: max.hpp:44
nc::fmax
dtype fmax(dtype inValue1, dtype inValue2) noexcept
Definition: fmax.hpp:55
diff --git a/docs/doxygen/html/fmin_8hpp_source.html b/docs/doxygen/html/fmin_8hpp_source.html index fd0801e10..bd3553d33 100644 --- a/docs/doxygen/html/fmin_8hpp_source.html +++ b/docs/doxygen/html/fmin_8hpp_source.html @@ -164,7 +164,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::fmin
dtype fmin(dtype inValue1, dtype inValue2) noexcept
Definition: fmin.hpp:55
nc::min
NdArray< dtype > min(const NdArray< dtype > &inArray, Axis inAxis=Axis::NONE)
Definition: min.hpp:44
diff --git a/docs/doxygen/html/fmod_8hpp_source.html b/docs/doxygen/html/fmod_8hpp_source.html index 332674f0c..46f00fe22 100644 --- a/docs/doxygen/html/fmod_8hpp_source.html +++ b/docs/doxygen/html/fmod_8hpp_source.html @@ -166,7 +166,7 @@
nc::NdArray::shape
Shape shape() const noexcept
Definition: NdArrayCore.hpp:4276
nc::NdArray::cend
const_iterator cend() const noexcept
Definition: NdArrayCore.hpp:1529
nc::NdArray::begin
iterator begin() noexcept
Definition: NdArrayCore.hpp:1171
-
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:785
+
nc::stl_algorithms::transform
OutputIt transform(InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
Definition: StlAlgorithms.hpp:784
nc
Definition: Coordinate.hpp:45
nc::fmod
dtype fmod(dtype inValue1, dtype inValue2) noexcept
Definition: fmod.hpp:52
nc::fmod
NdArray< dtype > fmod(const NdArray< dtype > &inArray1, const NdArray< dtype > &inArray2)
Definition: fmod.hpp:86
diff --git a/docs/doxygen/html/functions_b.html b/docs/doxygen/html/functions_b.html index 326d89a5b..5354f09e1 100644 --- a/docs/doxygen/html/functions_b.html +++ b/docs/doxygen/html/functions_b.html @@ -117,7 +117,7 @@

- b -