/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
H A D | Encodings.java | 336 int totalEntries = props.size(); 382 EncodingInfo[] ret_ei = new EncodingInfo[encodingInfo_list.size()];
|
H A D | NamespaceMappings.java | 496 String[] prefixArray = new String[foundPrefixes.size()];
|
H A D | SerializerTraceWriter.java | 57 /** The size of the internal buffer, just to keep too many 77 * @param size 79 private void setBufferSize(int size) argument 81 buf = new byte[size + 3]; 82 buf_length = size; 228 /* If the request length exceeds the size of the output buffer, 289 /* If the request length exceeds the size of the output buffer,
|
H A D | ToStream.java | 2814 final int len = URI_and_localNames.size() - 1; 3319 /** Array size allocated */ 3327 * block size is very small, for small lists. 3335 * Construct a IntVector, using the given block size. 3337 * @param size array size to allocate 3339 public BoolStack(int size) argument 3342 m_allocatedSize = size; 3343 m_values = new boolean[size]; 3352 public final int size() method in class:ToStream.BoolStack [all...] |
H A D | ToUnknownStream.java | 1061 final int n = m_namespacePrefix.size(); 1135 final int max = m_namespacePrefix.size();
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/dom3/ |
H A D | DOMStringListImpl.java | 79 return fStrings.size();
|
H A D | LSSerializerImpl.java | 1469 int size = tokenizer.countTokens();
1471 for(int i = 1; i < size; ++i) {
|
H A D | NamespaceSupport.java | 65 * <prefix, uri>. The default size can be set to anything
76 // NOTE: The constructor depends on the initial context size
82 * index of declared namespace bindings and runs to the size of the
276 private int size = 0;
field in class:NamespaceSupport.Prefixes 281 public Prefixes(String [] prefixes, int size) {
argument 283 this.size = size;
290 return (counter< size);
297 if (counter< size){
305 for (int i=0;i<size; [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
H A D | BoolStack.java | 34 /** Array size allocated */ 42 * block size is very small, for small lists. 50 * Construct a IntVector, using the given block size. 52 * @param size array size to allocate 54 public BoolStack(int size) argument 57 m_allocatedSize = size; 58 m_values = new boolean[size]; 67 public final int size() method in class:BoolStack 181 * Grows the size o [all...] |
H A D | DOMBuilder.java | 372 int nDecls = m_prefixMappings.size(); 596 return (null == m_docFrag) && m_elemStack.size() == 0 && (null == m_currentNode || m_currentNode.getNodeType() == Node.DOCUMENT_NODE);
|
H A D | DOMHelper.java | 765 int nCandidates = m_candidateNoAncestorXMLNS.size();
|
H A D | FastStringBuffer.java | 42 * The size values are parameterized, to allow tuning this code. In 56 // If nonzero, forces the inial chunk size. 63 // If we want to retain the variable-size-block feature, we need to reconsider 64 // that issue. For now, I have forced us into fixed-size mode. 105 * the largest permissible chunk size is in this particular FastStringBuffer 112 * many chunks should be allocated at one size before we encapsulate them 113 * into the first chunk of the next size up. For example, if m_rechunkBits 114 * is set to 3, then after 8 chunks at a given size we will rebundle 115 * them as the first element of a FastStringBuffer using a chunk size 121 * Field m_chunkSize establishes the maximum size o 268 public final int size() method in class:FastStringBuffer [all...] |
H A D | IntStack.java | 30 * heavy recopying penalty if/when its size is increased. If we expect deep 39 * block size is very small, for small lists. 47 * Construct a IntVector, using the given block size. 195 return size() - i;
|
H A D | IntVector.java | 50 * block size is very small, for small lists. 61 * Construct a IntVector, using the given block size. 74 * Construct a IntVector, using the given block size. 105 public final int size() method in class:IntVector 300 * than the current size of the vector.
|
H A D | NodeVector.java | 69 * Construct a NodeVector, using the given block size. 106 public int size() method in class:NodeVector 399 int nNodes = nodes.size(); 516 * than the current size of the vector.
|
H A D | ObjectPool.java | 81 * @param size Size of vector to allocate 83 public ObjectPool(Class type, int size) argument 86 freeStack = new ArrayList(size); 113 Object result = freeStack.remove(freeStack.size() - 1); 148 Object result = freeStack.remove(freeStack.size() - 1);
|
H A D | ObjectStack.java | 30 * heavy recopying penalty if/when its size is increased. If we expect deep 39 * block size is very small, for small lists. 47 * Construct a ObjectVector, using the given block size. 198 return size() - i;
|
H A D | ObjectVector.java | 50 * block size is very small, for small lists. 61 * Construct a IntVector, using the given block size. 74 * Construct a IntVector, using the given block size. 105 public final int size() method in class:ObjectVector 297 * than the current size of the vector. 406 * Reset the array to the supplied size. 408 * @param size 410 public final void setToSize(int size) { argument 412 Object newMap[] = new Object[size]; 415 m_mapSize = size; [all...] |
H A D | QName.java | 269 int depth = namespaces.size();
|
H A D | StringVector.java | 46 * block size is very small, for small lists. 57 * Construct a StringVector, using the given block size. 84 public final int size() method in class:StringVector
|
H A D | StylesheetPIHandler.java | 118 int sz = m_stylesheets.size();
|
H A D | SuballocatedIntVector.java | 76 * block size is currently 2K, which may be overkill for 85 * Construct a IntVector, using the given block size and number 86 * of blocks. For efficiency, we will round the requested size 108 /** Construct a IntVector, using the given block size and 123 public int size() method in class:SuballocatedIntVector 156 // size is 4M integers... and we grow by at least that much each 382 * than the current size of the vector.
|
/dalvik/libcore/xml/src/main/java/org/apache/xpath/ |
H A D | NodeSet.java | 73 * Create an empty, using the given block size. 244 if ((m_next) < this.size()) 368 return this.size(); 606 addNodesInDocOrder(i, size() - 1, testIndex, nodelist, support); 646 int size = size(), i; 648 for (i = size - 1; i >= 0; i--) 674 insertIndex = this.size(); 865 public int size() method in class:NodeSet 1141 int nNodes = nodes.size(); [all...] |
H A D | NodeSetDTM.java | 76 * Create an empty, using the given block size. 195 * a pair of non-zero positive integers (the context position and the context size) 219 if(size() > 0) 388 if ((m_next) < this.size()) 524 return this.size(); 766 // addNodesInDocOrder(i, size() - 1, testIndex, nodelist, support); 806 int size = size(), i; 808 for (i = size - 1; i >= 0; i--) 835 insertIndex = this.size(); 881 public int size() method in class:NodeSetDTM [all...] |
H A D | SourceTreeManager.java | 92 int n = m_sourceTree.size(); 149 for(int i=m_sourceTree.size()-1;i>=0;--i) 208 int n = m_sourceTree.size();
|