Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 1 | namespace Eigen { |
| 2 | |
Benoit Jacob | 4d4a23c | 2010-06-30 10:11:55 -0400 | [diff] [blame] | 3 | /** \page TutorialBlockOperations Tutorial page 4 - %Block operations |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 4 | \ingroup Tutorial |
| 5 | |
| 6 | \li \b Previous: \ref TutorialArrayClass |
Benoit Jacob | 4d4a23c | 2010-06-30 10:11:55 -0400 | [diff] [blame] | 7 | \li \b Next: \ref TutorialAdvancedInitialization |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 8 | |
Benoit Jacob | 5a52f28 | 2010-07-01 20:52:40 -0400 | [diff] [blame] | 9 | This tutorial page explains the essentials of block operations. |
| 10 | A block is a rectangular part of a matrix or array. Blocks expressions can be used both |
| 11 | as rvalues and as lvalues. As usual with Eigen expressions, this abstraction has zero runtime cost |
| 12 | provided that you let your compiler optimize. |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 13 | |
| 14 | \b Table \b of \b contents |
Benoit Jacob | 5a52f28 | 2010-07-01 20:52:40 -0400 | [diff] [blame] | 15 | - \ref TutorialBlockOperationsUsing |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 16 | - \ref TutorialBlockOperationsSyntax |
| 17 | - \ref TutorialBlockOperationsSyntaxColumnRows |
| 18 | - \ref TutorialBlockOperationsSyntaxCorners |
| 19 | |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 20 | \section TutorialBlockOperationsUsing Using block operations |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 21 | |
| 22 | The most general block operation in Eigen is called \link DenseBase::block() .block() \endlink. |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 23 | This function returns a block of size <tt>(p,q)</tt> whose origin is at <tt>(i,j)</tt> by using |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 24 | the following syntax: |
| 25 | |
| 26 | <table class="tutorial_code" align="center"> |
| 27 | <tr><td align="center">\b Block \b operation</td> |
| 28 | <td align="center">Default \b version</td> |
| 29 | <td align="center">Optimized version when the<br>size is known at compile time</td></tr> |
Benoit Jacob | 5a52f28 | 2010-07-01 20:52:40 -0400 | [diff] [blame] | 30 | <tr><td>Block of size <tt>(p,q)</tt>, starting at <tt>(i,j)</tt></td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 31 | <td>\code |
Benoit Jacob | 5a52f28 | 2010-07-01 20:52:40 -0400 | [diff] [blame] | 32 | matrix.block(i,j,p,q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 33 | <td>\code |
Benoit Jacob | 5a52f28 | 2010-07-01 20:52:40 -0400 | [diff] [blame] | 34 | matrix.block<p,q>(i,j);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 35 | </tr> |
| 36 | </table> |
| 37 | |
| 38 | Therefore, if we want to print the values of a block inside a matrix we can simply write: |
| 39 | <table class="tutorial_code"><tr><td> |
| 40 | \include Tutorial_BlockOperations_print_block.cpp |
| 41 | </td> |
| 42 | <td> |
| 43 | Output: |
| 44 | \verbinclude Tutorial_BlockOperations_print_block.out |
| 45 | </td></tr></table> |
| 46 | |
| 47 | |
| 48 | In the previous example the \link DenseBase::block() .block() \endlink function was employed |
| 49 | to read the values inside matrix \p m . Blocks can also be used to perform operations and |
| 50 | assignments within matrices or arrays of different size: |
| 51 | |
| 52 | <table class="tutorial_code"><tr><td> |
| 53 | \include Tutorial_BlockOperations_block_assignment.cpp |
| 54 | </td> |
| 55 | <td> |
| 56 | Output: |
| 57 | \verbinclude Tutorial_BlockOperations_block_assignment.out |
| 58 | </td></tr></table> |
| 59 | |
| 60 | |
| 61 | Blocks can also be combined with matrices and arrays to create more complex expressions: |
| 62 | |
| 63 | \code |
| 64 | MatrixXf m(3,3), n(2,2); |
| 65 | MatrixXf p(3,3); |
| 66 | |
| 67 | m.block(0,0,2,2) = m.block(0,0,2,2) * n + p.block(1,1,2,2); |
| 68 | \endcode |
| 69 | |
| 70 | It is important to point out that \link DenseBase::block() .block() \endlink is the |
| 71 | general case for a block operation but there are many other useful block operations, |
| 72 | as described in the next section. |
| 73 | |
| 74 | \section TutorialBlockOperationsSyntax Block operation syntax |
| 75 | The following tables show a summary of Eigen's block operations and how they are applied to |
| 76 | fixed- and dynamic-sized Eigen objects. |
| 77 | |
| 78 | \subsection TutorialBlockOperationsSyntaxColumnRows Columns and rows |
| 79 | Other extremely useful block operations are \link DenseBase::col() .col() \endlink and |
| 80 | \link DenseBase::row() .row() \endlink which provide access to a |
| 81 | specific row or column. This is a special case in the sense that the syntax for fixed- and |
| 82 | dynamic-sized objects is exactly the same: |
| 83 | |
| 84 | <table class="tutorial_code" align="center"> |
| 85 | <tr><td align="center">\b Block \b operation</td> |
| 86 | <td align="center">Default version</td> |
| 87 | <td align="center">Optimized version when the<br>size is known at compile time</td></tr> |
| 88 | <tr><td>i<sup>th</sup> row |
| 89 | \link DenseBase::row() * \endlink</td> |
| 90 | <td>\code |
| 91 | MatrixXf m; |
| 92 | std::cout << m.row(i);\endcode </td> |
| 93 | <td>\code |
| 94 | Matrix3f m; |
| 95 | std::cout << m.row(i);\endcode </td> |
| 96 | </tr> |
| 97 | <tr><td>j<sup>th</sup> column |
| 98 | \link DenseBase::col() * \endlink</td> |
| 99 | <td>\code |
| 100 | MatrixXf m; |
| 101 | std::cout << m.col(j);\endcode </td> |
| 102 | <td>\code |
| 103 | Matrix3f m; |
| 104 | std::cout << m.col(j);\endcode </td> |
| 105 | </tr> |
| 106 | </table> |
| 107 | |
| 108 | A simple example demonstrating these feature follows: |
| 109 | |
| 110 | <table class="tutorial_code"><tr><td> |
| 111 | C++ code: |
| 112 | \include Tutorial_BlockOperations_colrow.cpp |
| 113 | </td> |
| 114 | <td> |
| 115 | Output: |
| 116 | \include Tutorial_BlockOperations_colrow.out |
| 117 | </td></tr></table> |
| 118 | |
| 119 | |
| 120 | \b NOTE: the argument for \p col() and \p row() is the index of the column or row to be accessed, |
| 121 | starting at 0. Therefore, \p col(0) will access the first column and \p col(1) the second one. |
| 122 | |
| 123 | |
| 124 | \subsection TutorialBlockOperationsSyntaxCorners Corner-related operations |
| 125 | <table class="tutorial_code" align="center"> |
| 126 | <tr><td align="center">\b Block \b operation</td> |
| 127 | <td align="center">Default version</td> |
| 128 | <td align="center">Optimized version when the<br>size is known at compile time</td></tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 129 | <tr><td>Top-left p by q block \link DenseBase::topLeftCorner() * \endlink</td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 130 | <td>\code |
| 131 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 132 | std::cout << m.topLeftCorner(p,q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 133 | <td>\code |
| 134 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 135 | std::cout << m.topLeftCorner<p,q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 136 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 137 | <tr><td>Bottom-left p by q block |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 138 | \link DenseBase::bottomLeftCorner() * \endlink</td> |
| 139 | <td>\code |
| 140 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 141 | std::cout << m.bottomLeftCorner(p,q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 142 | <td>\code |
| 143 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 144 | std::cout << m.bottomLeftCorner<p,q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 145 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 146 | <tr><td>Top-right p by q block |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 147 | \link DenseBase::topRightCorner() * \endlink</td> |
| 148 | <td>\code |
| 149 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 150 | std::cout << m.topRightCorner(p,q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 151 | <td>\code |
| 152 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 153 | std::cout << m.topRightCorner<p,q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 154 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 155 | <tr><td>Bottom-right p by q block |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 156 | \link DenseBase::bottomRightCorner() * \endlink</td> |
| 157 | <td>\code |
| 158 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 159 | std::cout << m.bottomRightCorner(p,q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 160 | <td>\code |
| 161 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 162 | std::cout << m.bottomRightCorner<p,q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 163 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 164 | <tr><td>Block containing the first q rows |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 165 | \link DenseBase::topRows() * \endlink</td> |
| 166 | <td>\code |
| 167 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 168 | std::cout << m.topRows(q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 169 | <td>\code |
| 170 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 171 | std::cout << m.topRows<q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 172 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 173 | <tr><td>Block containing the last q rows |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 174 | \link DenseBase::bottomRows() * \endlink</td> |
| 175 | <td>\code |
| 176 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 177 | std::cout << m.bottomRows(q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 178 | <td>\code |
| 179 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 180 | std::cout << m.bottomRows<q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 181 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 182 | <tr><td>Block containing the first p columns |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 183 | \link DenseBase::leftCols() * \endlink</td> |
| 184 | <td>\code |
| 185 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 186 | std::cout << m.leftCols(p);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 187 | <td>\code |
| 188 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 189 | std::cout << m.leftCols<p>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 190 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 191 | <tr><td>Block containing the last q columns |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 192 | \link DenseBase::rightCols() * \endlink</td> |
| 193 | <td>\code |
| 194 | MatrixXf m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 195 | std::cout << m.rightCols(q);\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 196 | <td>\code |
| 197 | Matrix3f m; |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 198 | std::cout << m.rightCols<q>();\endcode </td> |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 199 | </tr> |
| 200 | </table> |
| 201 | |
| 202 | |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 203 | Here is a simple example showing the power of the operations presented above: |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 204 | |
| 205 | <table class="tutorial_code"><tr><td> |
| 206 | C++ code: |
| 207 | \include Tutorial_BlockOperations_corner.cpp |
| 208 | </td> |
| 209 | <td> |
| 210 | Output: |
| 211 | \include Tutorial_BlockOperations_corner.out |
| 212 | </td></tr></table> |
| 213 | |
| 214 | |
| 215 | |
| 216 | |
| 217 | |
| 218 | |
| 219 | |
| 220 | |
| 221 | \subsection TutorialBlockOperationsSyntaxVectors Block operations for vectors |
| 222 | Eigen also provides a set of block operations designed specifically for vectors: |
| 223 | |
| 224 | <table class="tutorial_code" align="center"> |
| 225 | <tr><td align="center">\b Block \b operation</td> |
| 226 | <td align="center">Default version</td> |
| 227 | <td align="center">Optimized version when the<br>size is known at compile time</td></tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 228 | <tr><td>Block containing the first \p n elements |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 229 | \link DenseBase::head() * \endlink</td> |
| 230 | <td>\code |
| 231 | VectorXf v; |
| 232 | std::cout << v.head(n);\endcode </td> |
| 233 | <td>\code |
| 234 | Vector3f v; |
| 235 | std::cout << v.head<n>();\endcode </td> |
| 236 | </tr> |
Jitse Niesen | 3070164 | 2010-06-29 11:42:51 +0100 | [diff] [blame] | 237 | <tr><td>Block containing the last \p n elements |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 238 | \link DenseBase::tail() * \endlink</td> |
| 239 | <td>\code |
| 240 | VectorXf v; |
| 241 | std::cout << v.tail(n);\endcode </td> |
| 242 | <td>\code |
| 243 | Vector3f m; |
| 244 | std::cout << v.tail<n>();\endcode </td> |
| 245 | </tr> |
| 246 | <tr><td>Block containing \p n elements, starting at position \p i |
| 247 | \link DenseBase::segment() * \endlink</td> |
| 248 | <td>\code |
| 249 | VectorXf v; |
| 250 | std::cout << v.segment(i,n);\endcode </td> |
| 251 | <td>\code |
| 252 | Vector3f m; |
| 253 | std::cout << v.segment<n>(i);\endcode </td> |
| 254 | </tr> |
| 255 | </table> |
| 256 | |
| 257 | |
| 258 | An example is presented below: |
| 259 | <table class="tutorial_code"><tr><td> |
| 260 | C++ code: |
| 261 | \include Tutorial_BlockOperations_vector.cpp |
| 262 | </td> |
| 263 | <td> |
| 264 | Output: |
| 265 | \include Tutorial_BlockOperations_vector.out |
| 266 | </td></tr></table> |
| 267 | |
Benoit Jacob | 4d4a23c | 2010-06-30 10:11:55 -0400 | [diff] [blame] | 268 | \li \b Next: \ref TutorialAdvancedInitialization |
Carlos Becker | 97889a7 | 2010-06-28 18:42:59 +0100 | [diff] [blame] | 269 | |
| 270 | */ |
| 271 | |
| 272 | } |