Lines Matching refs:m_current
37 , m_current(NoCurrentItemIndex)
42 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
62 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
70 if (m_current != NoCurrentItemIndex) {
71 unsigned targetSize = m_current + 1;
83 if (m_entries.size() == m_capacity && (m_current != 0 || m_capacity == 1)) {
88 m_current--;
91 m_entries.insert(m_current + 1, newItem);
92 m_current++;
97 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
102 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
113 m_current = index;
121 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
123 if (m_current != NoCurrentItemIndex)
124 return m_entries[m_current].get();
130 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
132 if (m_current && m_current != NoCurrentItemIndex)
133 return m_entries[m_current - 1].get();
139 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
141 if (m_entries.size() && m_current < m_entries.size() - 1)
142 return m_entries[m_current + 1].get();
148 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
151 if (index < -static_cast<int>(m_current))
157 return m_entries[index + m_current].get();
162 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
164 return m_current == NoCurrentItemIndex ? 0 : m_current;
169 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
171 return m_current == NoCurrentItemIndex ? 0 : static_cast<int>(m_entries.size()) - (m_current + 1);
176 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
195 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
204 unsigned last = m_current + size;
206 for (unsigned i = m_current + 1; i <= last; ++i)
214 ASSERT(m_current == NoCurrentItemIndex || m_current < m_entries.size());
232 if (i != m_current)
239 m_current = 0;
