Lines Matching refs:m_map
58 protected int m_map[][];
63 /** "Shortcut" handle to m_map[0]. Surprisingly helpful for short vectors. */
66 /** "Shortcut" handle to most recently added row of m_map.
102 m_map = new int[numblocks][];
103 m_map[0]=m_map0;
149 // Is the new index an index into the cache row of m_map?
164 if(index>=m_map.length)
168 System.arraycopy(m_map, 0, newMap, 0, m_map.length);
169 m_map=newMap;
171 int[] block=m_map[index];
173 block=m_map[index]=new int[m_blocksize];
176 // Cache the current row of m_map. Next m_blocksize-1
204 if(index>=m_map.length)
208 System.arraycopy(m_map, 0, newMap, 0, m_map.length);
209 m_map=newMap;
211 int[] block=m_map[index];
213 block=m_map[index]=new int[m_blocksize];
239 m_map[i]=new int[m_blocksize];
262 if(index>=m_map.length)
266 System.arraycopy(m_map, 0, newMap, 0, m_map.length);
267 m_map=newMap;
269 int[] block=m_map[index];
271 block=m_map[index]=new int[m_blocksize];
288 int[] block=m_map[index];
292 block=m_map[index]=new int[m_blocksize];
357 int[] block=m_map[index];
359 block=m_map[index]=new int[m_blocksize];
364 int[] next=m_map[index+1];
396 if(index>=m_map.length)
400 System.arraycopy(m_map, 0, newMap, 0, m_map.length);
401 m_map=newMap;
404 int[] block=m_map[index];
406 block=m_map[index]=new int[m_blocksize];
442 return m_map[i>>>m_SHIFT][i&m_MASK];
480 block=m_map[bindex];
489 block=m_map[maxindex];
529 int[] block=m_map[index];
549 * Return the m_map double array
554 return m_map;
