| /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 …]
|
| /third_party/boost/boost/algorithm/string/ |
| D | erase.hpp | 32 namespace algorithm { namespace
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()
75 return ::boost::algorithm::find_format_copy( in erase_range_copy()
77 ::boost::algorithm::range_finder(SearchRange), in erase_range_copy()
78 ::boost::algorithm::empty_formatter(Input) ); in erase_range_copy()
96 ::boost::algorithm::find_format( in erase_range()
98 ::boost::algorithm::range_finder(SearchRange), in erase_range()
99 ::boost::algorithm::empty_formatter(Input) ); in erase_range()
[all …]
|
| D | replace.hpp | 33 namespace algorithm { namespace
64 return ::boost::algorithm::find_format_copy( in replace_range_copy()
67 ::boost::algorithm::range_finder(SearchRange), in replace_range_copy()
68 ::boost::algorithm::const_formatter(Format)); in replace_range_copy()
83 return ::boost::algorithm::find_format_copy( in replace_range_copy()
85 ::boost::algorithm::range_finder(SearchRange), in replace_range_copy()
86 ::boost::algorithm::const_formatter(Format)); in replace_range_copy()
106 ::boost::algorithm::find_format( in replace_range()
108 ::boost::algorithm::range_finder(SearchRange), in replace_range()
109 ::boost::algorithm::const_formatter(Format)); in replace_range()
[all …]
|
| D | regex.hpp | 33 namespace algorithm { namespace
65 return ::boost::algorithm::regex_finder(Rx,Flags)( in find_regex()
101 return ::boost::algorithm::find_format_copy( in replace_regex_copy()
104 ::boost::algorithm::regex_finder( Rx, Flags ), in replace_regex_copy()
105 ::boost::algorithm::regex_formatter( Format, Flags ) ); in replace_regex_copy()
123 return ::boost::algorithm::find_format_copy( in replace_regex_copy()
125 ::boost::algorithm::regex_finder( Rx, Flags ), in replace_regex_copy()
126 ::boost::algorithm::regex_formatter( Format, Flags ) ); in replace_regex_copy()
150 ::boost::algorithm::find_format( in replace_regex()
152 ::boost::algorithm::regex_finder( Rx, Flags ), in replace_regex()
[all …]
|
| D | find.hpp | 33 namespace algorithm { namespace
84 return ::boost::algorithm::find(Input, ::boost::algorithm::first_finder(Search)); in find_first()
111 … return ::boost::algorithm::find(Input, ::boost::algorithm::first_finder(Search,is_iequal(Loc))); in ifind_first()
137 return ::boost::algorithm::find(Input, ::boost::algorithm::last_finder(Search)); in find_last()
164 … return ::boost::algorithm::find(Input, ::boost::algorithm::last_finder(Search, is_iequal(Loc))); in ifind_last()
192 return ::boost::algorithm::find(Input, ::boost::algorithm::nth_finder(Search,Nth)); in find_nth()
223 … return ::boost::algorithm::find(Input, ::boost::algorithm::nth_finder(Search,Nth,is_iequal(Loc))); in ifind_nth()
253 return ::boost::algorithm::find(Input, ::boost::algorithm::head_finder(N)); in find_head()
284 return ::boost::algorithm::find(Input, ::boost::algorithm::tail_finder(N)); in find_tail()
314 … return ::boost::algorithm::find(Input, ::boost::algorithm::token_finder(Pred, eCompress)); in find_token()
[all …]
|
| D | trim.hpp | 39 namespace algorithm { namespace
69 ::boost::algorithm::detail::trim_begin( in trim_left_copy_if()
87 ::boost::algorithm::detail::trim_begin( in trim_left_copy_if()
109 ::boost::algorithm::trim_left_copy_if( in trim_left_copy()
128 ::boost::algorithm::detail::trim_begin( in trim_left_if()
145 ::boost::algorithm::trim_left_if( in trim_left()
178 ::boost::algorithm::detail::trim_end( in trim_right_copy_if()
196 ::boost::algorithm::detail::trim_end( in trim_right_copy_if()
218 ::boost::algorithm::trim_right_copy_if( in trim_right_copy()
237 ::boost::algorithm::detail::trim_end( in trim_right_if()
[all …]
|
| D | case_conv.hpp | 33 namespace algorithm { namespace
60 return ::boost::algorithm::detail::transform_range_copy( in to_lower_copy()
63 ::boost::algorithm::detail::to_lowerF< in to_lower_copy()
76 return ::boost::algorithm::detail::transform_range_copy<SequenceT>( in to_lower_copy()
78 ::boost::algorithm::detail::to_lowerF< in to_lower_copy()
95 ::boost::algorithm::detail::transform_range( in to_lower()
97 ::boost::algorithm::detail::to_lowerF< in to_lower()
125 return ::boost::algorithm::detail::transform_range_copy( in to_upper_copy()
128 ::boost::algorithm::detail::to_upperF< in to_upper_copy()
141 return ::boost::algorithm::detail::transform_range_copy<SequenceT>( in to_upper_copy()
[all …]
|
| D | predicate.hpp | 39 namespace algorithm { namespace
96 return ::boost::algorithm::starts_with(Input, Test, is_equal()); in starts_with()
118 return ::boost::algorithm::starts_with(Input, Test, is_iequal(Loc)); in istarts_with()
173 return ::boost::algorithm::ends_with(Input, Test, is_equal()); in ends_with()
195 return ::boost::algorithm::ends_with(Input, Test, is_iequal(Loc)); in iends_with()
229 …bool bResult=(::boost::algorithm::first_finder(lit_test,Comp)(::boost::begin(lit_input), ::boost::… in contains()
242 return ::boost::algorithm::contains(Input, Test, is_equal()); in contains()
263 return ::boost::algorithm::contains(Input, Test, is_iequal(Loc)); in icontains()
323 return ::boost::algorithm::equals(Input, Test, is_equal()); in equals()
347 return ::boost::algorithm::equals(Input, Test, is_iequal(Loc)); in iequals()
[all …]
|
| D | split.hpp | 35 namespace algorithm { namespace
71 return ::boost::algorithm::iter_find( in find_all()
74 ::boost::algorithm::first_finder(Search) ); in find_all()
111 return ::boost::algorithm::iter_find( in ifind_all()
114 ::boost::algorithm::first_finder(Search, is_iequal(Loc) ) ); in ifind_all()
158 return ::boost::algorithm::iter_split( in split()
161 ::boost::algorithm::token_finder( Pred, eCompress ) ); in split()
167 using algorithm::find_all;
168 using algorithm::ifind_all;
169 using algorithm::split;
|
| D | classification.hpp | 30 namespace algorithm { namespace
295 using algorithm::is_classified;
296 using algorithm::is_space;
297 using algorithm::is_alnum;
298 using algorithm::is_alpha;
299 using algorithm::is_cntrl;
300 using algorithm::is_digit;
301 using algorithm::is_graph;
302 using algorithm::is_lower;
303 using algorithm::is_upper;
[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/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/libs/range/doc/reference/ |
| D | algorithms.qbk | 8 …st simple form a [*Range Algorithm] (or range-based algorithm) is simply an iterator-based algorit…
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/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 …]
|
| D | compression_internal.cc | 61 grpc_message_compression_algorithm algorithm) { in grpc_message_compression_encoding_mdelem() argument
62 switch (algorithm) { in grpc_message_compression_encoding_mdelem()
76 grpc_stream_compression_algorithm algorithm) { in grpc_stream_compression_encoding_mdelem() argument
77 switch (algorithm) { in grpc_stream_compression_encoding_mdelem()
135 grpc_compression_algorithm* algorithm, in grpc_compression_algorithm_from_message_stream_compression_algorithm() argument
140 *algorithm = GRPC_COMPRESS_NONE; in grpc_compression_algorithm_from_message_stream_compression_algorithm()
146 *algorithm = GRPC_COMPRESS_NONE; in grpc_compression_algorithm_from_message_stream_compression_algorithm()
149 *algorithm = GRPC_COMPRESS_STREAM_GZIP; in grpc_compression_algorithm_from_message_stream_compression_algorithm()
152 *algorithm = GRPC_COMPRESS_NONE; in grpc_compression_algorithm_from_message_stream_compression_algorithm()
158 *algorithm = GRPC_COMPRESS_NONE; in grpc_compression_algorithm_from_message_stream_compression_algorithm()
[all …]
|
| D | compression_args.cc | 54 grpc_channel_args* a, grpc_compression_algorithm algorithm) { in grpc_channel_args_set_channel_default_compression_algorithm() argument
55 GPR_ASSERT(algorithm < GRPC_COMPRESS_ALGORITHMS_COUNT); in grpc_channel_args_set_channel_default_compression_algorithm()
59 tmp.value.integer = algorithm; in grpc_channel_args_set_channel_default_compression_algorithm()
86 grpc_channel_args** a, grpc_compression_algorithm algorithm, int state) { in grpc_channel_args_compression_algorithm_set_state() argument
93 algorithm && in grpc_channel_args_compression_algorithm_set_state()
96 GPR_ASSERT(grpc_compression_algorithm_name(algorithm, &algo_name) != 0); in grpc_channel_args_compression_algorithm_set_state()
103 GPR_BITSET((unsigned*)states_arg, algorithm); in grpc_channel_args_compression_algorithm_set_state()
104 } else if (algorithm != GRPC_COMPRESS_NONE) { in grpc_channel_args_compression_algorithm_set_state()
105 GPR_BITCLEAR((unsigned*)states_arg, algorithm); in grpc_channel_args_compression_algorithm_set_state()
116 GPR_BITSET((unsigned*)&tmp.value.integer, algorithm); in grpc_channel_args_compression_algorithm_set_state()
[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/algorithm/test/ |
| D | hex_test1.cpp | 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()
51 boost::algorithm::hex_lower ( *p, std::back_inserter ( one )); in test_to_hex_lower()
52 boost::algorithm::hex_lower ( arg, std::back_inserter ( two )); in test_to_hex_lower()
[all …]
|
| D | hex_test2.cpp | 39 boost::algorithm::hex ( *p, std::back_inserter ( one )); in test_to_hex()
40 boost::algorithm::hex ( arg, std::back_inserter ( two )); in test_to_hex()
41 boost::algorithm::hex ( arg.begin (), arg.end (), std::back_inserter ( three )); in test_to_hex()
49 boost::algorithm::unhex ( argh, std::back_inserter ( two )); in test_to_hex()
50 boost::algorithm::unhex ( argh.begin (), argh.end (), std::back_inserter ( three )); in test_to_hex()
61 boost::algorithm::hex ( *p, std::front_inserter ( one )); in test_to_hex()
62 boost::algorithm::hex ( arg, std::front_inserter ( two )); in test_to_hex()
63 boost::algorithm::hex ( arg.begin (), arg.end (), std::front_inserter ( three )); in test_to_hex()
72 boost::algorithm::unhex ( argh, std::front_inserter ( two )); in test_to_hex()
73 boost::algorithm::unhex ( argh.begin (), argh.end (), std::front_inserter ( three )); in test_to_hex()
[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/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/algorithm/doc/ |
| D | algorithm.qbk | 3 [id algorithm]
4 [dirname algorithm]
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 …
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] ]…
79 [*[^[link header.boost.algorithm.cxx11.iota_hpp iota] ]…
105 [*[^[link boost.algorithm.for_each_n for_each_n] ]…
119 [*[^[link header.boost.algorithm.cxx11.none_of_hpp none_of_equal] ]…
[all …]
|
| /third_party/grpc/test/core/compression/ |
| D | compression_test.cc | 44 grpc_compression_algorithm algorithm; in test_compression_algorithm_parse() local
46 grpc_slice_from_static_string(valid_name), &algorithm); in test_compression_algorithm_parse()
48 GPR_ASSERT(algorithm == valid_algorithms[i]); in test_compression_algorithm_parse()
53 grpc_compression_algorithm algorithm; in test_compression_algorithm_parse() local
56 grpc_slice_from_static_string(invalid_name), &algorithm); in test_compression_algorithm_parse()
231 grpc_compression_algorithm algorithm; in test_compression_enable_disable_algorithm() local
236 for (algorithm = GRPC_COMPRESS_NONE; in test_compression_enable_disable_algorithm()
237 algorithm < GRPC_COMPRESS_ALGORITHMS_COUNT; in test_compression_enable_disable_algorithm()
238 algorithm = static_cast<grpc_compression_algorithm>( in test_compression_enable_disable_algorithm()
239 static_cast<int>(algorithm) + 1)) { in test_compression_enable_disable_algorithm()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/mkldnn/ |
| D | eltwise_cpu_kernel.cc | 31 dnnl::algorithm algorithm{dnnl::algorithm::undef}; member
39 {prim::kPrimRelu->name(), DescParam{dnnl::algorithm::eltwise_relu}}, in GetForwardEltwiseDesc()
40 {prim::kPrimRelu6->name(), DescParam{dnnl::algorithm::eltwise_clip, 0.0f, 6.0f}}, in GetForwardEltwiseDesc()
41 {prim::kPrimAbs->name(), DescParam{dnnl::algorithm::eltwise_abs}}, in GetForwardEltwiseDesc()
42 {prim::kPrimExp->name(), DescParam{dnnl::algorithm::eltwise_exp}}, in GetForwardEltwiseDesc()
43 {prim::kPrimLog->name(), DescParam{dnnl::algorithm::eltwise_log}}, in GetForwardEltwiseDesc()
44 {prim::kPrimSigmoid->name(), DescParam{dnnl::algorithm::eltwise_logistic}}, in GetForwardEltwiseDesc()
45 {prim::kPrimSqrt->name(), DescParam{dnnl::algorithm::eltwise_sqrt}}, in GetForwardEltwiseDesc()
46 {prim::kPrimTanh->name(), DescParam{dnnl::algorithm::eltwise_tanh}}, in GetForwardEltwiseDesc()
47 {prim::kPrimElu->name(), DescParam{dnnl::algorithm::eltwise_elu, 1.0f, 0.0f}}, in GetForwardEltwiseDesc()
[all …]
|
| /third_party/node/lib/internal/crypto/ |
| D | sig.js | 33 function Sign(algorithm, options) { argument
35 return new Sign(algorithm, options);
36 validateString(algorithm, 'algorithm');
38 this[kHandle].init(algorithm);
120 function signOneShot(algorithm, data, key) { argument
121 if (algorithm != null)
122 validateString(algorithm, 'algorithm');
150 algorithm, rsaPadding, pssSaltLength, dsaSigEnc);
153 function Verify(algorithm, options) { argument
155 return new Verify(algorithm, options);
[all …]
|