| /src/external/bsd/openldap/dist/contrib/ldapc++/src/ |
| LDAPEntryList.cpp | 15 m_entries = e.m_entries;
22 return m_entries.size();
26 return m_entries.empty();
30 return m_entries.begin();
34 return m_entries.end();
38 m_entries.push_back(e);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| constructor_destructor_no_store_hash_fn_imps.hpp | 54 p->m_p_next = m_entries[pos];
55 m_entries[pos] = p;
|
| erase_fn_imps.hpp | 66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
69 entry_pointer p_next_e = m_entries[pos]->m_p_next;
70 erase_entry_pointer(m_entries[pos]);
71 m_entries[pos] = p_next_e;
74 entry_pointer p_e = m_entries[pos];
97 while (m_entries[pos] != 0)
98 erase_entry_pointer(m_entries[pos]);
|
| constructor_destructor_store_hash_fn_imps.hpp | 53 p->m_p_next = m_entries[pos];
56 m_entries[pos] = p;
|
| constructor_destructor_fn_imps.hpp | 67 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
78 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
90 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
92 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)0);
106 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
122 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
134 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
163 std::swap(m_entries, other.m_entries);
[all...] |
| erase_no_store_hash_fn_imps.hpp | 59 entry_pointer p_e = m_entries[pos];
73 erase_entry_pointer(m_entries[pos]);
|
| erase_store_hash_fn_imps.hpp | 50 entry_pointer p_e = m_entries[r_pos_hash_pair.first];
65 erase_entry_pointer(m_entries[r_pos_hash_pair.first]);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| constructor_destructor_no_store_hash_fn_imps.hpp | 50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k;
51 entry* const p_e = m_entries + pos;
|
| constructor_destructor_fn_imps.hpp | 63 m_entries(s_entry_allocator.allocate(m_num_e))
74 m_entries(s_entry_allocator.allocate(m_num_e))
86 m_entries(s_entry_allocator.allocate(m_num_e))
100 m_entries(s_entry_allocator.allocate(m_num_e))
114 m_entries(s_entry_allocator.allocate(m_num_e))
129 m_entries(s_entry_allocator.allocate(m_num_e))
146 m_entries(s_entry_allocator.allocate(m_num_e))
149 m_entries[i].m_stat = (entry_status)empty_entry_status;
155 m_entries[i].m_stat = other.m_entries[i].m_stat
[all...] |
| constructor_destructor_store_hash_fn_imps.hpp | 50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status);
51 entry* const p_e = m_entries + pos;
|
| trace_fn_imps.hpp | 57 switch(m_entries[i].m_stat)
66 std::cerr << PB_DS_V2F(m_entries[i].m_value);
|
| debug_fn_imps.hpp | 51 assert_entry_array_valid(m_entries, traits_base::m_store_extra_indicator,
|
| resize_fn_imps.hpp | 122 erase_all_valid_entries(m_entries, old_size);
123 s_entry_allocator.deallocate(m_entries, old_size);
124 m_entries = a_entries_resized;
134 if (m_entries[pos].m_stat == valid_entry_status)
135 resize_imp_reassign(m_entries + pos, a_entries_resized,
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| constructor_destructor_no_store_hash_fn_imps.hpp | 54 p->m_p_next = m_entries[pos];
55 m_entries[pos] = p;
|
| erase_fn_imps.hpp | 66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
69 entry_pointer p_next_e = m_entries[pos]->m_p_next;
70 erase_entry_pointer(m_entries[pos]);
71 m_entries[pos] = p_next_e;
74 entry_pointer p_e = m_entries[pos];
97 while (m_entries[pos] != 0)
98 erase_entry_pointer(m_entries[pos]);
|
| constructor_destructor_store_hash_fn_imps.hpp | 53 p->m_p_next = m_entries[pos];
56 m_entries[pos] = p;
|
| constructor_destructor_fn_imps.hpp | 67 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
78 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
90 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
92 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)0);
106 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
122 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
134 m_entries(s_entry_pointer_allocator.allocate(m_num_e))
163 std::swap(m_entries, other.m_entries);
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| constructor_destructor_no_store_hash_fn_imps.hpp | 50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k;
51 entry* const p_e = m_entries + pos;
|
| constructor_destructor_fn_imps.hpp | 63 m_entries(s_entry_allocator.allocate(m_num_e))
74 m_entries(s_entry_allocator.allocate(m_num_e))
86 m_entries(s_entry_allocator.allocate(m_num_e))
100 m_entries(s_entry_allocator.allocate(m_num_e))
114 m_entries(s_entry_allocator.allocate(m_num_e))
129 m_entries(s_entry_allocator.allocate(m_num_e))
146 m_entries(s_entry_allocator.allocate(m_num_e))
149 m_entries[i].m_stat = (entry_status)empty_entry_status;
155 m_entries[i].m_stat = other.m_entries[i].m_stat
[all...] |
| constructor_destructor_store_hash_fn_imps.hpp | 50 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status);
51 entry* const p_e = m_entries + pos;
|
| trace_fn_imps.hpp | 57 switch(m_entries[i].m_stat)
66 std::cerr << PB_DS_V2F(m_entries[i].m_value);
|
| debug_fn_imps.hpp | 51 assert_entry_array_valid(m_entries, traits_base::m_store_extra_indicator,
|
| resize_fn_imps.hpp | 122 erase_all_valid_entries(m_entries, old_size);
123 s_entry_allocator.deallocate(m_entries, old_size);
124 m_entries = a_entries_resized;
134 if (m_entries[pos].m_stat == valid_entry_status)
135 resize_imp_reassign(m_entries + pos, a_entries_resized,
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-table.h | 496 if (Lazy && m_entries == NULL)
499 iterator iter (m_entries, m_entries + m_size);
572 gcc_checking_assert (m_inserting_slot >= &m_entries[0]
573 && m_inserting_slot < &m_entries[m_size]);
597 value_type *m_entries; member in class:hash_table
619 /* if m_entries is stored in ggc memory. */
671 m_entries = NULL;
673 m_entries = alloc_entries (size PASS_MEM_STAT);
705 if (Lazy && h.m_entries == NULL
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-table.h | 496 if (Lazy && m_entries == NULL)
498 iterator iter (m_entries, m_entries + m_size);
555 typename Descriptor::value_type *m_entries; member in class:hash_table
577 /* if m_entries is stored in ggc memory. */
626 m_entries = NULL;
628 m_entries = alloc_entries (size PASS_MEM_STAT);
655 if (Lazy && h.m_entries == NULL)
656 m_entries = NULL;
662 value_type &entry = h.m_entries[i]
[all...] |
