| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/debug/ |
| H A D | safe_iterator.tcc | 46 return std::make_pair(0, __dp_exact); in _M_get_distance_from_begin() 55 return std::make_pair(1, __dp_sign); in _M_get_distance_from_begin() 73 return std::make_pair(0, __dp_exact); in _M_get_distance_to_end() 79 return std::make_pair(1, __dp_sign); in _M_get_distance_to_end() 137 return std::make_pair(1, __dp_exact); in _M_get_distance_to() 140 ? std::make_pair(__seq_dist.first + 1, __dp_exact) in _M_get_distance_to() 147 return std::make_pair(-1, __dp_exact); in _M_get_distance_to() 152 return std::make_pair(__seq_dist.first, in _M_get_distance_to() 161 ? std::make_pair(-__seq_dist.first - 1, __dp_exact) in _M_get_distance_to() 162 : std::make_pair(-__seq_dist.first, __dp_sign); in _M_get_distance_to() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/debug/ |
| H A D | safe_iterator.tcc | 46 return std::make_pair(0, __dp_exact); in _M_get_distance_from_begin() 55 return std::make_pair(1, __dp_sign); in _M_get_distance_from_begin() 73 return std::make_pair(0, __dp_exact); in _M_get_distance_to_end() 79 return std::make_pair(1, __dp_sign); in _M_get_distance_to_end() 137 return std::make_pair(1, __dp_exact); in _M_get_distance_to() 140 ? std::make_pair(__seq_dist.first + 1, __dp_exact) in _M_get_distance_to() 147 return std::make_pair(-1, __dp_exact); in _M_get_distance_to() 152 return std::make_pair(__seq_dist.first, in _M_get_distance_to() 161 ? std::make_pair(-__seq_dist.first - 1, __dp_exact) in _M_get_distance_to() 162 : std::make_pair(-__seq_dist.first, __dp_sign); in _M_get_distance_to() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/gp_hash_table_map_/ |
| H A D | insert_store_hash_fn_imps.hpp | 72 std::make_pair(pos, pos_hash_pair.second) : in find_ins_pos() 73 std::make_pair(ins_pos, pos_hash_pair.second)); in find_ins_pos() 86 return std::make_pair(pos, pos_hash_pair.second); in find_ins_pos() 97 return std::make_pair(ins_pos, pos_hash_pair.second); in find_ins_pos() 114 return std::make_pair(&p_e->m_value, false); in insert_imp() 118 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/gp_hash_table_map_/ |
| H A D | insert_store_hash_fn_imps.hpp | 72 std::make_pair(pos, pos_hash_pair.second) : in find_ins_pos() 73 std::make_pair(ins_pos, pos_hash_pair.second)); in find_ins_pos() 86 return std::make_pair(pos, pos_hash_pair.second); in find_ins_pos() 97 return std::make_pair(ins_pos, pos_hash_pair.second); in find_ins_pos() 114 return std::make_pair(&p_e->m_value, false); in insert_imp() 118 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/splay_tree_/ |
| H A D | insert_fn_imps.hpp | 65 return std::make_pair(base_type::insert_imp_empty(r_value), true); in insert_leaf_imp() 75 return std::make_pair(point_iterator(p_nd), false); in insert_leaf_imp() 84 …return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), … in insert_leaf_imp() 90 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); in insert_leaf_imp() 95 return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true); in insert_leaf_imp()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/splay_tree_/ |
| H A D | insert_fn_imps.hpp | 65 return std::make_pair(base_type::insert_imp_empty(r_value), true); in insert_leaf_imp() 75 return std::make_pair(point_iterator(p_nd), false); in insert_leaf_imp() 84 …return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), … in insert_leaf_imp() 90 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); in insert_leaf_imp() 95 return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true); in insert_leaf_imp()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/algorithm/ |
| H A D | minmax_element.hpp | 59 return std::make_pair(last,last); in basic_minmax_element() 67 return std::make_pair(min_result, max_result); in basic_minmax_element() 116 return std::make_pair(min_result,max_result); in basic_minmax_element() 339 return std::make_pair(last,last); in basic_first_min_last_max_element() 346 return std::make_pair(min_result, max_result); in basic_first_min_last_max_element() 376 return std::make_pair(min_result, max_result); in basic_first_min_last_max_element() 384 if (first == last) return std::make_pair(last,last); in basic_last_min_first_max_element() 391 return std::make_pair(min_result, max_result); in basic_last_min_first_max_element() 421 return std::make_pair(min_result, max_result); in basic_last_min_first_max_element() 429 if (first == last) return std::make_pair(last,last); in basic_last_min_last_max_element() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/parallel/ |
| H A D | multiseq_selection.h | 207 __sample.push_back(std::make_pair(__S(__i)[__n], __i)); 213 std::make_pair(__S(__i)[0] /*__dummy element*/, __i)); 258 __lcomp(std::make_pair(__S(__i)[__middle], __i), 259 std::make_pair(*__lmax, __lmax_seq))) 281 __pq.push(std::make_pair(__S(__i)[__b[__i]], __i)); 294 std::make_pair(__S(__source)[__b[__source]], __source)); 307 __pq.push(std::make_pair(__S(__i)[__a[__i] - 1], __i)); 318 __pq.push(std::make_pair( 458 __sample.push_back(std::make_pair(__S(__i)[__n], __i)); 466 std::make_pair(__S(__i)[0] /*__dummy element*/, __i)); [all …]
|
| H A D | find_selectors.h | 75 { return std::make_pair(find_if(__begin1, __end1, __pred, in _M_sequential_algorithm() 114 return std::make_pair(__spot, __begin2); in _M_sequential_algorithm() 190 return std::make_pair(find_first_of(__begin1, __end1, in _M_sequential_algorithm()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/parallel/ |
| H A D | multiseq_selection.h | 207 __sample.push_back(std::make_pair(__S(__i)[__n], __i)); 213 std::make_pair(__S(__i)[0] /*__dummy element*/, __i)); 258 __lcomp(std::make_pair(__S(__i)[__middle], __i), 259 std::make_pair(*__lmax, __lmax_seq))) 281 __pq.push(std::make_pair(__S(__i)[__b[__i]], __i)); 294 std::make_pair(__S(__source)[__b[__source]], __source)); 307 __pq.push(std::make_pair(__S(__i)[__a[__i] - 1], __i)); 318 __pq.push(std::make_pair( 458 __sample.push_back(std::make_pair(__S(__i)[__n], __i)); 466 std::make_pair(__S(__i)[0] /*__dummy element*/, __i)); [all …]
|
| H A D | find_selectors.h | 75 { return std::make_pair(find_if(__begin1, __end1, __pred, in _M_sequential_algorithm() 114 return std::make_pair(__spot, __begin2); in _M_sequential_algorithm() 190 return std::make_pair(find_first_of(__begin1, __end1, in _M_sequential_algorithm()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/bin_search_tree_/ |
| H A D | insert_fn_imps.hpp | 51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf() 69 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false), in insert_leaf() 77 return std::make_pair(p_pot, false); in insert_leaf() 84 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf() 90 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/bin_search_tree_/ |
| H A D | insert_fn_imps.hpp | 51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf() 69 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false), in insert_leaf() 77 return std::make_pair(p_pot, false); in insert_leaf() 84 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf() 90 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/trie_policy/ |
| H A D | prefix_search_node_update_imp.hpp | 76 return (std::make_pair(const_iterator(non_const_ret.first), in prefix_range() 97 return (std::make_pair(end(), end())); in prefix_range() 106 return (std::make_pair(ret_b, ++ret_e)); in prefix_range()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/trie_policy/ |
| H A D | prefix_search_node_update_imp.hpp | 76 return (std::make_pair(const_iterator(non_const_ret.first), in prefix_range() 97 return (std::make_pair(end(), end())); in prefix_range() 106 return (std::make_pair(ret_b, ++ret_e)); in prefix_range()
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/experimental/ |
| H A D | functional | 249 if (__f == __l ) return make_pair(__l, __l); // empty corpus 250 if (__first_ == __last_) return make_pair(__f, __f); // empty pattern 254 return make_pair(__l, __l); 286 return make_pair(__cur, __cur + __pattern_length_); 298 return make_pair(__l, __l); // We didn't find anything 402 if (__f == __l ) return make_pair(__l, __l); // empty corpus 403 if (__first_ == __last_) return make_pair(__f, __f); // empty pattern 407 return make_pair(__l, __l); 436 return make_pair(__cur, __cur + __pattern_length_); 441 return make_pair(__l, __l);
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/experimental/ |
| H A D | functional | 249 if (__f == __l ) return make_pair(__l, __l); // empty corpus 250 if (__first_ == __last_) return make_pair(__f, __f); // empty pattern 254 return make_pair(__l, __l); 286 return make_pair(__cur, __cur + __pattern_length_); 298 return make_pair(__l, __l); // We didn't find anything 402 if (__f == __l ) return make_pair(__l, __l); // empty corpus 403 if (__first_ == __last_) return make_pair(__f, __f); // empty pattern 407 return make_pair(__l, __l); 436 return make_pair(__cur, __cur + __pattern_length_); 441 return make_pair(__l, __l);
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/cc_hash_table_map_/ |
| H A D | insert_no_store_hash_fn_imps.hpp | 66 return std::make_pair(&p_e->m_value, false); in insert_imp() 70 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| H A D | insert_store_hash_fn_imps.hpp | 67 return std::make_pair(&p_e->m_value, false); in insert_imp() 71 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/cc_hash_table_map_/ |
| H A D | insert_no_store_hash_fn_imps.hpp | 66 return std::make_pair(&p_e->m_value, false); in insert_imp() 70 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| H A D | insert_store_hash_fn_imps.hpp | 67 return std::make_pair(&p_e->m_value, false); in insert_imp() 71 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/rb_tree_map_/ |
| H A D | split_join_fn_imps.hpp | 156 return (std::make_pair((node_pointer)0, base_type::m_p_head)); in find_join_pos_right() 180 return std::make_pair(p_l, p_l_parent); in find_join_pos_right() 192 return (std::make_pair((node_pointer)0, in find_join_pos_left() 216 return std::make_pair(p_r, p_r_parent); in find_join_pos_left()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/rb_tree_map_/ |
| H A D | split_join_fn_imps.hpp | 156 return (std::make_pair((node_pointer)0, base_type::m_p_head)); in find_join_pos_right() 180 return std::make_pair(p_l, p_l_parent); in find_join_pos_right() 192 return (std::make_pair((node_pointer)0, in find_join_pos_left() 216 return std::make_pair(p_r, p_r_parent); in find_join_pos_left()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/sequence/intrinsic/detail/ |
| H A D | segmented_end_impl.hpp | 52 static pair_type make_pair(end_type end) in make_pair() function 61 make_pair(fusion::end(fusion::segments(seq))), in call()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/pstl/ |
| H A D | unseq_backend_simd.h | 171 return std::make_pair(__first1 + __i, __first2 + __i); in __simd_first() 199 return std::make_pair(__first1 + __i, __first2 + __i); in __simd_first() 208 return std::make_pair(__first1, __first2); in __simd_first() 210 return std::make_pair(__last1, __last2); in __simd_first() 524 return std::make_pair(__result + __n, __init); in __simd_scan() 565 return std::make_pair(__result + __n, __init_.__value); in __simd_scan() 582 return std::make_pair(__result + __n, __init); in __simd_scan() 605 return std::make_pair(__result + __n, __init_.__value); in __simd_scan() 675 return std::make_pair(__first, __first); in __simd_minmax_element() 749 return std::make_pair(__first + __init.__min_ind, __first + __init.__max_ind); in __simd_minmax_element() [all …]
|