Lines Matching refs:m_firstFree

51   protected int m_firstFree = 0;
108 return m_firstFree;
119 if ((m_firstFree + 1) >= m_mapSize)
132 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
138 m_map[m_firstFree] = value;
140 m_firstFree++;
151 int ff = m_firstFree;
176 m_firstFree = ff;
187 m_firstFree--;
189 int n = m_map[m_firstFree];
191 m_map[m_firstFree] = DTM.NULL;
205 m_firstFree--;
207 m_map[m_firstFree] = DTM.NULL;
209 return (m_firstFree == 0) ? DTM.NULL : m_map[m_firstFree - 1];
218 m_firstFree--;
220 m_map[m_firstFree] = DTM.NULL;
232 return ((null != m_map) && (m_firstFree > 0))
233 ? m_map[m_firstFree - 1] : DTM.NULL;
254 if ((m_firstFree + 2) >= m_mapSize)
260 System.arraycopy(m_map, 0, newMap, 0, m_firstFree);
266 m_map[m_firstFree] = v1;
267 m_map[m_firstFree + 1] = v2;
268 m_firstFree += 2;
279 m_firstFree -= 2;
280 m_map[m_firstFree] = DTM.NULL;
281 m_map[m_firstFree + 1] = DTM.NULL;
293 m_map[m_firstFree - 1] = n;
305 m_map[m_firstFree - 2] = n;
317 return m_map[m_firstFree - 1];
329 return m_map[m_firstFree - 2];
340 for (int i = 0; i < m_firstFree; i++)
370 else if ((m_firstFree + 1) >= m_mapSize)
376 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
381 if (at <= (m_firstFree - 1))
383 System.arraycopy(m_map, at, m_map, at + 1, m_firstFree - at);
388 m_firstFree++;
406 else if ((m_firstFree + nNodes) >= m_mapSize)
412 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);
417 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);
419 m_firstFree += nNodes;
434 for (int i = 0; i < m_firstFree; i++)
439 m_firstFree = 0;
451 m_firstFree = 0;
471 for (int i = 0; i < m_firstFree; i++)
477 if (i > m_firstFree)
478 System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);
482 m_firstFree--;
505 if (i > m_firstFree)
506 System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);
565 for (int i = 0; i < m_firstFree; i++)
593 for (int i = index; i < m_firstFree; i++)
620 for (int i = 0; i < m_firstFree; i++)
737 sort(m_map, 0, m_firstFree - 1);