HomeSort by relevance Sort by last modified time
    Searched refs:m_entries (Results 1 - 25 of 237) sorted by null

1 2 3 4 5 6 7 8 910

  /external/webkit/Source/WebCore/html/parser/
HTMLFormattingElementList.cpp 44 for (unsigned i = 1; i <= m_entries.size(); ++i) {
45 const Entry& entry = m_entries[m_entries.size() - i];
61 size_t index = m_entries.reverseFind(element);
64 return &m_entries[index];
71 size_t index = m_entries.reverseFind(element);
87 m_entries.insert(index + 1, newElement);
93 m_entries.append(element);
98 size_t index = m_entries.reverseFind(element);
100 m_entries.remove(index)
    [all...]
  /external/webkit/Source/WebCore/fileapi/
EntryArray.cpp 44 if (index >= m_entries.size())
46 return m_entries[index].get();
EntryArray.h 49 unsigned length() const { return m_entries.size(); }
53 bool isEmpty() const { return m_entries.isEmpty(); }
54 void clear() { m_entries.clear(); }
55 void append(PassRefPtr<Entry> entry) { m_entries.append(entry); }
60 Vector<RefPtr<Entry> > m_entries; member in class:WebCore::EntryArray
EntryArraySync.h 53 unsigned length() const { return m_entries.size(); }
56 bool isEmpty() const { return m_entries.isEmpty(); }
57 void clear() { m_entries.clear(); }
58 void append(PassRefPtr<EntrySync> entry) { m_entries.append(entry); }
63 Vector<RefPtr<EntrySync> > m_entries; member in class:WebCore::EntryArraySync
  /external/webkit/Source/WebKit2/Shared/
ImmutableArray.cpp 36 : m_entries(size)
39 m_entries[i] = entries[i];
44 m_entries.swap(entries);
MutableArray.cpp 41 m_entries.append(item);
46 m_entries.reserveCapacity(capacity);
51 m_entries.remove(index);
  /external/webkit/Source/WebKit2/UIProcess/
WebBackForwardList.cpp 42 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
52 size_t size = m_entries.size();
54 m_page->backForwardRemovedItem(m_entries[i]->itemID());
62 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
72 removedItems.reserveCapacity(m_entries.size() - targetSize);
73 while (m_entries.size() > targetSize) {
75 m_page->backForwardRemovedItem(m_entries.last()->itemID());
76 removedItems.append(m_entries.last().release());
77 m_entries.removeLast();
83 if (m_entries.size() == m_capacity && (m_current != 0 || m_capacity == 1))
    [all...]
  /external/webkit/Source/WebCore/history/
BackForwardListImpl.cpp 69 while (m_entries.size() > targetSize) {
70 RefPtr<HistoryItem> item = m_entries.last();
71 m_entries.removeLast();
79 if (m_entries.size() == m_capacity && (m_current != 0 || m_capacity == 1)) {
80 RefPtr<HistoryItem> item = m_entries[0];
81 m_entries.remove(0);
90 m_entries.insert(m_current + 1, prpItem);
108 ASSERT(m_current < m_entries.size() - 1);
109 if (m_current < m_entries.size() - 1) {
118 if (!m_entries.size() || !item
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.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] != 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/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.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/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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.7-4.6/x86_64-linux/include/c++/4.6.x-google/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.7-4.6/x86_64-linux/include/c++/4.6.x-google/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]);

Completed in 351 milliseconds

1 2 3 4 5 6 7 8 910