Home
last modified time | relevance | path

Searched refs:key_count (Results 1 – 11 of 11) sorted by relevance

/third_party/boost/boost/mpl/multiset/aux_/
Ditem.hpp45 enum { msvc70_wknd_ = sizeof(Base::key_count(BOOST_MPL_AUX_STATIC_CAST(U*,0))) };
69 static typename prior_count<U>::type key_count(U*);
81 …enum { msvc71_wknd_ = sizeof(Base::key_count(BOOST_MPL_AUX_STATIC_CAST(aux::type_wrapper<U>*,0))) …
96 …enum { msvc71_wknd_ = sizeof(Base::key_count(BOOST_MPL_AUX_STATIC_CAST(aux::type_wrapper<T>*,0))) …
101 key_count(aux::type_wrapper<T>*);
103 static char (& key_count(aux::type_wrapper<T>*) )[count_::value];
107 static typename aux::prior_key_count<U,Base>::type key_count(aux::type_wrapper<U>*);
Dcount_impl.hpp38 : int_< sizeof(S::key_count(BOOST_MPL_AUX_STATIC_CAST(U*,0))) - 1 >
72 …enum { msvc71_wknd_ = sizeof(Set::key_count(BOOST_MPL_AUX_STATIC_CAST(aux::type_wrapper<Key>*,0)))…
Dmultiset0.hpp28 static char (& key_count(...) )[count_::value];
/third_party/toybox/toys/pending/
Dgetfattr.c38 int i, key_count; local
56 for (key = keys, key_count = 0; key-keys < keys_len; key += strlen(key)+1)
57 key_count++;
58 sorted_keys = xmalloc(key_count * sizeof(char *));
61 qsort(sorted_keys, key_count, sizeof(char *), qstrcmp);
65 for (i = 0; i < key_count; i++) {
/third_party/mbedtls/tests/suites/
Dtest_suite_des.function109 void des3_encrypt_ecb( int key_count, data_t * key_str,
119 if( key_count == 2 )
121 else if( key_count == 3 )
136 void des3_decrypt_ecb( int key_count, data_t * key_str,
146 if( key_count == 2 )
148 else if( key_count == 3 )
163 void des3_encrypt_cbc( int key_count, data_t * key_str,
174 if( key_count == 2 )
176 else if( key_count == 3 )
196 void des3_decrypt_cbc( int key_count, data_t * key_str,
[all …]
/third_party/gstreamer/gstplugins_bad/tests/check/elements/
Ddtls.c53 static int key_count; variable
73 key_count++; in _on_key_received()
82 while (key_count < n) { in _wait_for_key_count_to_reach()
/third_party/boost/boost/move/algo/detail/
Dadaptive_sort_merge.hpp315 size_type const key_count = needed_keys_count(n_block_a, n_block_b); (void)key_count; in merge_blocks_bufferless() local
317 …E_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp)); in merge_blocks_bufferless()
318 …VARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_f… in merge_blocks_bufferless()
360 bool is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid); in merge_blocks_bufferless()
998 size_type const key_count = needed_keys_count(n_block_a, n_block_b); (void)key_count; in op_merge_blocks_left() local
1000 …E_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp)); in op_merge_blocks_left()
1001 …VARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_f… in op_merge_blocks_left()
1041 bool const is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid); in op_merge_blocks_left()
1219 size_type const key_count = needed_keys_count(n_block_a, n_block_b); (void)key_count; in op_merge_blocks_with_buf() local
1221 …E_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp)); in op_merge_blocks_with_buf()
[all …]
/third_party/boost/boost/graph/
Dgraphml.hpp283 int key_count = 0; in write_graphml() local
288 std::string key_id = "key" + lexical_cast< std::string >(key_count++); in write_graphml()
/third_party/libinput/src/
Devdev-fallback.h238 return device->key_count[code]; in get_key_down_count()
Devdev.c119 int key_count; in evdev_update_key_down_count() local
123 key_count = ++device->key_count[code]; in evdev_update_key_down_count()
125 assert(device->key_count[code] > 0); in evdev_update_key_down_count()
126 key_count = --device->key_count[code]; in evdev_update_key_down_count()
129 if (key_count > 32) { in evdev_update_key_down_count()
135 return key_count; in evdev_update_key_down_count()
Devdev.h248 uint8_t key_count[KEY_CNT]; member