Lines Matching refs:m_current
48 , m_current(NoCurrentItemIndex)
67 if (m_current != NoCurrentItemIndex) {
68 unsigned targetSize = m_current + 1;
79 if (m_entries.size() == m_capacity && (m_current != 0 || m_capacity == 1)) {
84 m_current--;
90 m_entries.insert(m_current + 1, prpItem);
91 m_current++;
98 ASSERT(m_current > 0);
99 if (m_current > 0) {
100 m_current--;
108 ASSERT(m_current < m_entries.size() - 1);
109 if (m_current < m_entries.size() - 1) {
110 m_current++;
126 m_current = index;
134 if (m_current && m_current != NoCurrentItemIndex)
135 return m_entries[m_current - 1].get();
141 if (m_current != NoCurrentItemIndex)
142 return m_entries[m_current].get();
148 if (m_entries.size() && m_current < m_entries.size() - 1)
149 return m_entries[m_current + 1].get();
156 if (m_current != NoCurrentItemIndex) {
157 unsigned first = max((int)m_current - limit, 0);
158 for (; first < m_current; ++first)
171 if (m_current < lastEntry) {
172 int last = min(m_current + limit, lastEntry);
173 limit = m_current + 1;
194 m_current = NoCurrentItemIndex;
195 else if (m_current > m_entries.size() - 1) {
196 m_current = m_entries.size() - 1;
220 return m_current == NoCurrentItemIndex ? 0 : m_current;
225 return m_current == NoCurrentItemIndex ? 0 : (int)m_entries.size() - (m_current + 1);
231 if (index < -(int)m_current)
237 return m_entries[index + m_current].get();
270 if (m_current == NoCurrentItemIndex || m_current < i)
272 if (m_current > i)
273 m_current--;
276 if (m_current >= count)
277 m_current = count ? count - 1 : NoCurrentItemIndex;
299 m_current = NoCurrentItemIndex;
