Lines Matching defs:m_size
36 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
40 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
46 : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
56 internal::smart_copy(other.m_values, other.m_values + m_size, m_values);
57 internal::smart_copy(other.m_indices, other.m_indices + m_size, m_indices);
66 std::swap(m_size, other.m_size);
78 Index newAllocatedSize = m_size + size;
85 if (m_allocatedSize>m_size)
86 reallocate(m_size);
98 m_size = size;
103 Index id = m_size;
104 resize(m_size+1, 1);
109 inline Index size() const { return m_size; }
111 inline void clear() { m_size = 0; }
127 return searchLowerIndex(0, m_size, key);
148 if (m_size==0)
150 else if (key==m_indices[m_size-1])
151 return m_values[m_size-1];
154 const Index id = searchLowerIndex(0,m_size-1,key);
155 return ((id<m_size) && (m_indices[id]==key)) ? m_values[id] : defaultValue;
176 Index id = searchLowerIndex(0,m_size,key);
177 if (id>=m_size || m_indices[id]!=key)
179 if (m_allocatedSize<m_size+1)
181 m_allocatedSize = 2*(m_size+1);
190 if(m_size>id)
192 internal::smart_copy(m_values +id, m_values +m_size, newValues.ptr() +id+1);
193 internal::smart_copy(m_indices+id, m_indices+m_size, newIndices.ptr()+id+1);
198 else if(m_size>id)
200 internal::smart_memmove(m_values +id, m_values +m_size, m_values +id+1);
201 internal::smart_memmove(m_indices+id, m_indices+m_size, m_indices+id+1);
203 m_size++;
236 Index copySize = (std::min)(size, m_size);
249 Index m_size;
