| /dports/math/oink/oink-c1259fe/ |
| H A D | README.md | 31 ### Tangle learning family
48 ### Fixpoint algorithms
65 ### Priority promotion family
84 ### Zielonka's recursive algorithm
108 ### Strategy improvement
121 ### Progress measures
151 ### Preprocessing
|
| /dports/devel/hpx/hpx-1.2.1/docs/sphinx/manual/ |
| H A D | writing_single_node_hpx_applications.rst | 281 .. |sequenced_execution_policy| replace:: :cpp:class:`hpx::parallel::execution::sequenced_policy`
282 …enced_task_execution_policy| replace:: :cpp:class:`hpx::parallel::execution::sequenced_task_policy`
283 .. |parallel_execution_policy| replace:: :cpp:class:`hpx::parallel::execution::parallel_policy`
284 …nced_execution_policy| replace:: :cpp:class:`hpx::parallel::execution::parallel_unsequenced_policy`
285 …rallel_task_execution_policy| replace:: :cpp:class:`hpx::parallel::execution::parallel_task_policy`
286 .. |execution_policy| replace:: :cpp:class:`hpx::parallel::v1::execution_policy`
287 .. |exception_list| replace:: :cpp:class:`hpx::exception_list`
288 .. |par_for_each| replace:: :cpp:class:`hpx::parallel::v1::for_each`
793 .. _executor_parameters:
|
| /dports/math/arb/arb-2.21.1/doc/source/ |
| H A D | acb_dft.rst | 178 Naive algorithm
201 CRT decomposition
225 Cooley-Tukey decomposition
249 Radix 2 decomposition
276 Bluestein transform
|
| /dports/graphics/py-gdal/gdal-3.3.3/doc/source/programs/ |
| H A D | gdal_grid.rst | 170 .. _gdal_grid_invdist:
172 invdist
199 invdistnn
223 average
247 nearest
263 linear
|
| /dports/graphics/p5-Geo-GDAL/gdal-3.3.3/doc/source/programs/ |
| H A D | gdal_grid.rst | 170 .. _gdal_grid_invdist:
172 invdist
199 invdistnn
223 average
247 nearest
263 linear
|
| /dports/graphics/gdal/gdal-3.3.3/doc/source/programs/ |
| H A D | gdal_grid.rst | 170 .. _gdal_grid_invdist:
172 invdist
199 invdistnn
223 average
247 nearest
263 linear
|
| /dports/science/py-pygmo2/pygmo2-2.18.0/doc/ |
| H A D | overview.rst | 70 Heuristic Global Optimization
95 Local optimization
130 Meta-algorithms
143 .. [#meta_capa] The capabilities of the meta-algorithms depend
149 .. [#auglag] The Augmented Lagrangian algorithm can be used only
152 .. _available_problems:
|
| /dports/net/libwebsockets/libwebsockets-v4.2.2/lib/jose/ |
| H A D | README.md | 23 ### Supported keys
29 ### Symmetric ciphers
33 ### Asymmetric ciphers
39 ### Payload auth and crypt
|
| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/doc/tex/inputs/dev/ |
| H A D | computationAlgorithms.tex | 19 \subsection{Matrix computation}
77 \subsection{Understanding TermMatrix operations}
86 \subsection{Vector computation}
|
| /dports/graphics/libpillowfight/libpillowfight-dae21f97de872e4ad2e94f1b0fc53302a00259fd/ |
| H A D | README.md | 214 ### Scan border
271 ### Canny's edge detection
298 ### Compare
329 ### Gaussian
363 ### Sobel operator
446 ### Unpaper's Blackfilter
473 ### Unpaper's Blurfilter
500 ### Unpaper's Border
527 ### Unpaper's Grayfilter
554 ### Unpaper's Masks
[all …]
|
| /dports/graphics/py-pypillowfight/pypillowfight-0.3.0/ |
| H A D | README.md | 214 ### Scan border
271 ### Canny's edge detection
298 ### Compare
329 ### Gaussian
363 ### Sobel operator
446 ### Unpaper's Blackfilter
473 ### Unpaper's Blurfilter
500 ### Unpaper's Border
527 ### Unpaper's Grayfilter
554 ### Unpaper's Masks
[all …]
|
| /dports/security/py-cryptography/cryptography-3.3.2/docs/hazmat/primitives/ |
| H A D | key-derivation-functions.rst | 34 PBKDF2
137 Scrypt
249 ConcatKDF
434 HKDF
629 KBKDF
782 X963KDF
|
| /dports/science/pagmo2/pagmo2-2.18.0/doc/sphinx/ |
| H A D | overview.rst | 67 Heuristic Global Optimization
115 Meta-algorithms
128 … the meta-algorithms depend also on the capabilities of the algorithms they wrap. If, for instance,
132 …ag] The Augmented Lagrangian algorithm can be used only in conjunction with other NLopt algorithms.
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/centrifugal/centrifuge/_examples/jwt_token/jwt/ |
| H A D | token_verifier_jwt.go | 73 algorithms *algorithms member
98 type algorithms struct { struct
99 HS256 jwt.Verifier
100 HS384 jwt.Verifier
101 HS512 jwt.Verifier
102 RS256 jwt.Verifier
103 RS384 jwt.Verifier
104 RS512 jwt.Verifier
151 func (s *algorithms) verify(token *jwt.Token) error {
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/ada/acats/tests/c3/ |
| H A D | c32107c.ada | 133 ORDER_CHECK : INTEGER;
134
135 BEGIN
136 ORDER_CHECK :=
137 T'POS (P1.D1) + T'POS (P1.D2) +
|
| /dports/math/py-sympy/sympy-1.9/doc/src/modules/polys/ |
| H A D | internals.rst | 298 Classical remainder sequence
365 Simplified remainder sequences
401 Subresultant sequence
|
| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki/src/main/java/de/lmu/ifi/dbs/elki/workflow/ |
| H A D | AlgorithmStep.java | 61 private List<? extends Algorithm> algorithms; field in AlgorithmStep
73 public AlgorithmStep(List<? extends Algorithm> algorithms) { in AlgorithmStep()
145 protected List<? extends Algorithm> algorithms; field in AlgorithmStep.Parameterizer
|
| /dports/security/aide/aide-0.17.4/src/ |
| H A D | hashsum.c | 48 int algorithms[] = { /* order must match hashsums array */ variable
70 int algorithms[] = { /* order must match hashsums array */ variable
|
| /dports/textproc/miller/miller-5.10.2/docs/ |
| H A D | cookbook.rst | 606 Two-pass algorithms: computation of percentages
636 Two-pass algorithms: line-number ratios
661 Two-pass algorithms: records having max value
|
| H A D | cookbook.rst.in | 320 Two-pass algorithms: computation of percentages
329 Two-pass algorithms: line-number ratios
338 Two-pass algorithms: records having max value
|
| /dports/security/digestpp/digestpp-34ff2eeae397ed744d972d86b5a20f603b029fbd/ |
| H A D | README.md | 169 ### Hash functions
197 ### Extendable output functions
|
| /dports/math/reduce/Reduce-svn5758-src/libraries/crlibm/docs/latex/ |
| H A D | trigo.tex | 15 \subsection{Exceptional cases}
56 \subsection{Range reduction}
111 \subsection{Polynomial evaluation}
128 \subsection{Reconstruction}
229 \subsection{Precision of this scheme}
236 \subsection{Organisation of the code}
|
| /dports/math/crlibm/crlibm-1.0beta4/docs/latex/ |
| H A D | trigo.tex | 15 \subsection{Exceptional cases}
56 \subsection{Range reduction}
111 \subsection{Polynomial evaluation}
128 \subsection{Reconstruction}
229 \subsection{Precision of this scheme}
236 \subsection{Organisation of the code}
|
| /dports/math/octave-forge-interval/interval-3.2.0/src/crlibm/docs/latex/ |
| H A D | trigo.tex | 38 \subsection{Exceptional cases}
79 \subsection{Range reduction}
134 \subsection{Polynomial evaluation}
151 \subsection{Reconstruction}
252 \subsection{Precision of this scheme}
259 \subsection{Organisation of the code}
|
| /dports/devel/boost-docs/boost_1_72_0/libs/ptr_container/doc/ |
| H A D | associative_ptr_container.rst | 165 .. _`algorithms`: target
215 .. _`pointer container requirements`:
|