Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:p_l (Results 1 - 25 of 89) sorted by null

1 2 3 4

/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != NULL) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != NULL) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != NULL) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != 0) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != 0) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != 0) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/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/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != 0) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != 0) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != 0) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != NULL) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != NULL) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != NULL) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != NULL) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != NULL) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != NULL) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != NULL) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != NULL) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != NULL) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != NULL) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != NULL) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != NULL) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != 0) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }
insert_fn_imps.hpp	49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 51 if (p_l != 0) 54 return std::make_pair(point_iterator(&p_l->m_value), false); 59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 60 p_l->m_p_next = m_p_l; 61 m_p_l = p_l; 63 return std::make_pair(point_iterator(&p_l->m_value), true); 71 entry_pointer p_l = s_entry_allocator.allocate(1); local 72 cond_dealtor_t cond(p_l); 73 new (const_cast<void* >(static_cast<const void* >(&p_l->m_value)) 87 entry_pointer p_l = s_entry_allocator.allocate(1); local     [all...]
trace_fn_imps.hpp	49 const_entry_pointer p_l = m_p_l; local 50 while (p_l != 0) 52 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 53 p_l = p_l->m_p_next;
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp	55 entry_pointer p_l = m_p_l; local 56 while (p_l->m_p_next != 0) 58 entry_pointer p_next = p_l->m_p_next; 63 p_l->m_p_next = p_next->m_p_next; 71 p_l = p_next; 82 apply_update(entry_pointer p_l, type_to_type<Metadata>) 83 { return s_update_policy(p_l->m_update_metadata); }

Completed in 135 milliseconds

1 2 3 4