/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 49 return std::make_pair(insert_imp_empty(r_value), 57 PB_DS_V2F(r_value))) 67 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false), 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), 74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) 78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), 88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), 95 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 50 insert_imp_empty(r_value), 59 PB_DS_V2F(r_value))) 70 insert_leaf_new(r_value, m_p_head->m_p_right, false), 74 PB_DS_V2F(r_value), 80 PB_DS_V2F(r_value))); 86 PB_DS_V2F(r_value))); 91 insert_leaf_new(r_value, p_pot, true), 98 insert_leaf_new(r_value, p_nd, false), 105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 49 return std::make_pair(insert_imp_empty(r_value), 57 PB_DS_V2F(r_value))) 67 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false), 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), 74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) 78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), 88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), 95 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/bin_search_tree_/ |
insert_fn_imps.hpp | 44 insert_leaf(const_reference r_value) 49 return std::make_pair(insert_imp_empty(r_value), 57 PB_DS_V2F(r_value))) 67 return std::make_pair(insert_leaf_new(r_value, m_p_head->m_p_right, false), 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), 74 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value)) 78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 82 return std::make_pair(insert_leaf_new(r_value, p_pot, true), 88 return std::make_pair(insert_leaf_new(r_value, p_nd, false), 95 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 63 return std::make_pair(base_type::insert_imp_empty(r_value), true); 69 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 71 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 82 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 84 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 88 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 93 return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 62 return std::make_pair(base_type::insert_imp_empty(r_value), true); 68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 81 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 83 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 87 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 92 return std::make_pair(insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 63 return std::make_pair(base_type::insert_imp_empty(r_value), true); 69 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 71 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 82 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 84 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 88 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 93 return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/splay_tree_/ |
insert_fn_imps.hpp | 44 insert(const_reference r_value) 47 std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value); 58 insert_leaf_imp(const_reference r_value) 63 return std::make_pair(base_type::insert_imp_empty(r_value), true); 69 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 71 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 82 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true); 84 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value)) 88 return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true)); 93 return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true) [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachORelocation.h | 33 int32_t r_value; // the value the item to be relocated is referring member in class:llvm::MachORelocation 44 uint32_t getAddress() const { return r_scattered ? r_value : r_address; } 51 r_extern(ext), r_type(type), r_scattered(scattered), r_value(value) {}
|