| /third_party/boost/libs/algorithm/doc/html/ |
| D | standalone_HTML.manifest | 2 algorithm/Searching.html
5 algorithm/CXX11.html
6 algorithm/CXX14.html
7 algorithm/CXX17.html
8 algorithm/Misc.html
9 algorithm/not_yet_documented_cxx17_algos.html
10 algorithm/not_yet_documented_other_algos.html
11 algorithm/reference.html
12 boost/algorithm/power_idm45573835480256.html
13 boost/algorithm/power_idm45573841300208.html
[all …]
|
| D | index.html | 4 <title>The Boost Algorithm Library</title>
7 <link rel="home" href="index.html" title="The Boost Algorithm Library">
8 <link rel="next" href="algorithm/Searching.html" title="Searching Algorithms">
20 <div class="spirit-nav"><a accesskey="n" href="algorithm/Searching.html"><img src="../../../../doc/…
24 <a name="algorithm"></a>The Boost Algorithm Library</h2></div>
30 <a name="algorithm.legal"></a><p>
39 <dt><span class="section"><a href="index.html#algorithm.description_and_rationale">Description and …
40 <dt><span class="section"><a href="algorithm/Searching.html">Searching Algorithms</a></span></dt>
42 <dt><span class="section"><a href="algorithm/Searching.html#the_boost_algorithm_library.Searching.B…
49 <dt><span class="section"><a href="algorithm/CXX11.html">C++11 Algorithms</a></span></dt>
[all …]
|
| /third_party/boost/boost/compute/ |
| D | algorithm.hpp | 16 /// Meta-header to include all Boost.Compute algorithm headers.
18 #include <boost/compute/algorithm/accumulate.hpp>
19 #include <boost/compute/algorithm/adjacent_difference.hpp>
20 #include <boost/compute/algorithm/adjacent_find.hpp>
21 #include <boost/compute/algorithm/all_of.hpp>
22 #include <boost/compute/algorithm/any_of.hpp>
23 #include <boost/compute/algorithm/binary_search.hpp>
24 #include <boost/compute/algorithm/copy.hpp>
25 #include <boost/compute/algorithm/copy_if.hpp>
26 #include <boost/compute/algorithm/copy_n.hpp>
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/ |
| D | algorithm.hpp | 16 /// Meta-header to include all Boost.Compute algorithm headers.
18 #include <boost/compute/algorithm/accumulate.hpp>
19 #include <boost/compute/algorithm/adjacent_difference.hpp>
20 #include <boost/compute/algorithm/adjacent_find.hpp>
21 #include <boost/compute/algorithm/all_of.hpp>
22 #include <boost/compute/algorithm/any_of.hpp>
23 #include <boost/compute/algorithm/binary_search.hpp>
24 #include <boost/compute/algorithm/copy.hpp>
25 #include <boost/compute/algorithm/copy_if.hpp>
26 #include <boost/compute/algorithm/copy_n.hpp>
[all …]
|
| /third_party/boost/boost/range/ |
| D | algorithm.hpp | 2 /// \file algorithm.hpp
4 /// C++ standard header file <algorithm>
35 #include <algorithm>
38 #include <boost/range/algorithm/adjacent_find.hpp>
39 #include <boost/range/algorithm/count.hpp>
40 #include <boost/range/algorithm/count_if.hpp>
41 #include <boost/range/algorithm/equal.hpp>
42 #include <boost/range/algorithm/for_each.hpp>
43 #include <boost/range/algorithm/find.hpp>
44 #include <boost/range/algorithm/find_end.hpp>
[all …]
|
| /third_party/boost/libs/range/doc/reference/ |
| D | algorithms.qbk | 8 In its most simple form a [*Range Algorithm] (or range-based algorithm) is simply an iterator-based…
11 #include <boost/range/algorithm.hpp>
42 as a template parameter to the algorithm:
57 # it is very ['*safe*] because the algorithm can verify out-of-bounds conditions and handle tricky …
83 … is complex, calling `vec.end()` several times will be more expensive than using a range algorithm.
88 [include algorithm/copy.qbk]
89 [include algorithm/copy_backward.qbk]
90 [include algorithm/fill.qbk]
91 [include algorithm/fill_n.qbk]
92 [include algorithm/generate.qbk]
[all …]
|
| /third_party/boost/libs/compute/test/ |
| D | CMakeLists.txt | 92 add_compute_test("algorithm.accumulate" test_accumulate.cpp)
93 add_compute_test("algorithm.adjacent_difference" test_adjacent_difference.cpp)
94 add_compute_test("algorithm.adjacent_find" test_adjacent_find.cpp)
95 add_compute_test("algorithm.any_all_none_of" test_any_all_none_of.cpp)
96 add_compute_test("algorithm.binary_search" test_binary_search.cpp)
97 add_compute_test("algorithm.copy" test_copy.cpp)
98 add_compute_test("algorithm.copy_type_mismatch" test_copy_type_mismatch.cpp)
99 add_compute_test("algorithm.copy_if" test_copy_if.cpp)
100 add_compute_test("algorithm.count" test_count.cpp)
101 add_compute_test("algorithm.equal" test_equal.cpp)
[all …]
|
| /third_party/boost/boost/algorithm/string/ |
| D | erase.hpp | 14 #include <boost/algorithm/string/config.hpp>
22 #include <boost/algorithm/string/find_format.hpp>
23 #include <boost/algorithm/string/finder.hpp>
24 #include <boost/algorithm/string/formatter.hpp>
27 Defines various erase algorithms. Each algorithm removes
32 namespace algorithm { namespace
36 //! Erase range algorithm
57 return ::boost::algorithm::find_format_copy( in erase_range_copy()
60 ::boost::algorithm::range_finder(SearchRange), in erase_range_copy()
61 ::boost::algorithm::empty_formatter(Input) ); in erase_range_copy()
[all …]
|
| D | replace.hpp | 14 #include <boost/algorithm/string/config.hpp>
22 #include <boost/algorithm/string/find_format.hpp>
23 #include <boost/algorithm/string/finder.hpp>
24 #include <boost/algorithm/string/formatter.hpp>
25 #include <boost/algorithm/string/compare.hpp>
28 Defines various replace algorithms. Each algorithm replaces
33 namespace algorithm { namespace
37 //! Replace range algorithm
64 return ::boost::algorithm::find_format_copy( in replace_range_copy()
67 ::boost::algorithm::range_finder(SearchRange), in replace_range_copy()
[all …]
|
| D | regex.hpp | 14 #include <boost/algorithm/string/config.hpp>
23 #include <boost/algorithm/string/find_format.hpp>
24 #include <boost/algorithm/string/regex_find_format.hpp>
25 #include <boost/algorithm/string/formatter.hpp>
26 #include <boost/algorithm/string/iter_find.hpp>
33 namespace algorithm { namespace
37 //! Find regex algorithm
65 return ::boost::algorithm::regex_finder(Rx,Flags)( in find_regex()
71 //! Replace regex algorithm
101 return ::boost::algorithm::find_format_copy( in replace_regex_copy()
[all …]
|
| D | find.hpp | 14 #include <boost/algorithm/string/config.hpp>
22 #include <boost/algorithm/string/finder.hpp>
23 #include <boost/algorithm/string/compare.hpp>
24 #include <boost/algorithm/string/constants.hpp>
33 namespace algorithm { namespace
37 //! Generic find algorithm
63 //! Find first algorithm
84 return ::boost::algorithm::find(Input, ::boost::algorithm::first_finder(Search)); in find_first()
87 //! Find first algorithm ( case insensitive )
111 … return ::boost::algorithm::find(Input, ::boost::algorithm::first_finder(Search,is_iequal(Loc))); in ifind_first()
[all …]
|
| /third_party/boost/libs/fusion/doc/html/ |
| D | quickbook_HTML.manifest | 172 fusion/algorithm.html
173 fusion/algorithm/auxiliary.html
174 fusion/algorithm/auxiliary/functions.html
175 fusion/algorithm/auxiliary/functions/copy.html
176 fusion/algorithm/auxiliary/functions/move.html
177 fusion/algorithm/auxiliary/metafunctions.html
178 fusion/algorithm/auxiliary/metafunctions/copy.html
179 fusion/algorithm/auxiliary/metafunctions/move.html
180 fusion/algorithm/iteration.html
181 fusion/algorithm/iteration/functions.html
[all …]
|
| /third_party/ltp/include/ |
| D | tst_af_alg.h | 22 * Create an AF_ALG algorithm socket.
24 * This creates an AF_ALG algorithm socket that is initially not bound to any
25 * particular algorithm. On failure, tst_brk() is called with TCONF if the
28 * @return a new AF_ALG algorithm socket
33 * Bind an AF_ALG algorithm socket to an algorithm.
35 * @param algfd An AF_ALG algorithm socket
36 * @param addr A structure which specifies the algorithm to use
39 * specified algorithm, otherwise TBROK.
44 * Bind an AF_ALG algorithm socket to an algorithm.
46 * @param algfd An AF_ALG algorithm socket
[all …]
|
| /third_party/boost/libs/range/doc/ |
| D | headers.qbk | 33 …[[`<boost/range/algorithm.hpp>` ] [every range equivalent of an STL algorithm ] [- …
34 …[[`<boost/range/algorithm_ext.hpp>` ] [every range algorithm that is an extension of the STL alg…
62 [section:algorithm Algorithm]
65 [[`<boost/range/algorithm/adjacent_find.hpp>`] [__range_algorithms_adjacent_find__]]
66 [[`<boost/range/algorithm/binary_search.hpp>`] [__range_algorithms_binary_search__]]
67 [[`<boost/range/algorithm/copy.hpp>`] [__range_algorithms_copy__]]
68 [[`<boost/range/algorithm/copy_backward.hpp>`] [__range_algorithms_copy_backward__]]
69 [[`<boost/range/algorithm/count.hpp>`] [__range_algorithms_count__]]
70 [[`<boost/range/algorithm/count_if.hpp>`] [__range_algorithms_count_if__]]
71 [[`<boost/range/algorithm/equal.hpp>`] [__range_algorithms_equal__]]
[all …]
|
| /third_party/mbedtls/include/psa/ |
| D | crypto_values.h | 58 * parameter such as a key type, algorithm, etc. is not recognized.
228 * an algorithm with a randomized result, as well as functions that
316 /** \defgroup crypto_types Key and algorithm types
403 * The key policy determines which underlying hash algorithm the key can be
408 * \c alg is the HMAC algorithm or the underlying hash algorithm. */
419 * The key policy determines which key derivation algorithm the key
442 * The key policy determines which key derivation algorithm the key can be
449 * The key policy determines which key derivation algorithm the key
457 * The key policy determines which key derivation algorithm the key
462 /** Key for a cipher, AEAD or MAC algorithm based on the AES block cipher.
[all …]
|
| /third_party/boost/libs/algorithm/doc/html/algorithm/ |
| D | reference.html | 7 <link rel="home" href="../index.html" title="The Boost Algorithm Library">
8 <link rel="up" href="../index.html" title="The Boost Algorithm Library">
10 <link rel="next" href="../boost/algorithm/power_idm45573835480256.html" title="Function template po…
23 …doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/algorithm/power_idm4557383…
27 <a name="algorithm.reference"></a>Reference</h2></div></div></div>
29 …section"><a href="reference.html#header.boost.algorithm.algorithm_hpp">Header <boost/algorithm/…
31 …an class="section"><a href="../header/boost/algorithm/apply_permutation_hpp.html">Header <boost…
32 …dt><span class="section"><a href="../header/boost/algorithm/clamp_hpp.html">Header <boost/algor…
34 …<span class="section"><a href="../header/boost/algorithm/cxx11/all_of_hpp.html">Header <boost/a…
36 …<span class="section"><a href="../header/boost/algorithm/cxx11/any_of_hpp.html">Header <boost/a…
[all …]
|
| /third_party/boost/libs/algorithm/doc/ |
| D | algorithm.qbk | 1 [library The Boost Algorithm Library
3 [id algorithm]
4 [dirname algorithm]
19 Boost.Algorithm is a collection of general purpose algorithms. While Boost contains many libraries …
25 … test cases. Knuth's _The Art of Computer Programming_ is chock-full of algorithm descriptions, to…
27 My goal is to run regular algorithm reviews, similar to the Boost library review process, but with …
31 Boost.Algorithm uses Boost.Range, Boost.Assert, Boost.Array, Boost.TypeTraits, and Boost.StaticAsse…
64 [*[^[link header.boost.algorithm.cxx11.partition_copy_hpp partition_copy] ]…
69 [*[^[link header.boost.algorithm.cxx11.copy_if_hpp copy_if] ]…
74 [*[^[link header.boost.algorithm.cxx11.copy_n_hpp copy_n] ]…
[all …]
|
| /third_party/boost/libs/algorithm/test/ |
| D | hex_test1.cpp | 11 #include <boost/algorithm/hex.hpp>
12 #include <boost/algorithm/string/case_conv.hpp>
26 boost::algorithm::hex ( *p, std::back_inserter ( one )); in test_to_hex()
27 boost::algorithm::hex ( arg, std::back_inserter ( two )); in test_to_hex()
28 boost::algorithm::hex ( arg.begin (), arg.end (), std::back_inserter ( three )); in test_to_hex()
29 four = boost::algorithm::hex ( arg ); in test_to_hex()
35 boost::algorithm::unhex ( argh.c_str (), std::back_inserter ( one )); in test_to_hex()
36 boost::algorithm::unhex ( argh, std::back_inserter ( two )); in test_to_hex()
37 boost::algorithm::unhex ( argh.begin (), argh.end (), std::back_inserter ( three )); in test_to_hex()
38 four = boost::algorithm::unhex ( argh ); in test_to_hex()
[all …]
|
| /third_party/grpc/src/core/lib/compression/ |
| D | compression.cc | 34 grpc_compression_algorithm algorithm) { in grpc_compression_algorithm_is_message() argument
35 return (algorithm >= GRPC_COMPRESS_DEFLATE && algorithm <= GRPC_COMPRESS_GZIP) in grpc_compression_algorithm_is_message()
40 int grpc_compression_algorithm_is_stream(grpc_compression_algorithm algorithm) { in grpc_compression_algorithm_is_stream() argument
41 return (algorithm == GRPC_COMPRESS_STREAM_GZIP) ? 1 : 0; in grpc_compression_algorithm_is_stream()
45 grpc_compression_algorithm* algorithm) { in grpc_compression_algorithm_parse() argument
47 *algorithm = GRPC_COMPRESS_NONE; in grpc_compression_algorithm_parse()
50 *algorithm = GRPC_COMPRESS_DEFLATE; in grpc_compression_algorithm_parse()
53 *algorithm = GRPC_COMPRESS_GZIP; in grpc_compression_algorithm_parse()
57 *algorithm = GRPC_COMPRESS_STREAM_GZIP; in grpc_compression_algorithm_parse()
64 int grpc_compression_algorithm_name(grpc_compression_algorithm algorithm, in grpc_compression_algorithm_name() argument
[all …]
|
| /third_party/boost/boost/fusion/algorithm/ |
| D | transformation.hpp | 11 #include <boost/fusion/algorithm/transformation/clear.hpp>
12 #include <boost/fusion/algorithm/transformation/erase.hpp>
13 #include <boost/fusion/algorithm/transformation/erase_key.hpp>
14 #include <boost/fusion/algorithm/transformation/filter.hpp>
15 #include <boost/fusion/algorithm/transformation/filter_if.hpp>
16 #include <boost/fusion/algorithm/transformation/insert.hpp>
17 #include <boost/fusion/algorithm/transformation/insert_range.hpp>
18 #include <boost/fusion/algorithm/transformation/join.hpp>
19 #include <boost/fusion/algorithm/transformation/pop_back.hpp>
20 #include <boost/fusion/algorithm/transformation/pop_front.hpp>
[all …]
|
| /third_party/boost/libs/algorithm/string/doc/ |
| D | Jamfile.v2 | 21 [ glob ../../../../boost/algorithm/string.hpp ]
22 [ glob ../../../../boost/algorithm/string_regex.hpp ]
24 [ glob ../../../../boost/algorithm/string/classification.hpp ]
25 [ glob ../../../../boost/algorithm/string/iterator_range.hpp ]
26 [ glob ../../../../boost/algorithm/string/sequence_traits.hpp ]
27 [ glob ../../../../boost/algorithm/string/std_containers_traits.hpp ]
28 [ glob ../../../../boost/algorithm/string/concept.hpp ]
29 [ glob ../../../../boost/algorithm/string/compare.hpp ]
30 [ glob ../../../../boost/algorithm/string/constants.hpp ]
31 [ glob ../../../../boost/algorithm/string/case_conv.hpp ]
[all …]
|
| /third_party/boost/libs/fusion/test/ |
| D | Jamfile | 28 [ run algorithm/all.cpp ]
29 [ run algorithm/any.cpp ]
30 [ run algorithm/clear.cpp ]
31 [ run algorithm/copy.cpp ]
32 [ run algorithm/count.cpp ]
33 [ run algorithm/count_if.cpp ]
34 [ run algorithm/erase.cpp ]
35 [ run algorithm/erase_key.cpp ]
36 [ run algorithm/filter.cpp ]
37 [ run algorithm/filter_if.cpp ]
[all …]
|
| /third_party/boost/libs/fusion/doc/html/fusion/ |
| D | algorithm.html | 4 <title>Algorithm</title>
10 <link rel="next" href="algorithm/auxiliary.html" title="Auxiliary">
23 …../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm/auxiliary.html">…
27 <a name="fusion.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
30 <dt><span class="section"><a href="algorithm/auxiliary.html">Auxiliary</a></span></dt>
32 <dt><span class="section"><a href="algorithm/auxiliary/functions.html">Functions</a></span></dt>
33 <dt><span class="section"><a href="algorithm/auxiliary/metafunctions.html">Metafunctions</a></span>…
35 <dt><span class="section"><a href="algorithm/iteration.html">Iteration</a></span></dt>
37 <dt><span class="section"><a href="algorithm/iteration/functions.html">Functions</a></span></dt>
38 <dt><span class="section"><a href="algorithm/iteration/metafunctions.html">Metafunctions</a></span>…
[all …]
|
| /third_party/grpc/include/grpc/ |
| D | compression.h | 33 /** Return if an algorithm is message compression algorithm. */
35 grpc_compression_algorithm algorithm);
37 /** Return if an algorithm is stream compression algorithm. */
39 grpc_compression_algorithm algorithm);
42 * algorithm. Returns 1 upon success, 0 otherwise. */
44 grpc_slice name, grpc_compression_algorithm* algorithm);
47 * algorithm. Note that \a name is statically allocated and must *not* be freed.
50 grpc_compression_algorithm algorithm, const char** name);
52 /** Returns the compression algorithm corresponding to \a level for the
59 /** Mark \a algorithm as enabled in \a opts. */
[all …]
|
| /third_party/openssl/test/ssl-tests/ |
| D | 20-cert-select.conf | 8 test-3 = 3-Ed25519 CipherString and Signature Algorithm Selection
9 test-4 = 4-Ed448 CipherString and Signature Algorithm Selection
13 test-8 = 8-P-256 CipherString and Signature Algorithm Selection
17 test-12 = 12-ECDSA Signature Algorithm Selection
18 test-13 = 13-ECDSA Signature Algorithm Selection SHA384
19 test-14 = 14-ECDSA Signature Algorithm Selection SHA1
20 test-15 = 15-ECDSA Signature Algorithm Selection compressed point
21 test-16 = 16-ECDSA Signature Algorithm Selection, no ECDSA certificate
22 test-17 = 17-RSA Signature Algorithm Selection
23 test-18 = 18-RSA-PSS Signature Algorithm Selection
[all …]
|