1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
// SPDX-License-Identifier: Apache-2.0
//
// Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
// Copyright 2008-2016 National ICT Australia (NICTA)
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ------------------------------------------------------------------------
//! \addtogroup SizeCube
//! @{
inline
SizeCube::SizeCube(const uword in_n_rows, const uword in_n_cols, const uword in_n_slices)
: n_rows (in_n_rows )
, n_cols (in_n_cols )
, n_slices(in_n_slices)
{
arma_extra_debug_sigprint();
}
inline
uword
SizeCube::operator[](const uword dim) const
{
if(dim == 0) { return n_rows; }
if(dim == 1) { return n_cols; }
if(dim == 2) { return n_slices; }
return uword(1);
}
inline
uword
SizeCube::operator()(const uword dim) const
{
if(dim == 0) { return n_rows; }
if(dim == 1) { return n_cols; }
if(dim == 2) { return n_slices; }
arma_debug_check_bounds(true, "size(): index out of bounds");
return uword(1);
}
inline
bool
SizeCube::operator==(const SizeCube& s) const
{
if(n_rows != s.n_rows ) { return false; }
if(n_cols != s.n_cols ) { return false; }
if(n_slices != s.n_slices) { return false; }
return true;
}
inline
bool
SizeCube::operator!=(const SizeCube& s) const
{
if(n_rows != s.n_rows ) { return true; }
if(n_cols != s.n_cols ) { return true; }
if(n_slices != s.n_slices) { return true; }
return false;
}
inline
SizeCube
SizeCube::operator+(const SizeCube& s) const
{
return SizeCube( (n_rows + s.n_rows), (n_cols + s.n_cols), (n_slices + s.n_slices) );
}
inline
SizeCube
SizeCube::operator-(const SizeCube& s) const
{
const uword out_n_rows = (n_rows > s.n_rows ) ? (n_rows - s.n_rows ) : uword(0);
const uword out_n_cols = (n_cols > s.n_cols ) ? (n_cols - s.n_cols ) : uword(0);
const uword out_n_slices = (n_slices > s.n_slices) ? (n_slices - s.n_slices) : uword(0);
return SizeCube(out_n_rows, out_n_cols, out_n_slices);
}
inline
SizeCube
SizeCube::operator+(const uword val) const
{
return SizeCube( (n_rows + val), (n_cols + val), (n_slices + val) );
}
inline
SizeCube
SizeCube::operator-(const uword val) const
{
const uword out_n_rows = (n_rows > val) ? (n_rows - val) : uword(0);
const uword out_n_cols = (n_cols > val) ? (n_cols - val) : uword(0);
const uword out_n_slices = (n_slices > val) ? (n_slices - val) : uword(0);
return SizeCube(out_n_rows, out_n_cols, out_n_slices);
}
inline
SizeCube
SizeCube::operator*(const uword val) const
{
return SizeCube( (n_rows * val), (n_cols * val), (n_slices * val) );
}
inline
SizeCube
SizeCube::operator/(const uword val) const
{
return SizeCube( (n_rows / val), (n_cols / val), (n_slices / val) );
}
//! @}
|
