30#include <initializer_list>
52 template<
typename dtype,
typename Iterator>
60 const auto& ndarray = *iter++;
61 if (ndarray.shape().isnull())
68 finalShape = ndarray.shape();
70 else if (ndarray.shape().rows != finalShape.
rows)
76 finalShape.
cols += ndarray.shape().cols;
86 const auto& ndarray = *iter++;
87 const Shape theShape = ndarray.shape();
88 for (
uint32 row = 0; row < theShape.
rows; ++row)
90 for (
uint32 col = 0; col < theShape.
cols; ++col)
92 returnArray(row, colStart + col) = ndarray(row, col);
95 colStart += theShape.
cols;
111 template<
typename dtype>
114 return detail::column_stack<dtype>(inArrayList.begin(), inArrayList.end());
126 template<
typename dtype>
129 return detail::column_stack<dtype>(inArrayList.begin(), inArrayList.end());
#define THROW_INVALID_ARGUMENT_ERROR(msg)
Definition: Error.hpp:37
Holds 1D and 2D arrays, the main work horse of the NumCpp library.
Definition: NdArrayCore.hpp:139
A Shape Class for NdArrays.
Definition: Core/Shape.hpp:41
bool isnull() const noexcept
Definition: Core/Shape.hpp:115
uint32 rows
Definition: Core/Shape.hpp:44
uint32 cols
Definition: Core/Shape.hpp:45
NdArray< dtype > column_stack(Iterator begin, Iterator end)
Definition: column_stack.hpp:53
Definition: Cartesian.hpp:40
NdArray< dtype > column_stack(const std::initializer_list< NdArray< dtype > > &inArrayList)
Definition: column_stack.hpp:112
std::uint32_t uint32
Definition: Types.hpp:40