Lines Matching defs:m_firstFree
329 if ((index >= 0) && (m_next < m_firstFree))
332 m_next = m_firstFree - 1;
764 Node n = (m_next < m_firstFree) ? elementAt(m_next) : null;
832 protected int m_firstFree = 0;
867 return m_firstFree;
880 if ((m_firstFree + 1) >= m_mapSize)
893 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
899 m_map[m_firstFree] = value;
901 m_firstFree++;
912 int ff = m_firstFree;
937 m_firstFree = ff;
948 m_firstFree--;
950 Node n = m_map[m_firstFree];
952 m_map[m_firstFree] = null;
966 m_firstFree--;
968 m_map[m_firstFree] = null;
970 return (m_firstFree == 0) ? null : m_map[m_firstFree - 1];
979 m_firstFree--;
981 m_map[m_firstFree] = null;
993 return ((null != m_map) && (m_firstFree > 0))
994 ? m_map[m_firstFree - 1] : null;
1015 if ((m_firstFree + 2) >= m_mapSize)
1021 System.arraycopy(m_map, 0, newMap, 0, m_firstFree);
1027 m_map[m_firstFree] = v1;
1028 m_map[m_firstFree + 1] = v2;
1029 m_firstFree += 2;
1040 m_firstFree -= 2;
1041 m_map[m_firstFree] = null;
1042 m_map[m_firstFree + 1] = null;
1054 m_map[m_firstFree - 1] = n;
1066 m_map[m_firstFree - 2] = n;
1078 return m_map[m_firstFree - 1];
1090 return m_map[m_firstFree - 2];
1112 else if ((m_firstFree + 1) >= m_mapSize)
1118 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
1123 if (at <= (m_firstFree - 1))
1125 System.arraycopy(m_map, at, m_map, at + 1, m_firstFree - at);
1130 m_firstFree++;
1148 else if ((m_firstFree + nNodes) >= m_mapSize)
1154 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);
1159 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);
1161 m_firstFree += nNodes;
1176 for (int i = 0; i < m_firstFree; i++)
1181 m_firstFree = 0;
1203 for (int i = 0; i < m_firstFree; i++)
1209 if (i < m_firstFree - 1)
1210 System.arraycopy(m_map, i + 1, m_map, i, m_firstFree - i - 1);
1212 m_firstFree--;
1213 m_map[m_firstFree] = null;
1236 if (i >= m_firstFree)
1237 m_firstFree);
1241 if (i < m_firstFree - 1)
1242 System.arraycopy(m_map, i + 1, m_map, i, m_firstFree - i - 1);
1244 m_firstFree--;
1245 m_map[m_firstFree] = null;
1302 for (int i = 0; i < m_firstFree; i++)
1331 for (int i = index; i < m_firstFree; i++)
1359 for (int i = 0; i < m_firstFree; i++)
