Lines Matching refs:token
645 // The key/value pairs are sorted as a token sequence.
970 // Merge w/ previous token.
1027 * text element, but preserving token boundaries where possible.
1039 * Internal token boundaries in the original text, and in the new
1043 * new token.
1046 * separate sub-elements, possibly merging the first token to
1047 * a previous text item (to avoid making a new token boundary).
1050 * append the first new token to it.
1053 * StringBuffer containing both its and the first new token.
1057 * Every token not merged into a previous CharSequence is added
1107 return 0; // Merged with previous token.
1109 // No previous token.
1114 // Tries to merge token with previous contents.
1115 // Returns true if token is successfully disposed of.
1118 // the merged token.
1119 private boolean mergeWithPrev(int i, String token, boolean keepSB) {
1120 if (i == 0) // Trivial success if the token is length zero.
1122 return (token.length() == 0);
1127 psb.append(token);
1133 if (token.length() == 0) {
1139 psb.append(token);
1185 * token boundaries in the text source. Such a text will be
1189 * preceding string, there will be a token boundary between
1868 // %%% normalize attrs to token lists?
2140 Internally, each String sub-element is logically a token.
2141 However, if there was no token-splitting on input,
3723 // Decide whether to merge some of these chars into a previous token.
3746 // Appended only the first token.