Lines Matching defs:parts
182 * // (i.e., TokenLists and anonymous Elements are broken out into their parts)
294 // significant parts besides its sub-elements. Therefore,
299 // number of child elements, in parts[0..size-1]
301 // The parts start with child elements:: {e0, e1, e2, ...}.
306 Object[] parts;
314 this.parts = capacity > 0 ? new Object[capacity] : noPartsFrozen;
379 parts[fillp++] = elems[i];
411 System.arraycopy(old.parts, 0, parts, 0, size);
412 int alen = parts.length
415 System.arraycopy(old.parts, old.parts.length - alen,
416 parts, parts.length - alen,
435 System.arraycopy(parts, parts.length - alen, copy.parts, plen - alen, alen);
438 Object e = parts[i];
472 System.arraycopy(parts, parts.length - alen, nparts, size, alen);
475 Object e = parts[i];
487 parts = nparts;
555 && parts.length > 0 && parts[parts.length - 1] == null) {
556 // If no attributes, free the parts array.
557 parts = noPartsNotFrozen;
570 parts[i] = null;
583 Object[] thisParts = this.parts;
584 Object[] thatParts = that.parts;
617 for (int i = parts.length - alen; i < parts.length; i += 2) {
618 hc += (parts[i + 0].hashCode() ^ parts[i + 1].hashCode());
624 Object p = parts[i];
658 Object[] thisParts = this.parts;
659 Object[] thatParts = that.parts;
735 return parts[i];
744 Object old = parts[i];
750 parts[i] = e;
766 Object e = parts[i];
892 return size == 0 ? null : parts[size - 1];
905 return parts[0].toString();
907 return new TokenList(parts, 0, size);
928 result[i] = ((CharSequence) parts[i]).toString();
944 if (parts[0] instanceof CharSequence) {
945 return parts[0].toString();
957 Object text = parts[i];
978 return (CharSequence) result.parts[0];
987 if (!(parts[i] instanceof CharSequence)) {
997 if (parts[i] instanceof CharSequence) {
1007 ((CharSequence) parts[i]).getClass();
1124 Object prev = parts[i - 1];
1129 parts[i - 1] = psb.toString();
1141 parts[i - 1] = psb;
1143 parts[i - 1] = psb.toString();
1158 Object[] parts = this.parts;
1160 Object e = parts[i];
1168 parts[fillp++] = e;
1171 parts[--size] = null;
1212 System.arraycopy(parts, 0, result, 0, size);
1218 System.arraycopy(parts, 0, content.parts, 0, size);
1224 Arrays.sort(parts, 0, size, c);
1234 Object p = parts[i];
1235 parts[i] = parts[j];
1236 parts[j] = p;
1283 parts[fill++] = part;
1295 System.arraycopy(e.parts, 0, parts, i, esize);
1384 Object x = f.filter(parts[i]);
1397 Object x = f.filter(parts[i]);
1419 Object p = parts[i];
1457 Object p = parts[i];
1503 elementClass.cast(parts[i]).getClass();
1510 if (!elementClass.isInstance(parts[i])) {
1633 if (e.equals(parts[i])) {
1642 if (e.equals(parts[i])) {
1661 Object x = f.filter(parts[i]);
1681 Object x = f.filter(parts[i]);
1696 int attrBase = parts.length;
1697 for (int i = parts.length - 2; i >= size; i -= 2) {
1698 String akey = (String) parts[i + 0];
1706 parts[i + 0] = key;
1707 //parts[i+1] = ""; //caller responsibility
1721 int alen = parts.length - attrBase;
1724 assert (parts[size + 0] == null && parts[size + 1] == null);
1726 int i = parts.length - alen;
1727 parts[i + 0] = key;
1728 //parts[i+1] = ""; //caller responsibility
1750 return (i < 0) ? dflt : (String) parts[i + 1];
1778 int i = parts.length - (k * 2) - 2;
1779 if (i < size || parts[i] == null) {
1790 return (String) parts[indexAttr(k) + 1];
1794 return (String) parts[indexAttr(k) + 0];
1811 int cursor = -2; // pointer from end of parts
1814 int i = cursor + parts.length;
1815 return i >= size && parts[i] == null;
1819 int i = cursor + parts.length;
1821 if (i < size || (x = parts[i]) == null) {
1849 Object[] attrParts = attrs.parts;
1851 System.arraycopy(parts, parts.length - alen,
1877 clearParts(parts.length - alen, alen);
1894 Object k = parts[i + 0];
1895 Object v = parts[i + 1];
1899 parts[i + 2] = k;
1900 parts[i + 3] = v;
1902 parts[i + 2] = null;
1903 parts[i + 3] = null;
1907 if (parts.length == 0 || parts[parts.length - 1] == null) {
1912 // If no elements, free the parts array.
1913 parts = noPartsNotFrozen;
1916 for (int i = parts.length - 1; parts[i] != null; i--) {
1918 parts[i] = null;
1927 old = (String) parts[i + 1];
1935 old = (String) parts[i + 1];
1936 parts[i + 1] = value;
1965 String old = (String) parts[i + 1];
1970 parts[i + 1] = value;
1976 return parts.length - attrBase();
1996 Object[] thisParts = this.parts;
1997 Object[] thatParts = that.parts;
2000 // search indexes into unmatched parts of this.attrs:
2002 // search indexes into unmatched parts of that.attrs:
2090 int kmax = (parts.length - size) >>> 1;
2092 int abase = parts.length - (kmax * 2);
2096 if (parts[abase + (kmid * 2)] == null) {
2110 int alen = parts.length - abase;
2114 String akey = (String) parts[abase + (k * 2) + 0];
2124 int fillp = parts.length;
2129 parts[fillp + 0] = akey;
2130 parts[fillp + 1] = aval;
2162 if (!(parts[i] instanceof CharSequence)) {
2166 String str = parts[i].toString();
2174 parts[i] = st.nextToken();
2179 parts[i + j] = st.nextToken();
2302 return parts[lastRet = cursor++];
2309 return parts[--cursor];
2321 parts[lastRet] = x;
2571 int alen = parts.length - abase; // slots allocated for attrs
2573 if (nlen != parts.length) {
2576 System.arraycopy(parts, abase, nparts, nlen - alen, alen);
2578 System.arraycopy(parts, 0, nparts, 0, size);
2579 parts = nparts;
2590 if (lastNull >= parts.length) {
2593 return (parts[lastNull] == null);
2596 // Opens up parts array at pos by len spaces.
2603 System.arraycopy(parts, pos, parts, pos + len, tlen);
2607 // Reallocate and open up at parts[pos] to at least len empty places.
2620 int alen = parts.length - abase; // slots allocated for attrs
2625 System.arraycopy(parts, 0, nparts, 0, pos);
2627 System.arraycopy(parts, pos, nparts, pos + len, tlen);
2629 System.arraycopy(parts, abase, nparts, nlen - alen, alen);
2631 parts = nparts;
2654 // Close up at parts[pos] len old places.
2656 // Fill unused end of parts with null.
2663 System.arraycopy(parts, pos + len, parts, pos, tlen);
2704 for (int i = 0; i < parts.length; i++) {
2705 Object p = parts[i];
3457 * resulting filter value e, or its parts.
3459 * If e is a TokenList or an anonymous Element, add e's parts
3513 * If e is a TokenList or an anonymous Element, add e's parts
3514 * to the collection, and return the number of parts.
3577 Object[] parts = new Object[30];
3579 int[] attrBases = new int[10]; // index into parts
3580 int[] elemBases = new int[10]; // index into parts
3587 int mergeableToken = -1; // index into parts of recent CharSequence
3592 if (nparts == parts.length) {
3593 Object[] newParts = new Object[parts.length * 2];
3594 System.arraycopy(parts, 0, newParts, 0, parts.length);
3595 parts = newParts;
3597 parts[nparts++] = x;
3602 assert (parts[mergeableToken] instanceof CharSequence);
3603 return parts[nparts - 1];
3612 assert (parts[mergeableToken] instanceof CharSequence);
3613 parts[mergeableToken] = parts[mergeableToken].toString();
3622 assert (parts[mergeableToken] instanceof CharSequence);
3661 Element e = new Element((String) parts[nbase], elen, cap);
3664 e.parts[cap - k - 2] = parts[abase + k + 0];
3665 e.parts[cap - k - 1] = parts[abase + k + 1];
3668 System.arraycopy(parts, ebase, e.parts, 0, elen);
3737 parts[nparts - 1] = prevBuf;
3740 parts[nparts - 1] = prevBuf.toString();
3748 // Add the rest as separate parts.