Home
last modified time | relevance | path

Searched refs:r_value (Results 1 – 25 of 579) sorted by relevance

12345678910>>...24

/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/powerpc/perf/req-gen/
H A Dperf.h42 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
43 REQUEST_VALUE(r_name) = r_value,
58 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
65 __field_(r_name, r_value, r_idx_1, f_offset, f_bytes, f_name)
76 #define REQUEST_(r_name, r_value, index, r_fields) \ argument
81 __field_(r_name, r_value, r_idx_1, c_offset, c_size, c_name)
83 __field_(r_name, r_value, r_idx_1, a_offset, a_size, a_name)
111 #define __field_(r_name, r_value, r_idx_1, f_offset, f_size, f_name) argument
117 "request=" __stringify(r_value) "," \
123 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/powerpc/perf/req-gen/
H A Dperf.h42 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
43 REQUEST_VALUE(r_name) = r_value,
58 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
65 __field_(r_name, r_value, r_idx_1, f_offset, f_bytes, f_name)
76 #define REQUEST_(r_name, r_value, index, r_fields) \ argument
81 __field_(r_name, r_value, r_idx_1, c_offset, c_size, c_name)
83 __field_(r_name, r_value, r_idx_1, a_offset, a_size, a_name)
111 #define __field_(r_name, r_value, r_idx_1, f_offset, f_size, f_name) argument
117 "request=" __stringify(r_value) "," \
123 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/arch/powerpc/perf/req-gen/
H A Dperf.h42 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
43 REQUEST_VALUE(r_name) = r_value,
58 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
65 __field_(r_name, r_value, r_idx_1, f_offset, f_bytes, f_name)
76 #define REQUEST_(r_name, r_value, index, r_fields) \ argument
81 __field_(r_name, r_value, r_idx_1, c_offset, c_size, c_name)
83 __field_(r_name, r_value, r_idx_1, a_offset, a_size, a_name)
111 #define __field_(r_name, r_value, r_idx_1, f_offset, f_size, f_name) argument
117 "request=" __stringify(r_value) "," \
123 #define REQUEST_(r_name, r_value, r_idx_1, r_fields) \ argument
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc6-aux/bootstrap/include/c++/5.1.0/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc9-aux/bootstrap/include/c++/9.1.0/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/riscv64-gcc/gcc-8.3.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp46 insert_leaf(const_reference r_value) in insert_leaf() argument
51 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
59 PB_DS_V2F(r_value))) in insert_leaf()
72 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
76 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
80 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 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()
100 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
117 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]
/dports/devel/mingw32-gcc/gcc-4.8.1/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp44 insert_leaf(const_reference r_value) in insert_leaf() argument
49 return std::make_pair(insert_imp_empty(r_value), in insert_leaf()
57 PB_DS_V2F(r_value))) in insert_leaf()
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), in insert_leaf()
74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) in insert_leaf()
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) in insert_leaf()
82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), in insert_leaf()
88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), in insert_leaf()
98 get_new_node_for_leaf_insert(r_value, in insert_leaf_new()
115 PB_DS_V2F(r_value))); in insert_leaf_new()
[all …]

12345678910>>...24