StorageOrders.dox 4.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. namespace Eigen {
  2. /** \eigenManualPage TopicStorageOrders Storage orders
  3. There are two different storage orders for matrices and two-dimensional arrays: column-major and row-major.
  4. This page explains these storage orders and how to specify which one should be used.
  5. \eigenAutoToc
  6. \section TopicStorageOrdersIntro Column-major and row-major storage
  7. The entries of a matrix form a two-dimensional grid. However, when the matrix is stored in memory, the entries
  8. have to somehow be laid out linearly. There are two main ways to do this, by row and by column.
  9. We say that a matrix is stored in \b row-major order if it is stored row by row. The entire first row is
  10. stored first, followed by the entire second row, and so on. Consider for example the matrix
  11. \f[
  12. A = \begin{bmatrix}
  13. 8 & 2 & 2 & 9 \\
  14. 9 & 1 & 4 & 4 \\
  15. 3 & 5 & 4 & 5
  16. \end{bmatrix}.
  17. \f]
  18. If this matrix is stored in row-major order, then the entries are laid out in memory as follows:
  19. \code 8 2 2 9 9 1 4 4 3 5 4 5 \endcode
  20. On the other hand, a matrix is stored in \b column-major order if it is stored column by column, starting with
  21. the entire first column, followed by the entire second column, and so on. If the above matrix is stored in
  22. column-major order, it is laid out as follows:
  23. \code 8 9 3 2 1 5 2 4 4 9 4 5 \endcode
  24. This example is illustrated by the following Eigen code. It uses the PlainObjectBase::data() function, which
  25. returns a pointer to the memory location of the first entry of the matrix.
  26. <table class="example">
  27. <tr><th>Example</th><th>Output</th></tr>
  28. <tr><td>
  29. \include TopicStorageOrders_example.cpp
  30. </td>
  31. <td>
  32. \verbinclude TopicStorageOrders_example.out
  33. </td></tr></table>
  34. \section TopicStorageOrdersInEigen Storage orders in Eigen
  35. The storage order of a matrix or a two-dimensional array can be set by specifying the \c Options template
  36. parameter for Matrix or Array. As \ref TutorialMatrixClass explains, the %Matrix class template has six
  37. template parameters, of which three are compulsory (\c Scalar, \c RowsAtCompileTime and \c ColsAtCompileTime)
  38. and three are optional (\c Options, \c MaxRowsAtCompileTime and \c MaxColsAtCompileTime). If the \c Options
  39. parameter is set to \c RowMajor, then the matrix or array is stored in row-major order; if it is set to
  40. \c ColMajor, then it is stored in column-major order. This mechanism is used in the above Eigen program to
  41. specify the storage order.
  42. If the storage order is not specified, then Eigen defaults to storing the entry in column-major. This is also
  43. the case if one of the convenience typedefs (\c Matrix3f, \c ArrayXXd, etc.) is used.
  44. Matrices and arrays using one storage order can be assigned to matrices and arrays using the other storage
  45. order, as happens in the above program when \c Arowmajor is initialized using \c Acolmajor. Eigen will reorder
  46. the entries automatically. More generally, row-major and column-major matrices can be mixed in an expression
  47. as we want.
  48. \section TopicStorageOrdersWhich Which storage order to choose?
  49. So, which storage order should you use in your program? There is no simple answer to this question; it depends
  50. on your application. Here are some points to keep in mind:
  51. - Your users may expect you to use a specific storage order. Alternatively, you may use other libraries than
  52. Eigen, and these other libraries may expect a certain storage order. In these cases it may be easiest and
  53. fastest to use this storage order in your whole program.
  54. - Algorithms that traverse a matrix row by row will go faster when the matrix is stored in row-major order
  55. because of better data locality. Similarly, column-by-column traversal is faster for column-major
  56. matrices. It may be worthwhile to experiment a bit to find out what is faster for your particular
  57. application.
  58. - The default in Eigen is column-major. Naturally, most of the development and testing of the Eigen library
  59. is thus done with column-major matrices. This means that, even though we aim to support column-major and
  60. row-major storage orders transparently, the Eigen library may well work best with column-major matrices.
  61. */
  62. }