Lines Matching refs:a

7 One powerful way to increase the scalability of a flow graph is to nest
8 other parallel algorithms inside of node bodies. Doing so, you can use a
9 flow graph as a coordination language, expressing the most
15 ``matrix_source``, that reads a sequence of matrices from a file, two
17 new matrices by applying a function to each element, and two final
21 expressions for ``n1`` and ``n2``, a ``parallel_for`` is used to apply the functions
32          double *a = read_next_matrix();
33          if ( a ) {
34            return a;
40        function_node< double *, double * > n1( g, unlimited, [&]( double *a ) -> double * {
43            b[i] = f1(a[i]);
47        function_node< double *, double * > n2( g, unlimited, [&]( double *a ) -> double * {
50            b[i] = f2(a[i]);