Lines Matching defs:m_map
45 private int m_map[];
91 if ((null != this.m_map) && (this.m_map == clone.m_map))
93 clone.m_map = new int[this.m_map.length];
95 System.arraycopy(this.m_map, 0, clone.m_map, 0, this.m_map.length);
121 if (null == m_map)
123 m_map = new int[m_blocksize];
132 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
134 m_map = newMap;
138 m_map[m_firstFree] = value;
155 if (null == m_map)
157 m_map = new int[m_blocksize];
166 System.arraycopy(m_map, 0, newMap, 0, ff + 1);
168 m_map = newMap;
172 m_map[ff] = value;
189 int n = m_map[m_firstFree];
191 m_map[m_firstFree] = DTM.NULL;
207 m_map[m_firstFree] = DTM.NULL;
209 return (m_firstFree == 0) ? DTM.NULL : m_map[m_firstFree - 1];
220 m_map[m_firstFree] = DTM.NULL;
232 return ((null != m_map) && (m_firstFree > 0))
233 ? m_map[m_firstFree - 1] : DTM.NULL;
247 if (null == m_map)
249 m_map = new int[m_blocksize];
260 System.arraycopy(m_map, 0, newMap, 0, m_firstFree);
262 m_map = newMap;
266 m_map[m_firstFree] = v1;
267 m_map[m_firstFree + 1] = v2;
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];
342 if (value < m_map[i])
365 if (null == m_map)
367 m_map = new int[m_blocksize];
376 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
378 m_map = newMap;
383 System.arraycopy(m_map, at, m_map, at + 1, m_firstFree - at);
386 m_map[at] = value;
401 if (null == m_map)
404 m_map = new int[m_mapSize];
412 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);
414 m_map = newMap;
417 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);
431 if (null == m_map)
436 m_map[i] = DTM.NULL;
448 if (null == m_map)
468 if (null == m_map)
473 int node = m_map[i];
478 System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);
480 m_map[i] = DTM.NULL;
502 if (null == m_map)
506 System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);
508 m_map[i] = DTM.NULL;
524 if (null == m_map)
526 m_map = new int[m_blocksize];
533 m_map[index] = node;
546 if (null == m_map)
549 return m_map[i];
562 if (null == m_map)
567 int node = m_map[i];
590 if (null == m_map)
595 int node = m_map[i];
617 if (null == m_map)
622 int node = m_map[i];
737 sort(m_map, 0, m_firstFree - 1);
