123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629 |
- <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
- "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
- <html xmlns="http://www.w3.org/1999/xhtml">
- <head>
- <meta name="generator" content=
- "HTML Tidy for Linux/x86 (vers 1st March 2004), see www.w3.org" />
- <meta http-equiv="Content-Type" content=
- "text/html; charset=us-ascii" />
- <link rel="stylesheet" href="../../../../boost.css" type="text/css"/>
- <link rel="stylesheet" href="ublas.css" type="text/css" />
- <script type="text/javascript" src="js/jquery-1.3.2.min.js" async="async" ></script>
- <script type="text/javascript" src="js/jquery.toc-gw.js" async="async" ></script>
- <script type="text/x-mathjax-config">
- MathJax.Hub.Config({
- jax: ["input/TeX", "output/HTML-CSS"],
- extensions: ["tex2jax.js"],
- "HTML-CSS": { preferredFont: "TeX", availableFonts: ["STIX","TeX"], scale: "70" },
- tex2jax: {
- inlineMath: [ ["$", "$"], ["\\(","\\)"] ],
- displayMath: [ ["$$","$$"], ["\\[", "\\]"] ],
- processEscapes: true,
- ignoreClass: "tex2jax_ignore|dno" },
- TeX: { noUndefined: { attributes: { mathcolor: "red", mathbackground: "#FFEEEE", mathsize: "90%" } } },
- messageStyle: "none"
- });
- </script>
- <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js"></script>
- <title>Container Concepts</title>
- </head>
- <body>
- <h1><img src="../../../../boost.png" align="middle" />Container Concepts</h1>
- <div class="toc" id="toc"></div>
- <h2><a name="vector"></a>Vector</h2>
- <h4>Description</h4>
- <p>A Vector describes common aspects of dense, packed and sparse
- vectors.</p>
- <h4>Refinement of</h4>
- <p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>,
- <a href="expression_concept.html#vector_expression">Vector Expression</a>
- <a href="#vector_expression_note">[1]</a>.</p>
- <h4>Associated types</h4>
- <p>In addition to the types defined by <a href="expression_concept.html#vector_expression">Vector Expression</a></p>
- <table border="1" summary="types">
- <tbody>
- <tr>
- <td>Public base</td>
- <td>vector_container<V></td>
- <td>V must be derived from this public base type.</td>
- </tr>
- <tr>
- <td>Storage array</td>
- <td>V::array_type</td>
- <td>
- Dense Vector ONLY. The type of underlying storage array used to store the elements. The array_type must model the
- <a href="storage_concept.html"><b>Storage</b></a> concept.</td>
- </tr>
- </tbody>
- </table>
- <h4>Notation</h4>
- <table border="0" summary="notation">
- <tbody>
- <tr>
- <td><code>V</code></td>
- <td>A type that is a model of Vector</td>
- </tr>
- <tr>
- <td><code>v</code></td>
- <td>Objects of type <code>V</code></td>
- </tr>
- <tr>
- <td><code>n, i</code></td>
- <td>Objects of a type convertible to <code>size_type</code></td>
- </tr>
- <tr>
- <td><code>t</code></td>
- <td>Object of a type convertible to <code>value_type</code></td>
- </tr>
- <tr>
- <td><code>p</code></td>
- <td>Object of a type convertible to <code>bool</code></td>
- </tr>
- </tbody>
- </table>
- <h4>Definitions</h4>
- <h4>Valid expressions</h4>
- <p>In addition to the expressions defined in <a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>,
- <a href="expression_concept.html#vector_expression">Vector Expression</a> the following expressions must be valid.</p>
- <table border="1" summary="expressions">
- <tbody>
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Type requirements</th>
- <th>Return type</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>V v (n)</code></td>
- <td> </td>
- <td><code>V</code></td>
- </tr>
- <tr>
- <td>Insert</td>
- <td><code>v.insert_element (i, t)</code></td>
- <td><code>v</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Erase</td>
- <td><code>v.erase_element (i)</code></td>
- <td><code>v</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>v.clear ()</code></td>
- <td><code>v</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>v.resize (n)</code><br />
- <code>v.resize (n, p)</code></td>
- <td><code>v</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>v.data()</code></td>
- <td><code>v</code> is mutable and Dense.</td>
- <td><code>array_type&</code> if <code>v</code> is mutable, <code>const array_type&</code> otherwise</td>
- </tr>
- </tbody>
- </table>
- <h4>Expression semantics</h4>
- <p>Semantics of an expression is defined only where it differs
- from, or is not defined in <a href=
- "expression_concept.html#vector_expression">Vector Expression</a> .</p>
- <table border="1" summary="semantics">
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Precondition</th>
- <th>Semantics</th>
- <th>Postcondition</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>V v (n)</code></td>
- <td><code>n >= 0</code></td>
- <td>Allocates a vector of<code>n</code> elements.</td>
- <td><code>v.size () == n</code>.</td>
- </tr>
- <tr>
- <td>Element access <a href="#element_access_note">[2]</a></td>
- <td><code>v[n]</code></td>
- <td><code>0<n>v.size()</code></td>
- <td>returns the n-th element in v</td>
- <td> </td>
- </tr>
- <tr>
- <td>Insert</td>
- <td><code>v.insert_element (i, t)</code></td>
- <td><code>0 <= i < v.size ()</code>.</td>
- <td>Inserts an element at <code>v (i)</code> with value <code>t</code>.
- The storage requirement of the Vector may be increased.</td>
- <td><code>v (i)</code> is equal to <code>t</code>.</td>
- </tr>
- <tr>
- <td>Erase</td>
- <td><code>v.erase_element (i)</code></td>
- <td><code>0 <= i < v.size ()</code></td>
- <td>Destroys the element as <code>v (i)</code> and replaces it with the default
- <code>value_type ()</code>.
- The storage requirement of the Vector may be decreased.</td>
- <td><code>v (i)</code> is equal to <code>value_type ()</code>.</td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>v.clear ()</code></td>
- <td> </td>
- <td>Equivalent to<br />
- <code>for (i = 0; i < v.size (); ++ i)</code><br />
- <code>v.erase_element (i);</code></td>
- <td> </td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>v.resize (n)
- <br />v.resize (n, p)</code></td>
- <td> </td>
- <td>Reallocates the vector so that it can hold <code>n</code>
- elements.<br />
- Erases or appends elements in order to bring the vector to the prescribed size. Appended elements copies of <code>value_type()</code>.
- <br />
- When <code>p == false</code> then existing elements are not preserved and elements will not appended as normal. Instead the vector is in the same state as that after an equivalent sizing constructor.</td>
- <td><code>v.size () == n</code>.</td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>v.data()</code></td>
- <td></td>
- <td>Returns a reference to the underlying dense storage.</td>
- <td> </td>
- </tr>
- </table>
- <h4>Complexity guarantees</h4>
- <p>The run-time complexity of the sizing constructor is linear in
- the vector's size.</p>
- <p>The run-time complexity of insert_element and erase_element is specific for the
- Vector model and it depends on increases/decreases in storage requirements.</p>
- <p>The run-time complexity of resize is linear in the vector's
- size.</p>
- <h4>Invariants</h4>
- <h4>Models</h4>
- <ul>
- <li><code>vector</code>, <code>bounded_vector</code>, <code>c_vector</code></li>
- <li><code>unit_vector</code>, <code>zero_vector</code>, <code>scalar_vector</code></li>
- <li><code>mapped_vector;</code>, <code>compressed_vector</code>, <code>coordinate_vector</code></li>
- </ul>
- <h4>Notes</h4>
- <p><a name="vector_expression_note">[1]</a>
- As a user you need not care about <tt>Vector</tt> being a refinement of the VectorExpression. Being a refinement of the VectorExpression is only important for the template-expression engine but not the user.</p>
- <p><a name="element_access_note">[2]</a>
- The <code>operator[]</code> is added purely for convenience
- and compatibility with the <code>std::vector</code>. In uBLAS however,
- generally <code>operator()</code> is used for indexing because this can be
- used for both vectors and matrices.</p>
- <hr>
- <!--......................................................................-->
- <h2><a name="matrix"></a>Matrix</h2>
- <h4>Description</h4>
- <p>A Matrix describes common aspects of dense, packed and sparse
- matrices.</p>
- <h4>Refinement of</h4>
- <p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>,
- <a href="expression_concept.html#matrix_expression">Matrix Expression</a>
- <a href="#matrix_expression_note">[1]</a>
- .</p>
- <h4>Associated types</h4>
- <p>In addition to the types defined by <a href="expression_concept.html#matrix_expression">Matrix Expression</a></p>
- <table border="1" summary="types">
- <tbody>
- <tr>
- <td>Public base</td>
- <td>matrix_container<M></td>
- <td>M must be derived from this public base type.</td>
- </tr>
- <tr>
- <td>Storage array</td>
- <td>M::array_type</td>
- <td>Dense Matrix ONLY. The type of underlying storage array used to store the elements. The array_type must model
- the <a href="storage_concept.html"><b>Storage</b></a> concept.</td>
- </tr>
- </tbody>
- </table>
- <h4>Notation</h4>
- <table border="0" summary="notation">
- <tbody>
- <tr>
- <td><code>M</code></td>
- <td>A type that is a model of Matrix</td>
- </tr>
- <tr>
- <td><code>m</code></td>
- <td>Objects of type <code>M</code></td>
- </tr>
- <tr>
- <td><code>n1, n2, i, j</code></td>
- <td>Objects of a type convertible to <code>size_type</code></td>
- </tr>
- <tr>
- <td><code>t</code></td>
- <td>Object of a type convertible to <code>value_type</code></td>
- </tr>
- <tr>
- <td><code>p</code></td>
- <td>Object of a type convertible to <code>bool</code></td>
- </tr>
- </tbody>
- </table>
- <h4>Definitions</h4>
- <h4>Valid expressions</h4>
- <p>In addition to the expressions defined in <a href=
- "expression_concept.html#matrix_expression">Matrix Expression</a> the
- following expressions must be valid.</p>
- <table border="1" summary="expressions">
- <tbody>
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Type requirements</th>
- <th>Return type</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>M m (n1, n2)</code></td>
- <td> </td>
- <td><code>M</code></td>
- </tr>
- <tr>
- <td>Insert</td>
- <td><code>m.insert_element (i, j, t)</code></td>
- <td><code>m</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Erase</td>
- <td><code>m.erase_element (i, j)</code></td>
- <td><code>m</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>m.clear ()</code></td>
- <td><code>m</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>m.resize (n1, n2)</code><br />
- <code>m.resize (n1, n2, p)</code></td>
- <td><code>m</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>m.data()</code></td>
- <td><code>m</code> is mutable and Dense.</td>
- <td><code>array_type&</code> if <code>m</code> is mutable, <code>const array_type&</code> otherwise</td>
- </tr>
- </tbody>
- </table>
- <h4>Expression semantics</h4>
- <p>Semantics of an expression is defined only where it differs
- from, or is not defined in <a href=
- "expression_concept.html#matrix_expression">Matrix Expression</a> .</p>
- <table border="1" summary="semantics">
- <tbody>
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Precondition</th>
- <th>Semantics</th>
- <th>Postcondition</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>M m (n1, n2)</code></td>
- <td><code>n1 >= 0</code> and <code>n2 >= 0</code></td>
- <td>Allocates a matrix of <code>n1</code> rows and <code>n2</code>
- columns.</td>
- <td><code>m.size1 () == n1</code> and <code>m.size2 () ==
- n2</code>.</td>
- </tr>
- <tr>
- <td>Insert</td>
- <td><code>m.insert_element (i, j, t)</code></td>
- <td><code>0 <= i < m.size1 ()</code>,<br />
- <code>0 <= j < m.size2 ()</code>.</td>
- <td>Inserts an element at <code>m (i, j)</code> with value <code>t</code>.
- The storage requirement of the Matrix may be increased.</td>
- <td><code>m (i, j)</code> is equal to <code>t</code>.</td>
- </tr>
- <tr>
- <td>Erase</td>
- <td><code>m.erase_element (i, j)</code></td>
- <td><code>0 <= i < m.size1 ()</code>and <code><br />
- 0 <= j < m.size2</code></td>
- <td>Destroys the element as <code>m (i, j)</code> and replaces it with the default
- <code>value_type ()</code>.
- The storage requirement of the Matrix may be decreased.</td>
- <td><code>m (i, j)</code> is equal to <code>value_type ()</code>.</td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>m.clear ()</code></td>
- <td> </td>
- <td>Equivalent to<br />
- <code>for (i = 0; i < m.size1 (); ++ i)</code><br />
- <code>for (j = 0; j < m.size2 (); ++ j)</code><br />
- <code>m.erase_element (i, j);</code></td>
- <td> </td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>m.resize (n1, n2)
- <br />
- m.resize (n1, n2, p)
- </code></td>
- <td> </td>
- <td>Reallocate the matrix so that it can hold <code>n1</code> rows
- and <code>n2</code> columns.<br />
- Erases or appends elements in order to bring the matrix to the
- prescribed size. Appended elements are <code>value_type()</code>
- copies.<br />
- When <code>p == false</code> then existing elements are not preserved and elements will not appended as normal. Instead the matrix is in the same state as that after an equivalent sizing constructor.</td>
- <td><code>m.size1 () == n1</code> and <code>m.size2 () == n2</code>.</td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>m.data()</code></td>
- <td></td>
- <td>Returns a reference to the underlying dense storage.</td>
- <td> </td>
- </tbody>
- </table>
- <h4>Complexity guarantees</h4>
- <p>The run-time complexity of the sizing constructor is quadratic
- in the matrix's size.</p>
- <p>The run-time complexity of insert_element and erase_element is specific for the
- Matrix model and it depends on increases/decreases in storage requirements.</p>
- <p>The run-time complexity of resize is quadratic in the matrix's
- size.</p>
- <h4>Invariants</h4>
- <h4>Models</h4>
- <ul>
- <li><code>matrix</code>, <code>bounded_matrix</code>, <code>c_matrix</code></li>
- <li><code>identity_matrix</code> , <code>zero_matrix</code> , <code>scalar_matrix</code></li>
- <li><code>triangular_matrix</code> , <code>symmetric_matrix</code> , <code>banded_matrix</code></li>
- <li><code>mapped_matrix</code> , <code>compressed_matrix</code> , <code>coordinate_matrix</code></li>
- </ul>
- <h4>Notes</h4>
- <p><a name="matrix_expression_note">[1]</a>
- As a user you need not care about <tt>Matrix</tt> being a refinement of the MatrixExpression. Being a refinement of the MatrixExpression is only important for the template-expression engine but not the user.</p>
- <hr>
- <!--......................................................................-->
- <h2><a name="tensor"></a>Tensor</h2>
- <h4>Description</h4>
- <p>A Tensor describes common aspects of dense multidimensional arrays.</p>
- <h4>Refinement of</h4>
- <p><a href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>,
- <a href="expression_concept.html#tensor_expression">Tensor Expression</a>
- <a href="#tensor_expression_note">[1]</a>
- .</p>
- <h4>Associated types</h4>
- <p>In addition to the types defined by <a href="expression_concept.html#tensor_expression">Tensor Expression</a></p>
- <table border="1" summary="types">
- <tbody>
- <tr>
- <td>Public base</td>
- <td><code>tensor_container<tensor_t></code></td>
- <td><code>tensor_t</code> must be derived from this public base type.</td>
- </tr>
- <tr>
- <td>Storage array</td>
- <td><code>tensor_t::array_type<code></td>
- <td>Dense tensor ONLY. The type of underlying storage array used to store the elements. The array_type must model
- the <a href="storage_concept.html"><b>Storage</b></a> concept.</td>
- </tr>
- </tbody>
- </table>
- <h4>Notation</h4>
- <table border="0" summary="notation">
- <tbody>
- <tr>
- <td><code>tensor_t</code></td>
- <td>A type that is a model of Tensor</td>
- </tr>
- <tr>
- <td><code>t</code></td>
- <td>Objects of type <code>tensor_t</code></td>
- </tr>
- <tr>
- <td><code>n1, n2, np, m1, m2, mq </code></td>
- <td>Dimension objects of a type convertible to <code>size_type</code></td>
- </tr>
- <tr>
- <td><code>i1, i2, ip, j, k </code></td>
- <td>Index objects of a type convertible to <code>size_type</code></td>
- </tr>
- <tr>
- <td><code>v</code></td>
- <td>Object of a type convertible to <code>value_type</code></td>
- </tr>
- </tbody>
- </table>
- <h4>Definitions</h4>
- <h4>Valid expressions</h4>
- <p>In addition to the expressions defined in <a href=
- "expression_concept.html#tensor_expression">Tensor Expression</a> the
- following expressions must be valid.</p>
- <table border="1" summary="expressions">
- <tbody>
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Type requirements</th>
- <th>Return type</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>T t(n1, n2, ..., np)</code></td>
- <td> </td>
- <td><code>T</code></td>
- </tr>
- <tr>
- <td>Write</td>
- <td><code>t.at(i1, i2, ..., ip)</code></td>
- <td><code>t</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Read</td>
- <td><code>t.at(i1, i2, ..., ip)</code></td>
- <td><code>t</code> is mutable.</td>
- <td><code>v</code></td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>t.clear ()</code></td>
- <td><code>t</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>t.resize(m1, m2, ... , mq)</code></td>
- <td><code>t</code> is mutable.</td>
- <td><code>void</code></td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>t.data()</code></td>
- <td><code>t</code> is mutable and dense.</td>
- <td><code>pointer</code> if <code>t</code> is mutable, <code>const_pointer</code> otherwise</td>
- </tr>
- </tbody>
- </table>
- <h4>Expression semantics</h4>
- <p>Semantics of an expression is defined only where it differs
- from, or is not defined in <a href=
- "expression_concept.html#tensor_expression">Tensor Expression</a> .</p>
- <table border="1" summary="semantics">
- <tbody>
- <tr>
- <th>Name</th>
- <th>Expression</th>
- <th>Precondition</th>
- <th>Semantics</th>
- <th>Postcondition</th>
- </tr>
- <tr>
- <td>Sizing constructor</td>
- <td><code>T t(n1, n2, ..., np)</code></td>
- <td>$n_r \geq 1$ for $1\leq 1 \leq p $</code></td>
- <td>Allocates a <code>p</code>-order tensor with dimension extents $n_1,n_2,\dots,n_p$.</td>
- <td><code>t.size(r)==nr</code> for $1\leq r \leq p$.</td>
- </tr>
- <tr>
- <td>Write</td>
- <td><code>t.at(i1,i2,...,ip)=v</code></td>
- <td>$0 \leq i_r < n_r$ for $1 \leq r \leq p$.</td>
- <td>Writes an element at multi-index position $i_1,i_2,\dots,i_p$ with value <code>v</code>.</td>
- <td><code>t(i1,i2,...,ip)</code> is equal to <code>v</code>.</td>
- <tr>
- <td>Read</td>
- <td><code>v=t.at(i1,i2,...,ip)</code></td>
- <td>$0 \leq i_r < n_r$ for $1 \leq r \leq p$.</td>
- <td>Reads the element at multi-index position $(i_1,i2_,\dots,i_p)$ and returns a value <code>v</code>.</td>
- <td><code>t(i1,i2,...,ip)</code> is equal to <code>v</code>.</td>
- </tr>
- <tr>
- <td>Clear</td>
- <td><code>t.clear()</code></td>
- <td> </td>
- <td>Removes all elements from the container.</td>
- <td> </td>
- </tr>
- <tr>
- <td>Resize</td>
- <td><code>t.resize(m1, m2, ..., mq)</code></td>
- <td>$m_r \geq 1$ for $1\leq 1 \leq q $</code></td>
- <td>Reallocate the matrix so that it can hold $m_1\times m_2\times \cdots \times m_q$ elements.<br />
- Erases or appends elements in order to bring the matrix to the
- prescribed size. Appended elements are <code>value_type()</code>
- copies.</td>
- <td><code>t.size(r) == mr</code> for $1\leq r \leq q$.</td>
- </tr>
- <tr>
- <td>Storage</td>
- <td><code>m.data()</code></td>
- <td></td>
- <td>Returns a reference to the underlying dense storage.</td>
- <td> </td>
- </tbody>
- </table>
- <h4>Complexity guarantees</h4>
- <p>The run-time complexity of contructor is linear in the tensor's size $n_1 \times n_2 \times \cdots \times n_p$.</p>
- <p>The run-time complexity of <code>write()</code> and <code>read()</code> is linear in the order of the tensor.</p>
- <p>The run-time complexity of resize is at most linear in the tensor's size $m_1 \times m_2 \times \cdots \times n_q$.</p>
- <h4>Invariants</h4>
- <h4>Models</h4>
- <ul>
- <li><code>tensor</code></li>
- </ul>
- <h4>Notes</h4>
- <p><a name="tensor_expression_note">[1]</a>
- As a user you need not care about <tt>Tensor</tt> being a refinement of the TensorExpression. Being a refinement of the TensorExpression is only important for the template-expression engine but not the user.</p>
- <hr />
- <p>
- Copyright (©) 2000-2002 Joerg Walter, Mathias Koch<br />
- Copyright (©) 2018 Cem Bassoy<br />
- Use, modification and distribution are subject to the
- Boost Software License, Version 1.0.
- (See accompanying file LICENSE_1_0.txt
- or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">
- http://www.boost.org/LICENSE_1_0.txt
- </a>).
- </p>
- <script type="text/javascript">
- (function($) {
- $('#toc').toc();
- })(jQuery);
- </script>
- </body>
- </html>
|