Home
last modified time | relevance | path

Searched refs:algorithm (Results 1 – 25 of 810) sorted by relevance

12345678910>>...33

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/algorithm/string/
H A Derase.hpp32 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 …]
H A Dreplace.hpp33 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 …]
H A Dfind.hpp33 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 …]
H A Dtrim.hpp39 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 …]
H A Dcase_conv.hpp33 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 …]
H A Dpredicate.hpp38 namespace algorithm { namespace
95 return ::boost::algorithm::starts_with(Input, Test, is_equal()); in starts_with()
117 return ::boost::algorithm::starts_with(Input, Test, is_iequal(Loc)); in istarts_with()
172 return ::boost::algorithm::ends_with(Input, Test, is_equal()); in ends_with()
194 return ::boost::algorithm::ends_with(Input, Test, is_iequal(Loc)); in iends_with()
228 …bool bResult=(::boost::algorithm::first_finder(lit_test,Comp)(::boost::begin(lit_input), ::boost::… in contains()
241 return ::boost::algorithm::contains(Input, Test, is_equal()); in contains()
262 return ::boost::algorithm::contains(Input, Test, is_iequal(Loc)); in icontains()
322 return ::boost::algorithm::equals(Input, Test, is_equal()); in equals()
346 return ::boost::algorithm::equals(Input, Test, is_iequal(Loc)); in iequals()
[all …]
H A Dsplit.hpp35 namespace algorithm { namespace
67 return ::boost::algorithm::iter_find( in find_all()
70 ::boost::algorithm::first_finder(Search) ); in find_all()
103 return ::boost::algorithm::iter_find( in ifind_all()
106 ::boost::algorithm::first_finder(Search, is_iequal(Loc) ) ); in ifind_all()
146 return ::boost::algorithm::iter_split( in split()
149 ::boost::algorithm::token_finder( Pred, eCompress ) ); in split()
155 using algorithm::find_all;
156 using algorithm::ifind_all;
157 using algorithm::split;
H A Dclassification.hpp30 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 …]
H A Dfinder.hpp35 namespace algorithm { namespace
259 using algorithm::first_finder;
260 using algorithm::last_finder;
261 using algorithm::nth_finder;
262 using algorithm::head_finder;
263 using algorithm::tail_finder;
264 using algorithm::token_finder;
265 using algorithm::range_finder;
H A Dcompare.hpp25 namespace algorithm { namespace
189 using algorithm::is_equal;
190 using algorithm::is_iequal;
191 using algorithm::is_less;
192 using algorithm::is_iless;
193 using algorithm::is_not_greater;
194 using algorithm::is_not_igreater;
H A Dformatter.hpp33 namespace algorithm { namespace
112 using algorithm::const_formatter;
113 using algorithm::identity_formatter;
114 using algorithm::empty_formatter;
115 using algorithm::dissect_formatter;
/OK3568_Linux_fs/kernel/crypto/
H A DKconfig147 tristate "Cryptographic algorithm manager"
163 tristate "Userspace cryptographic algorithm configuration"
175 algorithm registration.
209 This converts an arbitrary crypto algorithm into a parallel
210 algorithm that executes in kernel threads.
219 converts an arbitrary synchronous software crypto algorithm
220 into an asynchronous algorithm that executes in a kernel thread.
255 tristate "RSA algorithm"
261 Generic implementation of the RSA public key algorithm.
264 tristate "Diffie-Hellman algorithm"
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/algorithm/string/detail/
H A Dfind_format_all.hpp22 namespace algorithm { namespace
88 if( ::boost::algorithm::detail::check_find_result(Input, FindResult) ) { in find_format_all_copy_impl()
89 return ::boost::algorithm::detail::find_format_all_copy_impl2( in find_format_all_copy_impl()
137 … boost::algorithm::detail::insert( Output, ::boost::end(Output), LastMatch, M.begin() ); in find_format_all_copy_impl2()
139 … boost::algorithm::detail::insert( Output, ::boost::end(Output), M.format_result() ); in find_format_all_copy_impl2()
147 …::boost::algorithm::detail::insert( Output, ::boost::end(Output), LastMatch, ::boost::end(Input) ); in find_format_all_copy_impl2()
163 if( ::boost::algorithm::detail::check_find_result(Input, FindResult) ) { in find_format_all_copy_impl()
164 return ::boost::algorithm::detail::find_format_all_copy_impl2( in find_format_all_copy_impl()
222 ::boost::algorithm::detail::copy_to_storage( Storage, M.format_result() ); in find_format_all_impl2()
229 InsertIt=::boost::algorithm::detail::process_segment( in find_format_all_impl2()
[all …]
H A Dfind_format.hpp22 namespace algorithm { namespace
78 if( ::boost::algorithm::detail::check_find_result(Input, FindResult) ) { in find_format_copy_impl()
79 return ::boost::algorithm::detail::find_format_copy_impl2( in find_format_copy_impl()
121 …boost::algorithm::detail::insert( Output, ::boost::end(Output), ::boost::begin(Input), M.begin() ); in find_format_copy_impl2()
123 boost::algorithm::detail::insert( Output, ::boost::end(Output), M.format_result() ); in find_format_copy_impl2()
125 … boost::algorithm::detail::insert( Output, ::boost::end(Output), M.end(), ::boost::end(Input) ); in find_format_copy_impl2()
139 if( ::boost::algorithm::detail::check_find_result(Input, FindResult) ) { in find_format_copy_impl()
140 return ::boost::algorithm::detail::find_format_copy_impl2( in find_format_copy_impl()
179 ::boost::algorithm::detail::replace( Input, M.begin(), M.end(), M.format_result() ); in find_format_impl2()
191 if( ::boost::algorithm::detail::check_find_result(Input, FindResult) ) { in find_format_impl()
[all …]
/OK3568_Linux_fs/u-boot/drivers/crypto/rockchip/
H A DKconfig6 This enable RSA512/RSA1024/RSA2048 algorithm support for
14 This enable RSA512/RSA1024/RSA2048 algorithm support for
22 This enable DES/AES/SM4 algorithm support for
30 This enable DES/AES/SM4 algorithm support for
38 This enable HMAC algorithm support for
46 This enable HMAC algorithm support for
53 This enable MD5/SHA1/SHA256/RSA512/RSA1024/RSA2048 algorithm support for
60 This enable MD5/SHA1/SHA256/RSA512/RSA1024/RSA2048 algorithm support for
67 This enable MD5/SHA1/SHA256/RSA512/RSA1024/RSA2048 algorithm support for
74 This enable MD5/SHA1/SHA256/RSA512/RSA1024/RSA2048 algorithm support for
/OK3568_Linux_fs/buildroot/package/squashfs/
H A DConfig.in24 Support GZIP compression algorithm
30 Support LZ4 compression algorithm
36 Support LZMA compression algorithm
42 Support LZO compression algorithm
48 Support XZ compression algorithm
54 Support ZSTD compression algorithm
/OK3568_Linux_fs/kernel/arch/arm64/crypto/
H A DKconfig13 tristate "SHA-224/SHA-256 digest algorithm for arm64"
17 tristate "SHA-384/SHA-512 digest algorithm for arm64"
21 tristate "SHA-1 digest algorithm (ARMv8 Crypto Extensions)"
27 tristate "SHA-224/SHA-256 digest algorithm (ARMv8 Crypto Extensions)"
33 tristate "SHA-384/SHA-512 digest algorithm (ARMv8 Crypto Extensions)"
39 tristate "SHA3 digest algorithm (ARMv8.2 Crypto Extensions)"
45 tristate "SM3 digest algorithm (ARMv8.2 Crypto Extensions)"
65 tristate "CRCT10DIF digest algorithm using PMULL instructions"
118 tristate "AES in ECB/CBC/CTR/XTS modes using bit-sliced NEON algorithm"
/OK3568_Linux_fs/kernel/Documentation/crypto/
H A Dapi-intro.rst35 [algorithm api] (for registering algorithms)
37 The idea is to make the user interface and algorithm registration API
103 When submitting a new algorithm for inclusion, a mandatory requirement
204 SHA1 algorithm contributors:
207 DES algorithm contributors:
212 Blowfish algorithm contributors:
216 Twofish algorithm contributors:
220 SHA256/384/512 algorithm contributors:
225 AES algorithm contributors:
233 CAST5 algorithm contributors:
[all …]
/OK3568_Linux_fs/kernel/arch/arm/crypto/
H A DKconfig13 tristate "SHA1 digest algorithm (ARM-asm)"
21 tristate "SHA1 digest algorithm (ARM NEON)"
32 tristate "SHA1 digest algorithm (ARM v8 Crypto Extensions)"
41 tristate "SHA-224/256 digest algorithm (ARM v8 Crypto Extensions)"
50 tristate "SHA-224/256 digest algorithm (ARM-asm and NEON)"
58 tristate "SHA-384/512 digest algorithm (ARM-asm and NEON)"
66 tristate "BLAKE2s digest algorithm (ARM)"
69 BLAKE2s digest algorithm optimized with ARM scalar instructions. This
75 tristate "BLAKE2b digest algorithm (ARM NEON)"
79 BLAKE2b digest algorithm optimized with ARM NEON instructions.
[all …]
/OK3568_Linux_fs/buildroot/package/tiff/
H A DConfig.in15 bool "Macintosh PackBits algorithm"
19 bool "LZW algorithm"
23 bool "ThunderScan 4-bit RLE algorithm"
27 bool "NeXT 2-bit RLE algorithm"
48 bool "Pixar log-format algorithm (requires Zlib)"
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/share/OpenCV/licenses/
H A Dopenexr-fix_msvc2013_errors.patch9 +#include <algorithm> // for std::max()
21 +#include <algorithm> // for std::max()
33 +#include <algorithm> // for std::max()
45 +#include <algorithm> // for std::max()
57 +#include <algorithm> // for std::max()
69 +#include <algorithm> // for std::max()
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-armhf/share/OpenCV/licenses/
H A Dopenexr-fix_msvc2013_errors.patch9 +#include <algorithm> // for std::max()
21 +#include <algorithm> // for std::max()
33 +#include <algorithm> // for std::max()
45 +#include <algorithm> // for std::max()
57 +#include <algorithm> // for std::max()
69 +#include <algorithm> // for std::max()
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/OpenCV-android-sdk/sdk/etc/licenses/
H A Dopenexr-fix_msvc2013_errors.patch9 +#include <algorithm> // for std::max()
21 +#include <algorithm> // for std::max()
33 +#include <algorithm> // for std::max()
45 +#include <algorithm> // for std::max()
57 +#include <algorithm> // for std::max()
69 +#include <algorithm> // for std::max()
/OK3568_Linux_fs/u-boot/common/
H A Dattestation_key.c318 uint32_t algorithm; in load_attestation_key() local
320 copy_uint32_from_buf(&key_buf, &algorithm); in load_attestation_key()
321 debug("\n algorithm:%d\n", algorithm); in load_attestation_key()
356 copy_uint32_from_buf(&key_buf, &algorithm); in load_attestation_key()
357 debug("\n algorithm:%d\n", algorithm); in load_attestation_key()
442 uint32_t algorithm; in write_attestation_key_to_secure_storage() local
462 copy_uint32_from_buf(&key_buf, &algorithm); in write_attestation_key_to_secure_storage()
463 printf("\n algorithm: %d\n", algorithm); in write_attestation_key_to_secure_storage()
470 copy_uint32_from_buf(&key_buf, &algorithm); in write_attestation_key_to_secure_storage()
471 printf("\n algorithm: %d\n", algorithm); in write_attestation_key_to_secure_storage()
/OK3568_Linux_fs/kernel/Documentation/networking/
H A Dnet_dim.rst21 processing. The mechanism includes an algorithm which decides if and how to
24 iteration of the algorithm, it analyses a given sample of the data, compares it
30 the algorithm might decide not to change anything. The configuration fields are
32 number of wanted packets per event. The Net DIM algorithm ascribes importance to
39 Each iteration of the Net DIM algorithm follows these steps:
54 compared. Here the algorithm tries to optimize for lower interrupt rate so an
62 and the internal state of the algorithm. The states reflect the "direction" of
63 the algorithm: is it going left (reducing moderation), right (increasing
66 algorithm would increase in order to reduce calculation overhead. Also, after
67 "parking" on one of the most left or most right decisions, the algorithm may
[all …]

12345678910>>...33