|
11375 | 11375 | value-initializing or direct-initializing them
|
11376 | 11376 | with any existing object of that type.
|
11377 | 11377 | \item
|
11378 |
| -The \term{triangular solve algorithms} in \ref{linalg.algs.blas3} |
| 11378 | +The \term{triangular solve algorithms} in |
| 11379 | +\ref{linalg.algs.blas2.trsv}, |
| 11380 | +\ref{linalg.algs.blas3.trmm}, |
| 11381 | +\ref{linalg.algs.blas3.trsm}, and |
| 11382 | +\ref{linalg.algs.blas3.inplacetrsm} |
11379 | 11383 | either have
|
11380 |
| -a \tcode{BinaryDivideOp} template parameter (see \ref{linalg.algs.reqs}) and |
| 11384 | +a \tcode{BinaryDi\-videOp} template parameter (see \ref{linalg.algs.reqs}) and |
11381 | 11385 | a binary function object parameter \tcode{divide} of that type,
|
11382 | 11386 | or they have effects equivalent to invoking such an algorithm.
|
11383 | 11387 | Triangular solve algorithms interpret \tcode{divide(a, b)} as
|
|
11402 | 11406 | and any assignment
|
11403 | 11407 | is a well-formed expression.
|
11404 | 11408 | \item
|
11405 |
| -Otherwise, the function will use a sequence of evaluations of |
| 11409 | +Each function in |
| 11410 | +\ref{linalg.algs.blas1}, \ref{linalg.algs.blas2}, and \ref{linalg.algs.blas3} |
| 11411 | +that is not a triangular solve algorithm |
| 11412 | +will use a sequence of evaluations of |
11406 | 11413 | \tcode{*}, \tcode{*=}, \tcode{+}, \tcode{+=}, and \tcode{=} operators
|
11407 | 11414 | that would produce the result
|
11408 | 11415 | specified by the algorithm's \Fundescx{Effects} and \Fundescx{Remarks}
|
|
0 commit comments