/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/utils/ |
H A D | StringToIntTable.java | 54 private int m_firstFree = 0; field in class:StringToIntTable 93 return m_firstFree; 105 if ((m_firstFree + 1) >= m_mapSize) 111 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 117 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); 122 m_map[m_firstFree] = key; 123 m_values[m_firstFree] = value; 125 m_firstFree++; 139 for (int i = 0; i < m_firstFree; i++) 161 for (int i = 0; i < m_firstFree; [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/ |
H A D | StringToIntTable.java | 47 private int m_firstFree = 0; field in class:StringToIntTable 86 return m_firstFree; 98 if ((m_firstFree + 1) >= m_mapSize) 104 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 110 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); 115 m_map[m_firstFree] = key; 116 m_values[m_firstFree] = value; 118 m_firstFree++; 132 for (int i = 0; i < m_firstFree; i++) 154 for (int i = 0; i < m_firstFree; [all...] |
H A D | StringToStringTable.java | 40 private int m_firstFree = 0; field in class:StringToStringTable 77 return m_firstFree; 91 if ((m_firstFree + 2) >= m_mapSize) 97 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 102 m_map[m_firstFree] = key; 104 m_firstFree++; 106 m_map[m_firstFree] = value; 108 m_firstFree++; 121 for (int i = 0; i < m_firstFree; i += 2) 138 for (int i = 0; i < m_firstFree; [all...] |
H A D | StringToStringTableVector.java | 40 private int m_firstFree = 0; field in class:StringToStringTableVector 77 return m_firstFree; 87 return m_firstFree; 98 if ((m_firstFree + 1) >= m_mapSize) 104 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 109 m_map[m_firstFree] = value; 111 m_firstFree++; 126 for (int i = m_firstFree - 1; i >= 0; --i) 148 for (int i = m_firstFree - 1; i >= 0; --i) 163 if (m_firstFree > [all...] |
H A D | StringVector.java | 41 protected int m_firstFree = 0; field in class:StringVector 78 return m_firstFree; 88 return m_firstFree; 99 if ((m_firstFree + 1) >= m_mapSize) 105 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 110 m_map[m_firstFree] = value; 112 m_firstFree++; 140 for (int i = 0; i < m_firstFree; i++) 162 for (int i = 0; i < m_firstFree; i++) 179 if ((m_firstFree [all...] |
H A D | IntVector.java | 45 protected int m_firstFree = 0; field in class:IntVector 97 m_firstFree = v.m_firstFree; 99 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree); 109 return m_firstFree; 119 m_firstFree = sz; 131 if ((m_firstFree + 1) >= m_mapSize) 137 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 142 m_map[m_firstFree] = value; 144 m_firstFree [all...] |
H A D | ObjectVector.java | 45 protected int m_firstFree = 0; field in class:ObjectVector 97 m_firstFree = v.m_firstFree; 99 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree); 109 return m_firstFree; 119 m_firstFree = sz; 131 if ((m_firstFree + 1) >= m_mapSize) 137 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 142 m_map[m_firstFree] = value; 144 m_firstFree [all...] |
H A D | SuballocatedByteVector.java | 58 protected int m_firstFree = 0; field in class:SuballocatedByteVector 104 return m_firstFree; 114 if(m_firstFree<sz) 115 m_firstFree = sz; 125 if(m_firstFree<m_blocksize) 126 m_map0[m_firstFree++]=value; 129 int index=m_firstFree/m_blocksize; 130 int offset=m_firstFree%m_blocksize; 131 ++m_firstFree; 154 if(m_firstFree [all...] |
H A D | FastStringBuffer.java | 153 * of m_lastChunk and m_firstFree. 158 * Field m_firstFree is an index into m_array[m_lastChunk][], pointing to 162 * (m_lastChunk<<m_chunkBits) + m_firstFree 164 int m_firstFree = 0; field in class:FastStringBuffer 272 return (m_lastChunk << m_chunkBits) + m_firstFree; 282 return (m_lastChunk << m_chunkBits) + m_firstFree; 294 m_firstFree = 0; 337 m_firstFree = l & m_chunkMask; 344 if(m_firstFree==0 && m_lastChunk>0) 347 m_firstFree [all...] |
H A D | NodeVector.java | 53 protected int m_firstFree = 0; field in class:NodeVector 110 return m_firstFree; 121 if ((m_firstFree + 1) >= m_mapSize) 134 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 140 m_map[m_firstFree] = value; 142 m_firstFree++; 153 int ff = m_firstFree; 178 m_firstFree = ff; 189 m_firstFree--; 191 int n = m_map[m_firstFree]; [all...] |
H A D | SuballocatedIntVector.java | 63 protected int m_firstFree = 0; field in class:SuballocatedIntVector 127 return m_firstFree; 138 if(m_firstFree>sz) // Whups; had that backward! 139 m_firstFree = sz; 149 int indexRelativeToCache = m_firstFree - m_buildCacheStartIndex; 154 ++m_firstFree; 163 int index=m_firstFree>>>m_SHIFT; 164 int offset=m_firstFree&m_MASK; 181 m_buildCacheStartIndex = m_firstFree-offset; 183 ++m_firstFree; [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/ |
H A D | NodeSet.java | 331 if ((index >= 0) && (m_next < m_firstFree)) 334 m_next = m_firstFree - 1; 766 Node n = (m_next < m_firstFree) ? elementAt(m_next) : null; 834 protected int m_firstFree = 0; field in class:NodeSet 869 return m_firstFree; 882 if ((m_firstFree + 1) >= m_mapSize) 895 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); 901 m_map[m_firstFree] = value; 903 m_firstFree++; 914 int ff = m_firstFree; [all...] |