/dports/math/maxima/maxima-5.43.2/share/numeric/ |
H A D | simpsn.dem | 23 mode_declare([%_sum,%_a,%_b,%_dvar],float), 38 mode_declare(function(float_check),float)$ 40 (x:float(x), 72 and try F(5,1000); It should take about 13 cpu seconds. 73 Then COMPILE(F); and try it. It should then take 0.053 cpu 74 seconds, a speed up by a factor of 245. i.e. the computation
|
/dports/devel/ispc/ispc-1.16.1/docs/ |
H A D | perfguide.rst | 60 // do some computation on a[i] 81 // do some computation on a[index] 86 // do some computation on a[index] 102 // do some computation on a[i] 119 // do computation on element (i,j) 131 // do computation 145 // do computation 451 float sum(const float array[], int count) { 471 As a first try, one might try using the ``reduce_add()`` function from the 559 computation. [all …]
|
H A D | ispc.rst | 36 in hearing if you try using ispc but see results that are not as you 777 try it and send us a note with your experiences or to file a bug or feature 1206 It is an error to try to assign a ``varying`` value to a ``uniform`` 2872 expressing parallel computation in ``ispc``. 2917 // perform computation on element i 2983 some computation on an array of data. 3300 asynchronous computation from that function. 3323 and running tasks dominates the computation. 3551 try to mitigate this cost by detecting cases where it is both safe and 4683 // do computation with x, y, z [all …]
|
/dports/www/py-graphite-web/graphite-web-1.1.8/docs/releases/ |
H A D | 1_1_2.rst | 111 * Do not try merge series with different length (@deniszh, #2198) 123 * Fix hash position computation of fnv1a_ch (@DanCech, #2168) 136 * carbon line format float handling (@DanCech, #740) 150 * Fix hash position computation of fnv1a_ch (@DanCech, #717)
|
/dports/devel/xtl-quant-stack/xtl-0.7.4/docs/source/ |
H A D | basic_types.rst | 25 try 27 std::cout << xtl::any_cast<float>(a) << std::endl; 54 and gather them as complex values for computation. This allows optimzations
|
/dports/math/reduce/Reduce-svn5758-src/libraries/crlibm/gappa/trigos/ |
H A D | SinCosCase3.gappa | 14 @IEEEdouble = float<ieee_64,ne>; 46 # First, a transcription of the actual computation, which could (and 149 # All what we still need to express is that the actual computation will neglect some terms 186 # To get bounds on Msinx, try ResSinhilo 190 # To get bounds on Msina, try sah+sal 194 # To get bounds on My, try Yhl
|
/dports/math/crlibm/crlibm-1.0beta4/gappa/trigos/ |
H A D | SinCosCase3.gappa | 14 @IEEEdouble = float<ieee_64,ne>; 46 # First, a transcription of the actual computation, which could (and 149 # All what we still need to express is that the actual computation will neglect some terms 186 # To get bounds on Msinx, try ResSinhilo 190 # To get bounds on Msina, try sah+sal 194 # To get bounds on My, try Yhl
|
/dports/devel/mercurial/mercurial-6.0/tests/ |
H A D | test-contrib-perf.t | 129 perf::heads benchmark the computation of a changelog heads 164 perf::phases benchmark phasesets computation 193 benchmark the computation of various volatile set 304 malformatted run limit entry, could not convert string to float: aaa: aaa-12 (no-py3 !) 305 malformatted run limit entry, could not convert string to float: 'aaa': aaa-12 (py3 !) 409 import newer module separately in try clause for early Mercurial 412 import newer module separately in try clause for early Mercurial
|
/dports/biology/viennarna/ViennaRNA-2.4.18/src/bin/ |
H A D | RNAheat.ggo | 25 float 31 float 37 float 54 indicates to use as many parallel threads as computation cores are available.\n" 56 a time. Using this switch, a user can instead start the computation for many sequences in the\ 57 input in parallel. RNAheat will create as many parallel computation slots as specified and\ 69 "Do not try to keep output in order with input while parallel processing is in place.\n"
|
/dports/editors/kakoune/kakoune-2021.11.08/rc/filetype/ |
H A D | fsharp.kak | 52 exceptions="try|failwith|failwithf|finally|invalid_arg|raise|rethrow" 73 types="array|bool|byte|char|decimal|double|enum|exn|float" 94 # computation expression keywords prefixed with ! 131 try %{ execute-keys -draft k <a-x> s ^\h*//\h* <ret> y jgh P } 138 try %{ execute-keys -draft \; K <a-&> } 140 try %{ execute-keys -draft k <a-x> s \h+$ <ret> d } 142 try %{ execute-keys -draft <space> k <a-x> <a-k> =$ <ret> j <a-gt> } 144 try %{ execute-keys -draft <space> k <a-x> <a-k> \bdo$ <ret> j <a-gt> }
|
/dports/math/octave-forge-interval/interval-3.2.0/src/crlibm/gappa/trigos/ |
H A D | SinCosCase3.gappa | 36 @IEEEdouble = float<ieee_64,ne>; 68 # First, a transcription of the actual computation, which could (and 171 # All what we still need to express is that the actual computation will neglect some terms 208 # To get bounds on Msinx, try ResSinhilo 212 # To get bounds on Msina, try sah+sal 216 # To get bounds on My, try Yhl
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/ |
H A D | narf_feature_extraction.rst | 60 actual computation. At last, we output the number of keypoints and the number 68 float and x,y,z,roll,pitch,yaw to describe the local coordinate frame at which 95 You can also try it with a point cloud file from your hard drive::
|
H A D | adding_custom_ptype.rst | 44 float x; 45 float y; 46 float z; 88 float x; 89 float y; 90 float z; 114 float x; 180 float x; 181 float y; 593 for its nearest neighbors computation, the window size, etc). [all …]
|
/dports/biology/viennarna/ViennaRNA-2.4.18/src/RNAlocmin/ |
H A D | RNAlocmin.ggo | 20 …y (0 = nothing, 4 = full)\nWARNING: higher verbose levels increase the computation time" int defau… 39 …H, K, L, and M types (genus one) of pseudoknots are allowed (increases computation time greatly), … 56 … with low number of inwalking sample structures)\n(0.0 -> no flood; 1.0 -> try to flood all) Usabl… 61 …ort only LM, which energy is in range <MFE (or lowest found LM), MFE+eRange> in kcal/mol." float no
|
/dports/math/qtiplot-doc/qtiplot-0.9.8.9/qtiplot/src/analysis/ |
H A D | lowess.doc | 102 * idea which value to use, try F = .5. 134 * weighted regression (l.w.r.) computation is carried out at 136 * l.w.r. computation is carried out at X(I). If X(I+1) is 138 * computation is carried out at X(I+1). If X(I+1) is less 139 * than X(I)+DELTA, the next l.w.r. computation is carried out 145 * to 0.0 since the computation time will not be too great. 147 * l.w.r. computation for all points, so that much computation 151 * computation would be carried out at approximately k points. 182 * ns = max0(min0(ifix(f*float(n)),n),2) # at least two, at most n points 374 real c1, c9, alpha, denom, float [all …]
|
/dports/math/R/R-4.1.2/src/library/stats/src/ |
H A D | lowess.doc | 102 * idea which value to use, try F = .5. 134 * weighted regression (l.w.r.) computation is carried out at 136 * l.w.r. computation is carried out at X(I). If X(I+1) is 138 * computation is carried out at X(I+1). If X(I+1) is less 139 * than X(I)+DELTA, the next l.w.r. computation is carried out 145 * to 0.0 since the computation time will not be too great. 147 * l.w.r. computation for all points, so that much computation 151 * computation would be carried out at approximately k points. 182 * ns = max0(min0(ifix(f*float(n)),n),2) # at least two, at most n points 374 real c1, c9, alpha, denom, float [all …]
|
/dports/math/libRmath/R-4.1.1/src/library/stats/src/ |
H A D | lowess.doc | 102 * idea which value to use, try F = .5. 134 * weighted regression (l.w.r.) computation is carried out at 136 * l.w.r. computation is carried out at X(I). If X(I+1) is 138 * computation is carried out at X(I+1). If X(I+1) is less 139 * than X(I)+DELTA, the next l.w.r. computation is carried out 145 * to 0.0 since the computation time will not be too great. 147 * l.w.r. computation for all points, so that much computation 151 * computation would be carried out at approximately k points. 182 * ns = max0(min0(ifix(f*float(n)),n),2) # at least two, at most n points 374 real c1, c9, alpha, denom, float [all …]
|
/dports/devel/py-ipyparallel/ipyparallel-6.3.0/examples/ |
H A D | Monitoring an MPI Simulation - 2.ipynb | 30 …ault as it is more convenient for interactive control. Since the real computation will be done ov… 32 …"**Note:** if on first try the following cell gives you an error message, wait a few seconds and r… 148 …runs the entire computation. But having this simple example will be sufficient to see something t… 172 " sense, and local per-node computation. In this case the nodes only communicate when \n", 199 " # We add a small delay to simulate that a real-world computation\n", 247 " try:\n", 298 " refresh : float\n", 318 " try:\n",
|
/dports/games/openmw/openmw-openmw-0.47.0/docs/source/reference/modding/settings/ |
H A D | shadows.rst | 33 :Type: float 44 :Type: float 91 …ll but with lower quality shadows. There is also the ability to disable this computation with none. 159 If you've got a good understanding of how shadow mapping works, or you've got enough time to try a … 167 :Type: float 178 :Type: float 189 :Type: float 210 :Type: float 221 :Type: float 230 :Type: float
|
/dports/science/lammps/lammps-stable_29Sep2021/doc/src/ |
H A D | pair_python.rst | 121 The class also has to provide two methods for the computation of the 125 * rsq = the square of the distance between a pair of atoms (float) 167 computation pair-wise interactions quite significantly. However, this 180 Note that it is strongly recommended to try to **delete** the potential 205 energy computation can be correctly performed for all pairs of atom
|
/dports/deskutils/synapse/synapse-0.2.99.4/src/plugins/ |
H A D | desktop-file-plugin.vala | 125 float popularity = rs.get_application_popularity (dfm.desktop_id); 136 // try to match against global matchers and if those fail, try also exec 145 // FIXME: we need to do much smarter relevancy computation in fuzzy re 243 try
|
/dports/math/octave-forge-ltfat/ltfat/inst/thirdparty/sparsify/ |
H A D | greed_omp.m | 89 % iter_time Vector containing computation times for each iteration 254 if isa(A,'float') P =@(z) A*z; Pt =@(z) A'*z; 259 try 294 if maxM*n < 1e7 && isa(A,'float') 310 try TESTMAT2=zeros(maxM); 326 try 344 try 361 try 377 try 393 try [all …]
|
/dports/math/vinci/vinci-1.0.5/ |
H A D | manual.tex | 97 \texttt {vinci\_volume.c} & Most of the volume computation routines \\ 119 …d \texttt {gcc} by the name of your local C compiler, typically \texttt {cc}. If nothing works, try 126 If you want to use all of the volume computation algorithms you need to install 176 \texttt {numbertype} can be one of \texttt {integer}, \texttt {float} or \texttt {rational}. In the… 245 To make use of different volume computation algorithms which need different 270 Several volume computation algorithms have been implemented which are 276 programme which will try to determine a hopefully efficient method. 386 type of your volume computation problems. This can be done by editing 432 …d Jean-Bernard Lasserre for fruitful discussions concerning his volume computation method. We are … 438 \newblock Exact volume computation for polytopes: A practical study.
|
/dports/devel/py-xarray/xarray-0.20.1/doc/user-guide/ |
H A D | dask.rst | 9 computations and streaming computation on datasets that don't fit into memory. 33 Operations queue up a series of tasks mapped over blocks, and no computation is 36 and computation proceeds in a streaming fashion, block-by-block. 38 The actual computation is controlled by a multi-processing or thread pool, 161 Nearly all existing xarray methods (including those for indexing, computation, 222 On a single machine :py:meth:`~xarray.Dataset.persist` will try to load all of 228 …ask documentation <https://distributed.readthedocs.io/en/latest/manage-computation.html#dask-colle… 252 along a particular dimension, an exception is raised when you try to access 348 output_dtypes=[float], 453 Note that we use ``.load(scheduler="single-threaded")`` to execute the computation. [all …]
|
/dports/math/minizinc/libminizinc-2.5.5/ |
H A D | changes.rst | 262 - Don't try to access array dimensions for output of empty 1106 - Fix bounds computation for calls. 1221 - Fix bounds computation for float variable declarations. 1362 - Fix ceil builtin for float values. 1457 - Fix bounds computation of par int and float arrays. 1654 - Fix a bug in the computation of int and float bounds that could 1720 - Fix the bounds computation for integer and float variables, which 1778 - Fix computation of float array access bounds. 2113 - Fix bounds computation for set difference 2166 - Improve bounds computation for float variables [all …]
|