| /libcore/luni/src/main/java/org/apache/xml/utils/ |
| IntStack.java | 75 if ((m_firstFree + 1) >= m_mapSize)
81 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
86 m_map[m_firstFree] = i;
88 m_firstFree++;
101 return m_map[--m_firstFree];
110 m_firstFree -= n;
123 return m_map[m_firstFree - 1];
141 return m_map[m_firstFree-(1+n)];
159 m_map[m_firstFree - 1] = val;
176 return m_firstFree == 0
[all...] |
| StringVector.java | 39 protected int m_firstFree = 0;
76 return m_firstFree;
86 return m_firstFree;
97 if ((m_firstFree + 1) >= m_mapSize)
103 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
108 m_map[m_firstFree] = value;
110 m_firstFree++;
138 for (int i = 0; i < m_firstFree; i++)
160 for (int i = 0; i < m_firstFree; i++)
177 if ((m_firstFree + 1) >= m_mapSize
[all...] |
| ObjectVector.java | 43 protected int m_firstFree = 0;
95 m_firstFree = v.m_firstFree;
97 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree);
107 return m_firstFree;
117 m_firstFree = sz;
129 if ((m_firstFree + 1) >= m_mapSize)
135 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
140 m_map[m_firstFree] = value;
142 m_firstFree++
[all...] |
| IntVector.java | 43 protected int m_firstFree = 0;
95 m_firstFree = v.m_firstFree;
97 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree);
107 return m_firstFree;
117 m_firstFree = sz;
129 if ((m_firstFree + 1) >= m_mapSize)
135 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
140 m_map[m_firstFree] = value;
142 m_firstFree++
[all...] |
| NodeVector.java | 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];
[all...] |
| StringToIntTable.java | 45 private int m_firstFree = 0;
84 return m_firstFree;
96 if ((m_firstFree + 1) >= m_mapSize)
102 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
108 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1);
113 m_map[m_firstFree] = key;
114 m_values[m_firstFree] = value;
116 m_firstFree++;
130 for (int i = 0; i < m_firstFree; i++)
152 for (int i = 0; i < m_firstFree; i++
[all...] |
| ObjectStack.java | 75 if ((m_firstFree + 1) >= m_mapSize)
81 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
86 m_map[m_firstFree] = i;
88 m_firstFree++;
101 Object val = m_map[--m_firstFree];
102 m_map[m_firstFree] = null;
113 m_firstFree -= n;
126 return m_map[m_firstFree - 1];
144 return m_map[m_firstFree-(1+n)];
162 m_map[m_firstFree - 1] = val
[all...] |
| SuballocatedIntVector.java | 61 protected int m_firstFree = 0;
125 return m_firstFree;
136 if(m_firstFree>sz) // Whups; had that backward!
137 m_firstFree = sz;
147 int indexRelativeToCache = m_firstFree - m_buildCacheStartIndex;
152 ++m_firstFree;
161 int index=m_firstFree>>>m_SHIFT;
162 int offset=m_firstFree&m_MASK;
179 m_buildCacheStartIndex = m_firstFree-offset;
181 ++m_firstFree;
[all...] |
| FastStringBuffer.java | 151 * of m_lastChunk and m_firstFree.
156 * Field m_firstFree is an index into m_array[m_lastChunk][], pointing to
160 * (m_lastChunk<<m_chunkBits) + m_firstFree
162 int m_firstFree = 0;
270 return (m_lastChunk << m_chunkBits) + m_firstFree;
280 return (m_lastChunk << m_chunkBits) + m_firstFree;
292 m_firstFree = 0;
335 m_firstFree = l & m_chunkMask;
342 if(m_firstFree==0 && m_lastChunk>0)
345 m_firstFree=m_chunkSize
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/serializer/utils/ |
| StringToIntTable.java | 52 private int m_firstFree = 0;
91 return m_firstFree;
103 if ((m_firstFree + 1) >= m_mapSize)
109 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);
115 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1);
120 m_map[m_firstFree] = key;
121 m_values[m_firstFree] = value;
123 m_firstFree++;
137 for (int i = 0; i < m_firstFree; i++)
159 for (int i = 0; i < m_firstFree; i++
[all...] |
| /libcore/luni/src/main/java/org/apache/xpath/ |
| NodeSet.java | 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;
[all...] |
| NodeSetDTM.java | 485 if ((index >= 0) && (m_next < m_firstFree))
488 m_next = m_firstFree - 1;
[all...] |
