| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | NodeVector.java | 51 protected int m_firstFree = 0; field in NodeVector
108 return m_firstFree; in size()
119 if ((m_firstFree + 1) >= m_mapSize) in addElement()
132 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in addElement()
138 m_map[m_firstFree] = value; in addElement()
140 m_firstFree++; in addElement()
151 int ff = m_firstFree; in push()
176 m_firstFree = ff; in push()
187 m_firstFree--; in pop()
189 int n = m_map[m_firstFree]; in pop()
[all …]
|
| D | IntVector.java | 43 protected int m_firstFree = 0; field in IntVector
95 m_firstFree = v.m_firstFree; in IntVector()
97 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree); in IntVector()
107 return m_firstFree; in size()
117 m_firstFree = sz; in setSize()
129 if ((m_firstFree + 1) >= m_mapSize) in addElement()
135 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in addElement()
140 m_map[m_firstFree] = value; in addElement()
142 m_firstFree++; in addElement()
153 if ((m_firstFree + numberOfElements) >= m_mapSize) in addElements()
[all …]
|
| D | ObjectVector.java | 43 protected int m_firstFree = 0; field in ObjectVector
95 m_firstFree = v.m_firstFree; in ObjectVector()
97 System.arraycopy(v.m_map, 0, m_map, 0, m_firstFree); in ObjectVector()
107 return m_firstFree; in size()
117 m_firstFree = sz; in setSize()
129 if ((m_firstFree + 1) >= m_mapSize) in addElement()
135 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in addElement()
140 m_map[m_firstFree] = value; in addElement()
142 m_firstFree++; in addElement()
153 if ((m_firstFree + numberOfElements) >= m_mapSize) in addElements()
[all …]
|
| D | SuballocatedIntVector.java | 61 protected int m_firstFree = 0; field in SuballocatedIntVector
125 return m_firstFree; in size()
136 if(m_firstFree>sz) // Whups; had that backward! in setSize()
137 m_firstFree = sz; in setSize()
147 int indexRelativeToCache = m_firstFree - m_buildCacheStartIndex; in addElement()
152 ++m_firstFree; in addElement()
161 int index=m_firstFree>>>m_SHIFT; in addElement()
162 int offset=m_firstFree&m_MASK; in addElement()
179 m_buildCacheStartIndex = m_firstFree-offset; in addElement()
181 ++m_firstFree; in addElement()
[all …]
|
| D | StringVector.java | 39 protected int m_firstFree = 0; field in StringVector
76 return m_firstFree; in getLength()
86 return m_firstFree; in size()
97 if ((m_firstFree + 1) >= m_mapSize) in addElement()
103 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in addElement()
108 m_map[m_firstFree] = value; in addElement()
110 m_firstFree++; in addElement()
138 for (int i = 0; i < m_firstFree; i++) in contains()
160 for (int i = 0; i < m_firstFree; i++) in containsIgnoreCase()
177 if ((m_firstFree + 1) >= m_mapSize) in push()
[all …]
|
| D | StringToIntTable.java | 45 private int m_firstFree = 0; field in StringToIntTable
84 return m_firstFree; in getLength()
96 if ((m_firstFree + 1) >= m_mapSize) in put()
102 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in put()
108 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); in put()
113 m_map[m_firstFree] = key; in put()
114 m_values[m_firstFree] = value; in put()
116 m_firstFree++; in put()
130 for (int i = 0; i < m_firstFree; i++) in get()
152 for (int i = 0; i < m_firstFree; i++) in getIgnoreCase()
[all …]
|
| D | ObjectStack.java | 75 if ((m_firstFree + 1) >= m_mapSize) in push()
81 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in push()
86 m_map[m_firstFree] = i; in push()
88 m_firstFree++; in push()
101 Object val = m_map[--m_firstFree]; in pop()
102 m_map[m_firstFree] = null; in pop()
113 m_firstFree -= n; in quickPop()
126 return m_map[m_firstFree - 1]; in peek()
144 return m_map[m_firstFree-(1+n)]; in peek()
162 m_map[m_firstFree - 1] = val; in setTop()
[all …]
|
| D | IntStack.java | 75 if ((m_firstFree + 1) >= m_mapSize) in push()
81 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in push()
86 m_map[m_firstFree] = i; in push()
88 m_firstFree++; in push()
101 return m_map[--m_firstFree]; in pop()
110 m_firstFree -= n; in quickPop()
123 return m_map[m_firstFree - 1]; in peek()
141 return m_map[m_firstFree-(1+n)]; in peek()
159 m_map[m_firstFree - 1] = val; in setTop()
176 return m_firstFree == 0; in empty()
|
| D | FastStringBuffer.java | 162 int m_firstFree = 0; field in FastStringBuffer
270 return (m_lastChunk << m_chunkBits) + m_firstFree; in size()
280 return (m_lastChunk << m_chunkBits) + m_firstFree; in length()
292 m_firstFree = 0; in reset()
335 m_firstFree = l & m_chunkMask; in setLength()
342 if(m_firstFree==0 && m_lastChunk>0) in setLength()
345 m_firstFree=m_chunkSize; in setLength()
381 rootFSB.m_firstFree = l & m_chunkMask; in setLength()
401 int length = (m_lastChunk << m_chunkBits) + m_firstFree; in toString()
424 if (m_firstFree < m_chunkSize) // Simplified test single-character-fits in append()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| D | NodeSet.java | 329 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
332 m_next = m_firstFree - 1; in runTo()
764 Node n = (m_next < m_firstFree) ? elementAt(m_next) : null; in getCurrentNode()
832 protected int m_firstFree = 0; field in NodeSet
867 return m_firstFree; in size()
880 if ((m_firstFree + 1) >= m_mapSize) in addElement()
893 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in addElement()
899 m_map[m_firstFree] = value; in addElement()
901 m_firstFree++; in addElement()
912 int ff = m_firstFree; in push()
[all …]
|
| D | NodeSetDTM.java | 485 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
488 m_next = m_firstFree - 1; in runTo()
1153 int n = (current < m_firstFree) ? elementAt(current) : DTM.NULL; in getCurrentNode()
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
| D | StringToIntTable.java | 52 private int m_firstFree = 0; field in StringToIntTable
91 return m_firstFree; in getLength()
103 if ((m_firstFree + 1) >= m_mapSize) in put()
109 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1); in put()
115 System.arraycopy(m_values, 0, newValues, 0, m_firstFree + 1); in put()
120 m_map[m_firstFree] = key; in put()
121 m_values[m_firstFree] = value; in put()
123 m_firstFree++; in put()
137 for (int i = 0; i < m_firstFree; i++) in get()
159 for (int i = 0; i < m_firstFree; i++) in getIgnoreCase()
[all …]
|