/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }
/** * Method called to add leaf entry to word set; basically * "here is the rest of the only matching word" */ private void constructLeaf(int charIndex, int wordIndex) { String word = mWords[wordIndex]; int len = word.length(); char[] data = mData; // need room for 1 header char, rest of the word if ((mSize + len + 1) >= data.length) { data = expand(len+1); } data[mSize++] = (char) (NEGATIVE_OFFSET + (len - charIndex)); for (; charIndex < len; ++charIndex) { data[mSize++] = word.charAt(charIndex); } }