OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:m_entries
(Results
1 - 25
of
353
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/lldb/include/lldb/Core/
RangeMap.h
179
m_entries
()
190
m_entries
.push_back (entry);
196
if (idx <
m_entries
.size())
198
m_entries
.erase (
m_entries
.begin() + idx);
207
if (
m_entries
.size() > 1)
208
std::stable_sort (
m_entries
.begin(),
m_entries
.end());
218
for (pos =
m_entries
.begin(), end =
m_entries
.end(), prev = end; pos != end; prev = pos++
446
Collection
m_entries
;
member in class:lldb_private::RangeArray
732
Collection
m_entries
;
member in class:lldb_private::RangeVector
1052
Collection
m_entries
;
member in class:lldb_private::RangeDataArray
1352
Collection
m_entries
;
member in class:lldb_private::RangeDataVector
1538
Collection
m_entries
;
member in class:lldb_private::AddressDataArray
[
all
...]
/external/lldb/source/Plugins/SymbolFile/DWARF/
DWARFDeclContext.h
67
m_entries
()
74
m_entries
.push_back(Entry(tag, name));
83
return
m_entries
.size();
90
return
m_entries
[idx];
97
return
m_entries
[idx];
105
collection
m_entries
;
member in class:DWARFDeclContext
DWARFDeclContext.cpp
23
if (!
m_entries
.empty())
25
if (
m_entries
.size() == 1)
27
if (
m_entries
[0].name)
30
m_qualified_name.append(
m_entries
[0].name);
36
collection::const_reverse_iterator begin =
m_entries
.rbegin();
37
collection::const_reverse_iterator end =
m_entries
.rend();
70
if (
m_entries
.size() != rhs.
m_entries
.size())
74
collection::const_iterator begin =
m_entries
.begin();
75
collection::const_iterator end =
m_entries
.end()
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/events/
EventListenerMap.cpp
71
for (unsigned i = 0; i <
m_entries
.size(); ++i) {
72
if (
m_entries
[i].first == eventType)
80
for (unsigned i = 0; i <
m_entries
.size(); ++i) {
81
if (
m_entries
[i].first == eventType) {
82
const EventListenerVector* vector =
m_entries
[i].second.get();
96
m_entries
.clear();
102
types.reserveInitialCapacity(
m_entries
.size());
104
for (unsigned i = 0; i <
m_entries
.size(); ++i)
105
types.uncheckedAppend(
m_entries
[i].first);
125
for (unsigned i = 0; i <
m_entries
.size(); ++i)
[
all
...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != 0 && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != 0)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != 0 && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != 0)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != 0 && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != 0)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != NULL && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != NULL)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != NULL && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != NULL)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != NULL && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != NULL)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/cc_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
52
p->m_p_next =
m_entries
[pos];
53
m_entries
[pos] = p;
erase_fn_imps.hpp
64
while (
m_entries
[pos] != NULL && pred(
m_entries
[pos]->m_value))
67
entry_pointer p_next_e =
m_entries
[pos]->m_p_next;
68
erase_entry_pointer(
m_entries
[pos]);
69
m_entries
[pos] = p_next_e;
72
entry_pointer p_e =
m_entries
[pos];
95
while (
m_entries
[pos] != NULL)
96
erase_entry_pointer(
m_entries
[pos]);
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/gp_hash_table_map_/
constructor_destructor_no_store_hash_fn_imps.hpp
48
_GLIBCXX_DEBUG_ASSERT(
m_entries
[pos].m_stat != valid_entry_status)k;
49
entry* const p_e =
m_entries
+ pos;
Completed in 224 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>