|
|
|
@ -1171,7 +1171,7 @@ public: |
|
|
|
|
The method creates a full copy of the array. The original step[] is not taken into account. So, the |
|
|
|
|
array copy is a continuous array occupying total()*elemSize() bytes. |
|
|
|
|
*/ |
|
|
|
|
Mat clone() const; |
|
|
|
|
Mat clone() const CV_NODISCARD; |
|
|
|
|
|
|
|
|
|
/** @brief Copies the matrix to another one.
|
|
|
|
|
|
|
|
|
@ -2262,7 +2262,7 @@ public: |
|
|
|
|
Mat_ row(int y) const; |
|
|
|
|
Mat_ col(int x) const; |
|
|
|
|
Mat_ diag(int d=0) const; |
|
|
|
|
Mat_ clone() const; |
|
|
|
|
Mat_ clone() const CV_NODISCARD; |
|
|
|
|
|
|
|
|
|
//! overridden forms of Mat::elemSize() etc.
|
|
|
|
|
size_t elemSize() const; |
|
|
|
@ -2441,7 +2441,7 @@ public: |
|
|
|
|
static UMat diag(const UMat& d); |
|
|
|
|
|
|
|
|
|
//! returns deep copy of the matrix, i.e. the data is copied
|
|
|
|
|
UMat clone() const; |
|
|
|
|
UMat clone() const CV_NODISCARD; |
|
|
|
|
//! copies the matrix content to "m".
|
|
|
|
|
// It calls m.create(this->size(), this->type()).
|
|
|
|
|
void copyTo( OutputArray m ) const; |
|
|
|
@ -2736,7 +2736,7 @@ public: |
|
|
|
|
SparseMat& operator = (const Mat& m); |
|
|
|
|
|
|
|
|
|
//! creates full copy of the matrix
|
|
|
|
|
SparseMat clone() const; |
|
|
|
|
SparseMat clone() const CV_NODISCARD; |
|
|
|
|
|
|
|
|
|
//! copies all the data to the destination matrix. All the previous content of m is erased
|
|
|
|
|
void copyTo( SparseMat& m ) const; |
|
|
|
@ -2973,7 +2973,7 @@ public: |
|
|
|
|
SparseMat_& operator = (const Mat& m); |
|
|
|
|
|
|
|
|
|
//! makes full copy of the matrix. All the elements are duplicated
|
|
|
|
|
SparseMat_ clone() const; |
|
|
|
|
SparseMat_ clone() const CV_NODISCARD; |
|
|
|
|
//! equivalent to cv::SparseMat::create(dims, _sizes, DataType<_Tp>::type)
|
|
|
|
|
void create(int dims, const int* _sizes); |
|
|
|
|
//! converts sparse matrix to the old-style CvSparseMat. All the elements are copied
|
|
|
|
|