Skip to content

GitLab

"...git@developer.sourcefind.cn:renzhc/diffusers_dcu.git" did not exist on "368958df6f79da805bed6178b90bf1ca76e5d57b"
Commit 533b5beb authored by Davis King's avatar Davis King
Browse files

Moved the matrix subexpression stuff into its own file. 

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%402750
parent 9d42e9fa
Expand all Hide whitespace changes
Inline Side-by-side
Showing with 1359 additions and 1311 deletions
dlib/matrix.h
View file @ 533b5beb
...@@ -5,6 +5,7 @@ ...@@ -5,6 +5,7 @@
#include "matrix/matrix.h" #include "matrix/matrix.h"
#include "matrix/matrix_utilities.h" #include "matrix/matrix_utilities.h"
#include "matrix/matrix_subexp.h"
#include "matrix/matrix_math_functions.h" #include "matrix/matrix_math_functions.h"
#include "matrix/matrix_assign.h" #include "matrix/matrix_assign.h"
......
dlib/matrix/matrix_expressions.h
View file @ 533b5beb
...@@ -19,6 +19,188 @@ ...@@ -19,6 +19,188 @@
namespace dlib namespace dlib
{ {
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
// Helper templates for making operators used by expression objects
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
/*
templates for finding the max of two matrix expressions' dimensions
*/
template <typename EXP1, typename EXP2 = void, typename EXP3 = void, typename EXP4 = void>
struct max_nr;
template <typename EXP1>
struct max_nr<EXP1,void,void,void>
{
const static long val = EXP1::NR;
};
template <typename EXP1, typename EXP2>
struct max_nr<EXP1,EXP2,void,void>
{
const static long val = (EXP1::NR > EXP2::NR) ? (EXP1::NR) : (EXP2::NR);
};
template <typename EXP1, typename EXP2, typename EXP3>
struct max_nr<EXP1,EXP2,EXP3,void>
{
private:
const static long max12 = (EXP1::NR > EXP2::NR) ? (EXP1::NR) : (EXP2::NR);
public:
const static long val = (max12 > EXP3::NR) ? (max12) : (EXP3::NR);
};
template <typename EXP1, typename EXP2, typename EXP3, typename EXP4>
struct max_nr
{
private:
const static long max12 = (EXP1::NR > EXP2::NR) ? (EXP1::NR) : (EXP2::NR);
const static long max34 = (EXP3::NR > EXP4::NR) ? (EXP3::NR) : (EXP4::NR);
public:
const static long val = (max12 > max34) ? (max12) : (max34);
};
template <typename EXP1, typename EXP2 = void, typename EXP3 = void, typename EXP4 = void>
struct max_nc;
template <typename EXP1>
struct max_nc<EXP1,void,void,void>
{
const static long val = EXP1::NC;
};
template <typename EXP1, typename EXP2>
struct max_nc<EXP1,EXP2,void,void>
{
const static long val = (EXP1::NC > EXP2::NC) ? (EXP1::NC) : (EXP2::NC);
};
template <typename EXP1, typename EXP2, typename EXP3>
struct max_nc<EXP1,EXP2,EXP3,void>
{
private:
const static long max12 = (EXP1::NC > EXP2::NC) ? (EXP1::NC) : (EXP2::NC);
public:
const static long val = (max12 > EXP3::NC) ? (max12) : (EXP3::NC);
};
template <typename EXP1, typename EXP2, typename EXP3, typename EXP4>
struct max_nc
{
private:
const static long max12 = (EXP1::NC > EXP2::NC) ? (EXP1::NC) : (EXP2::NC);
const static long max34 = (EXP3::NC > EXP4::NC) ? (EXP3::NC) : (EXP4::NC);
public:
const static long val = (max12 > max34) ? (max12) : (max34);
};
// ----------------------------------------------------------------------------------------
struct has_destructive_aliasing
{
template <typename M, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M& m,
const matrix<U,iNR,iNC,MM,L>& item
) { return m.aliases(item); }
template <typename M1, typename M2, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const matrix<U,iNR,iNC,MM,L>& item
) { return m1.aliases(item) || m2.aliases(item) ; }
template <typename M1, typename M2, typename M3, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const M3& m3,
const matrix<U,iNR,iNC,MM,L>& item
) { return m1.aliases(item) || m2.aliases(item) || m3.aliases(item); }
template <typename M1, typename M2, typename M3, typename M4, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const M3& m3,
const M4& m4,
const matrix<U,iNR,iNC,MM,L>& item
) { return m1.aliases(item) || m2.aliases(item) || m3.aliases(item) || m4.aliases(item); }
};
// ----------------------------------------------------------------------------------------
struct has_nondestructive_aliasing
{
template <typename M, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M& m,
const matrix<U,iNR,iNC,MM,L>& item
) { return m.destructively_aliases(item); }
template <typename M1, typename M2, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const matrix<U,iNR,iNC, MM, L>& item
) { return m1.destructively_aliases(item) || m2.destructively_aliases(item) ; }
template <typename M1, typename M2, typename M3, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const M3& m3,
const matrix<U,iNR,iNC, MM, L>& item
) { return m1.destructively_aliases(item) || m2.destructively_aliases(item) || m3.destructively_aliases(item) ; }
template <typename M1, typename M2, typename M3, typename M4, typename U, long iNR, long iNC, typename MM, typename L >
static bool destructively_aliases (
const M1& m1,
const M2& m2,
const M3& m3,
const M4& m4,
const matrix<U,iNR,iNC, MM, L>& item
) { return m1.destructively_aliases(item) ||
m2.destructively_aliases(item) ||
m3.destructively_aliases(item) ||
m4.destructively_aliases(item) ; }
};
// ----------------------------------------------------------------------------------------
template <typename EXP1, typename EXP2 = void, typename EXP3 = void, typename EXP4 = void>
struct preserves_dimensions
{
const static long NR = max_nr<EXP1,EXP2,EXP3,EXP4>::val;
const static long NC = max_nc<EXP1,EXP2,EXP3,EXP4>::val;
typedef typename EXP1::mem_manager_type mem_manager_type;
template <typename M>
static long nr (const M& m) { return m.nr(); }
template <typename M>
static long nc (const M& m) { return m.nc(); }
template <typename M1, typename M2>
static long nr (const M1& m1, const M2& ) { return m1.nr(); }
template <typename M1, typename M2>
static long nc (const M1& m1, const M2& ) { return m1.nc(); }
template <typename M1, typename M2, typename M3>
static long nr (const M1& m1, const M2&, const M3& ) { return m1.nr(); }
template <typename M1, typename M2, typename M3>
static long nc (const M1& m1, const M2&, const M3& ) { return m1.nc(); }
template <typename M1, typename M2, typename M3, typename M4>
static long nr (const M1& m1, const M2&, const M3&, const M4& ) { return m1.nr(); }
template <typename M1, typename M2, typename M3, typename M4>
static long nc (const M1& m1, const M2&, const M3&, const M4& ) { return m1.nc(); }
};
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
// General matrix expressions that take operator structs // General matrix expressions that take operator structs
......
dlib/matrix/matrix_subexp.h 0 → 100644
View file @ 533b5beb
This diff is collapsed.
dlib/matrix/matrix_subexp_abstract.h 0 → 100644
View file @ 533b5beb
// Copyright (C) 2006 Davis E. King (davisking@users.sourceforge.net)
// License: Boost Software License See LICENSE.txt for the full license.
#undef DLIB_MATRIx_SUBEXP_ABSTRACT_
#ifdef DLIB_MATRIx_SUBEXP_ABSTRACT_
#include "matrix_abstract.h"
#include "../geometry.h"
namespace dlib
{
// ----------------------------------------------------------------------------------------
const rectangle get_rect (
const matrix_exp& m
);
/*!
ensures
- returns rectangle(0, 0, m.nc()-1, m.nr()-1)
(i.e. returns a rectangle that has the same dimensions as
the matrix m)
!*/
// ----------------------------------------------------------------------------------------
template <long start, long inc, long end>
const matrix_exp range (
);
/*!
requires
- inc > 0
ensures
- returns a matrix R such that:
- R::type == long
- R.nr() == abs(end - start)/inc + 1
- R.nc() == 1
- if (start <= end) then
- R(i) == start + i*inc
- else
- R(i) == start - i*inc
!*/
template <long start, long end>
const matrix_exp range (
) { return range<start,1,end>(); }
const matrix_exp range (
long start,
long inc,
long end
);
/*!
requires
- inc > 0
ensures
- returns a matrix R such that:
- R::type == long
- R.nr() == abs(end - start)/inc + 1
- R.nc() == 1
- if (start <= end) then
- R(i) == start + i*inc
- else
- R(i) == start - i*inc
!*/
const matrix_exp range (
long start,
long end
) { return range(start,1,end); }
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
const matrix_exp& rows,
const matrix_exp& cols,
);
/*!
requires
- rows and cols contain elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- 0 <= min(cols) && max(cols) < m.nc()
- rows.nr() == 1 || rows.nc() == 1
- cols.nr() == 1 || cols.nc() == 1
(i.e. rows and cols must be vectors)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == rows.size()
- R.nc() == cols.size()
- for all valid r and c:
R(r,c) == m(rows(r),cols(c))
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
long row,
long col,
long nr,
long nc
);
/*!
requires
- row >= 0
- row + nr <= m.nr()
- col >= 0
- col + nc <= m.nc()
ensures
- returns a matrix R such that:
- R.nr() == nr
- R.nc() == nc
- for all valid r and c:
R(r, c) == m(r+row,c+col)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
const rectangle& rect
);
/*!
requires
- get_rect(m).contains(rect) == true
(i.e. rect is a region inside the matrix m)
ensures
- returns a matrix R such that:
- R.nr() == rect.height()
- R.nc() == rect.width()
- for all valid r and c:
R(r, c) == m(r+rect.top(), c+rect.left())
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp rowm (
const matrix_exp& m,
long row
);
/*!
requires
- 0 <= row < m.nr()
ensures
- returns a matrix R such that:
- R.nr() == 1
- R.nc() == m.nc()
- for all valid i:
R(i) == m(row,i)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp rowm (
const matrix_exp& m,
const matrix_exp& rows
);
/*!
requires
- rows contains elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- rows.nr() == 1 || rows.nc() == 1
(i.e. rows must be a vector)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == rows.size()
- R.nc() == m.nc()
- for all valid r and c:
R(r,c) == m(rows(r),c)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp colm (
const matrix_exp& m,
long col
);
/*!
requires
- 0 <= col < m.nr()
ensures
- returns a matrix R such that:
- R.nr() == m.nr()
- R.nc() == 1
- for all valid i:
R(i) == m(i,col)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp colm (
const matrix_exp& m,
const matrix_exp& cols
);
/*!
requires
- cols contains elements of type long
- 0 <= min(cols) && max(cols) < m.nc()
- cols.nr() == 1 || cols.nc() == 1
(i.e. cols must be a vector)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == m.nr()
- R.nc() == cols.size()
- for all valid r and c:
R(r,c) == m(r,cols(c))
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
long row,
long col,
long nr,
long nc
);
/*!
requires
- row >= 0
- row + nr <= m.nr()
- col >= 0
- col + nc <= m.nc()
ensures
- statements of the following form:
- set_subm(m,row,col,nr,nc) = some_matrix;
result in it being the case that:
- subm(m,row,col,nr,nc) == some_matrix.
- statements of the following form:
- set_subm(m,row,col,nr,nc) = scalar_value;
result in it being the case that:
- subm(m,row,col,nr,nc) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
const rectangle& rect
);
/*!
requires
- get_rect(m).contains(rect) == true
(i.e. rect is a region inside the matrix m)
ensures
- statements of the following form:
- set_subm(m,rect) = some_matrix;
result in it being the case that:
- subm(m,rect) == some_matrix.
- statements of the following form:
- set_subm(m,rect) = scalar_value;
result in it being the case that:
- subm(m,rect) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
const matrix_exp& rows,
const matrix_exp& cols
);
/*!
requires
- rows and cols contain elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- 0 <= min(cols) && max(cols) < m.nc()
- rows.nr() == 1 || rows.nc() == 1
- cols.nr() == 1 || cols.nc() == 1
(i.e. rows and cols must be vectors)
ensures
- statements of the following form:
- set_subm(m,rows,cols) = some_matrix;
result in it being the case that:
- subm(m,rows,cols) == some_matrix.
- statements of the following form:
- set_subm(m,rows,cols) = scalar_value;
result in it being the case that:
- subm(m,rows,cols) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_rowm (
matrix& m,
long row
);
/*!
requires
- 0 <= row < m.nr()
ensures
- statements of the following form:
- set_rowm(m,row) = some_matrix;
result in it being the case that:
- rowm(m,row) == some_matrix.
- statements of the following form:
- set_rowm(m,row) = scalar_value;
result in it being the case that:
- rowm(m,row) == uniform_matrix<matrix::type>(1,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_rowm (
matrix& m,
const matrix_exp& rows
);
/*!
requires
- rows contains elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- rows.nr() == 1 || rows.nc() == 1
(i.e. rows must be a vector)
ensures
- statements of the following form:
- set_rowm(m,rows) = some_matrix;
result in it being the case that:
- rowm(m,rows) == some_matrix.
- statements of the following form:
- set_rowm(m,rows) = scalar_value;
result in it being the case that:
- rowm(m,rows) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_colm (
matrix& m,
long col
);
/*!
requires
- 0 <= col < m.nr()
ensures
- statements of the following form:
- set_colm(m,col) = some_matrix;
result in it being the case that:
- colm(m,col) == some_matrix.
- statements of the following form:
- set_colm(m,col) = scalar_value;
result in it being the case that:
- colm(m,col) == uniform_matrix<matrix::type>(nr,1,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_colm (
matrix& m,
const matrix_exp& cols
);
/*!
requires
- cols contains elements of type long
- 0 <= min(cols) && max(cols) < m.nc()
- cols.nr() == 1 || cols.nc() == 1
(i.e. cols must be a vector)
ensures
- statements of the following form:
- set_colm(m,cols) = some_matrix;
result in it being the case that:
- colm(m,cols) == some_matrix.
- statements of the following form:
- set_colm(m,cols) = scalar_value;
result in it being the case that:
- colm(m,cols) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_MATRIx_SUBEXP_ABSTRACT_
dlib/matrix/matrix_utilities.h
View file @ 533b5beb
This diff is collapsed.
dlib/matrix/matrix_utilities_abstract.h
View file @ 533b5beb
...@@ -14,7 +14,7 @@ namespace dlib ...@@ -14,7 +14,7 @@ namespace dlib
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
// Elementary matrix operations // Simple matrix utilities
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
...@@ -199,372 +199,6 @@ namespace dlib ...@@ -199,372 +199,6 @@ namespace dlib
R(r, c) == array[r][c] R(r, c) == array[r][c]
!*/ !*/
// ----------------------------------------------------------------------------------------
const rectangle get_rect (
const matrix_exp& m
);
/*!
ensures
- returns rectangle(0, 0, m.nc()-1, m.nr()-1)
(i.e. returns a rectangle that has the same dimensions as
the matrix m)
!*/
// ----------------------------------------------------------------------------------------
template <long start, long inc, long end>
const matrix_exp range (
);
/*!
requires
- inc > 0
ensures
- returns a matrix R such that:
- R::type == long
- R.nr() == abs(end - start)/inc + 1
- R.nc() == 1
- if (start <= end) then
- R(i) == start + i*inc
- else
- R(i) == start - i*inc
!*/
template <long start, long end>
const matrix_exp range (
) { return range<start,1,end>(); }
const matrix_exp range (
long start,
long inc,
long end
);
/*!
requires
- inc > 0
ensures
- returns a matrix R such that:
- R::type == long
- R.nr() == abs(end - start)/inc + 1
- R.nc() == 1
- if (start <= end) then
- R(i) == start + i*inc
- else
- R(i) == start - i*inc
!*/
const matrix_exp range (
long start,
long end
) { return range(start,1,end); }
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
const matrix_exp& rows,
const matrix_exp& cols,
);
/*!
requires
- rows and cols contain elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- 0 <= min(cols) && max(cols) < m.nc()
- rows.nr() == 1 || rows.nc() == 1
- cols.nr() == 1 || cols.nc() == 1
(i.e. rows and cols must be vectors)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == rows.size()
- R.nc() == cols.size()
- for all valid r and c:
R(r,c) == m(rows(r),cols(c))
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
long row,
long col,
long nr,
long nc
);
/*!
requires
- row >= 0
- row + nr <= m.nr()
- col >= 0
- col + nc <= m.nc()
ensures
- returns a matrix R such that:
- R.nr() == nr
- R.nc() == nc
- for all valid r and c:
R(r, c) == m(r+row,c+col)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp subm (
const matrix_exp& m,
const rectangle& rect
);
/*!
requires
- get_rect(m).contains(rect) == true
(i.e. rect is a region inside the matrix m)
ensures
- returns a matrix R such that:
- R.nr() == rect.height()
- R.nc() == rect.width()
- for all valid r and c:
R(r, c) == m(r+rect.top(), c+rect.left())
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp rowm (
const matrix_exp& m,
long row
);
/*!
requires
- 0 <= row < m.nr()
ensures
- returns a matrix R such that:
- R.nr() == 1
- R.nc() == m.nc()
- for all valid i:
R(i) == m(row,i)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp rowm (
const matrix_exp& m,
const matrix_exp& rows
);
/*!
requires
- rows contains elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- rows.nr() == 1 || rows.nc() == 1
(i.e. rows must be a vector)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == rows.size()
- R.nc() == m.nc()
- for all valid r and c:
R(r,c) == m(rows(r),c)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp colm (
const matrix_exp& m,
long col
);
/*!
requires
- 0 <= col < m.nr()
ensures
- returns a matrix R such that:
- R.nr() == m.nr()
- R.nc() == 1
- for all valid i:
R(i) == m(i,col)
!*/
// ----------------------------------------------------------------------------------------
const matrix_exp colm (
const matrix_exp& m,
const matrix_exp& cols
);
/*!
requires
- cols contains elements of type long
- 0 <= min(cols) && max(cols) < m.nc()
- cols.nr() == 1 || cols.nc() == 1
(i.e. cols must be a vector)
ensures
- returns a matrix R such that:
- R::type == the same type that was in m
- R.nr() == m.nr()
- R.nc() == cols.size()
- for all valid r and c:
R(r,c) == m(r,cols(c))
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
long row,
long col,
long nr,
long nc
);
/*!
requires
- row >= 0
- row + nr <= m.nr()
- col >= 0
- col + nc <= m.nc()
ensures
- statements of the following form:
- set_subm(m,row,col,nr,nc) = some_matrix;
result in it being the case that:
- subm(m,row,col,nr,nc) == some_matrix.
- statements of the following form:
- set_subm(m,row,col,nr,nc) = scalar_value;
result in it being the case that:
- subm(m,row,col,nr,nc) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
const rectangle& rect
);
/*!
requires
- get_rect(m).contains(rect) == true
(i.e. rect is a region inside the matrix m)
ensures
- statements of the following form:
- set_subm(m,rect) = some_matrix;
result in it being the case that:
- subm(m,rect) == some_matrix.
- statements of the following form:
- set_subm(m,rect) = scalar_value;
result in it being the case that:
- subm(m,rect) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_subm (
matrix& m,
const matrix_exp& rows,
const matrix_exp& cols
);
/*!
requires
- rows and cols contain elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- 0 <= min(cols) && max(cols) < m.nc()
- rows.nr() == 1 || rows.nc() == 1
- cols.nr() == 1 || cols.nc() == 1
(i.e. rows and cols must be vectors)
ensures
- statements of the following form:
- set_subm(m,rows,cols) = some_matrix;
result in it being the case that:
- subm(m,rows,cols) == some_matrix.
- statements of the following form:
- set_subm(m,rows,cols) = scalar_value;
result in it being the case that:
- subm(m,rows,cols) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_rowm (
matrix& m,
long row
);
/*!
requires
- 0 <= row < m.nr()
ensures
- statements of the following form:
- set_rowm(m,row) = some_matrix;
result in it being the case that:
- rowm(m,row) == some_matrix.
- statements of the following form:
- set_rowm(m,row) = scalar_value;
result in it being the case that:
- rowm(m,row) == uniform_matrix<matrix::type>(1,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_rowm (
matrix& m,
const matrix_exp& rows
);
/*!
requires
- rows contains elements of type long
- 0 <= min(rows) && max(rows) < m.nr()
- rows.nr() == 1 || rows.nc() == 1
(i.e. rows must be a vector)
ensures
- statements of the following form:
- set_rowm(m,rows) = some_matrix;
result in it being the case that:
- rowm(m,rows) == some_matrix.
- statements of the following form:
- set_rowm(m,rows) = scalar_value;
result in it being the case that:
- rowm(m,rows) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_colm (
matrix& m,
long col
);
/*!
requires
- 0 <= col < m.nr()
ensures
- statements of the following form:
- set_colm(m,col) = some_matrix;
result in it being the case that:
- colm(m,col) == some_matrix.
- statements of the following form:
- set_colm(m,col) = scalar_value;
result in it being the case that:
- colm(m,col) == uniform_matrix<matrix::type>(nr,1,scalar_value).
!*/
// ----------------------------------------------------------------------------------------
assignable_matrix_expression set_colm (
matrix& m,
const matrix_exp& cols
);
/*!
requires
- cols contains elements of type long
- 0 <= min(cols) && max(cols) < m.nc()
- cols.nr() == 1 || cols.nc() == 1
(i.e. cols must be a vector)
ensures
- statements of the following form:
- set_colm(m,cols) = some_matrix;
result in it being the case that:
- colm(m,cols) == some_matrix.
- statements of the following form:
- set_colm(m,cols) = scalar_value;
result in it being the case that:
- colm(m,cols) == uniform_matrix<matrix::type>(nr,nc,scalar_value).
!*/
// ---------------------------------------------------------------------------------------- // ----------------------------------------------------------------------------------------
template < template <
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment