| /dports/lang/guile1/guile-1.8.8/test-suite/tests/ |
| H A D | threads.test | 59 ;; n-par-for-each
65 (n-par-for-each 10 noop '())
70 (n-par-for-each 10 (lambda (n)
77 (n-par-for-each 1 (lambda (n)
84 (n-par-for-each 2 (lambda (n)
91 (n-par-for-each 3 (lambda (n)
97 ;; n-for-each-par-map
108 (n-for-each-par-map 10
116 (n-for-each-par-map 1
124 (n-for-each-par-map 2
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/cde/ |
| H A D | cde_diffcon.red | 55 for each el in dcon_temp do
76 for each el in m_n do
92 for each el in dcon do
139 for each el in dc_der do
142 for each ell in dc_extra_der do
145 for each el in dc_odd do
148 for each ell in dc_extra_der do
150 for each ell in dc_extra_odd do
174 for each el in de!* collect list(el)));
206 for each el in even_diffcon_tot do
[all …]
|
| H A D | cde_jetspace.red | 85 for each el in lm sum el;
89 for each el in lm product factorial(el);
107 temp_table_rows:=for each el in temp_m_list collect
110 for each ell in temp_table_rows join cadr ell
122 for each el in tm join
123 for each ell in dvar collect list(ell,car el);
142 % corresponding multiindex notation. Works for even (par=0) and odd (par=1)
164 for each el in l_vars do
172 for each el in svars do
199 all_mind!*:=for each el in all_mind_table!* collect car el;
[all …]
|
| H A D | cde_parametric.red | 44 l_mind:=for each el in l_var collect idtomind(par,el);
46 for each el in dep_var_temp do
49 for each ell in l_mind do
69 for each el in list_pd join
73 for each el in principal_mtable_temp do
83 % Makes a subtable for each dependent variable for which
96 for each el in split_subtable do
112 for each el in apd join nth(el,i+1)
174 for each el in templist do
222 for each el in templist do
[all …]
|
| /dports/lang/guile2/guile-2.2.7/test-suite/tests/ |
| H A D | threads.test | 103 ;; par-for-each
118 ;; n-par-for-each
124 (n-par-for-each 10 noop '())
136 (n-par-for-each 1 (lambda (n)
143 (n-par-for-each 2 (lambda (n)
150 (n-par-for-each 3 (lambda (n)
156 ;; n-for-each-par-map
170 (n-for-each-par-map 10
178 (n-for-each-par-map 1
186 (n-for-each-par-map 2
[all …]
|
| /dports/lang/guile/guile-3.0.7/test-suite/tests/ |
| H A D | threads.test | 103 ;; par-for-each
118 ;; n-par-for-each
124 (n-par-for-each 10 noop '())
136 (n-par-for-each 1 (lambda (n)
143 (n-par-for-each 2 (lambda (n)
150 (n-par-for-each 3 (lambda (n)
156 ;; n-for-each-par-map
170 (n-for-each-par-map 10
178 (n-for-each-par-map 1
186 (n-for-each-par-map 2
[all …]
|
| /dports/math/spooles/spooles.2.2/MSMD/doc/ |
| H A D | dataStructure.tex | 1 \par
3 \par
21 \par
23 \par
25 \par
30 \par
67 --- exact external degree for each vertex
70 --- approximate external degree for each vertex
77 The default value is {\tt 1}, exact external degree for each vertex.
124 \par
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2/MSMD/doc/ |
| H A D | dataStructure.tex | 1 \par
3 \par
21 \par
23 \par
25 \par
30 \par
67 --- exact external degree for each vertex
70 --- approximate external degree for each vertex
77 The default value is {\tt 1}, exact external degree for each vertex.
124 \par
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/MSMD/doc/ |
| H A D | dataStructure.tex | 1 \par
3 \par
21 \par
23 \par
25 \par
30 \par
67 --- exact external degree for each vertex
70 --- approximate external degree for each vertex
77 The default value is {\tt 1}, exact external degree for each vertex.
124 \par
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/MSMD/doc/ |
| H A D | dataStructure.tex | 1 \par
3 \par
21 \par
23 \par
25 \par
30 \par
67 --- exact external degree for each vertex
70 --- approximate external degree for each vertex
77 The default value is {\tt 1}, exact external degree for each vertex.
124 \par
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2/Pencil/doc/ |
| H A D | proto.tex | 1 \par
4 \par
47 by invoking the {\tt InpMtx\_free()} method for
99 method for each of its two matrices.
110 method for each of its two matrices.
121 method for each of its two matrices.
132 method for each of its two matrices.
143 method for each of its two matrices.
154 method for each of its two matrices.
166 method for each of its two matrices.
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/Pencil/doc/ |
| H A D | proto.tex | 1 \par
4 \par
47 by invoking the {\tt InpMtx\_free()} method for
99 method for each of its two matrices.
110 method for each of its two matrices.
121 method for each of its two matrices.
132 method for each of its two matrices.
143 method for each of its two matrices.
154 method for each of its two matrices.
166 method for each of its two matrices.
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/Pencil/doc/ |
| H A D | proto.tex | 1 \par
4 \par
47 by invoking the {\tt InpMtx\_free()} method for
99 method for each of its two matrices.
110 method for each of its two matrices.
121 method for each of its two matrices.
132 method for each of its two matrices.
143 method for each of its two matrices.
154 method for each of its two matrices.
166 method for each of its two matrices.
[all …]
|
| /dports/math/spooles/spooles.2.2/Pencil/doc/ |
| H A D | proto.tex | 1 \par
4 \par
47 by invoking the {\tt InpMtx\_free()} method for
99 method for each of its two matrices.
110 method for each of its two matrices.
121 method for each of its two matrices.
132 method for each of its two matrices.
143 method for each of its two matrices.
154 method for each of its two matrices.
166 method for each of its two matrices.
[all …]
|
| /dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/translations_docs/english/ |
| H A D | LevelRGBAIno.tex | 18 \par
24 Source\par
27 Reference\par
28 Connect the reference image to assign the strength of the effect into each pixel.\\
34 Alpha In\par
35 Allows to define the minimum and maximum values for the input pixel values\par
36 of each channel.\par
46 Alpha Out\par
48 minimum and maximum values specified here for each channel.\par
63 … \textquotedbl Out Min\textquotedbl \ and \textquotedbl Out Max\textquotedbl \ on each channel.\par
[all …]
|
| H A D | MotionWindIno.tex | 66 If Min and Max are different, the lenght of each motion line will be random, between\par
76 The default value for Min is 0, and Max is 8.573.\par
90 This seed controls the random pattern for the length.\par
104 If Min and Max are different, the decay rate of each motion line will be random,\par
107 The default value is 1 for both.\par
126 This seed controls the random pattern for the decay rate.\par
138 The default value is 1 for both.\par
151 This seed controls the random pattern for the density.\par
170 Using different values will produce different patterns for each parameter.\\
174 on each frame according to the change of the picture.\par
[all …]
|
| /dports/math/spooles/spooles.2.2/MPI/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles/spooles.2.2/MT/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2/MPI/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/MT/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/MPI/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2/MT/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/MPI/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/MT/doc/ |
| H A D | symbfac.tex | 1 \par
4 \par
10 \par
26 \par
35 \par
38 that each process computes and holds only the indices for the
54 by the owned fronts, we need to know the boundary indices for each
66 indices for each of its active fronts, so at the end of the
90 There will be one message for each supported but unowned front,
91 and one message for each unsupported front whose parent is owned.
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/src/docs/ |
| H A D | wtperf.dox | 12 workload phase consists of 8 threads running for two minutes, all
43 creation configuration value, for example, the above test can be
72 Specify a directory for all monitoring related files.
77 Specify configuration strings for the \c wtperf program.
144 post-populate compact for LSM merging activity
162 execute a read prior to each insert in workload phase
180 number of operations to group into each transaction in the populate phase, zero for auto-commit
182 number of populate threads, 1 for bulk load
188 generate random content for the value
204 …n the latency of operations is measured. One for every operation, two for every second operation, …
[all …]
|