HomeSort by relevance Sort by last modified time
    Searched refs:wordIndex (Results 1 - 5 of 5) sorted by null

  /packages/inputmethods/LatinIME/native/jni/src/
words_priority_queue_pool.h 51 WordsPriorityQueue *getSubQueue(const int wordIndex, const int inputWordLength) {
52 if (wordIndex >= MULTIPLE_WORDS_SUGGESTION_MAX_WORDS) {
61 return mSubQueues[wordIndex * SUB_QUEUE_MAX_COUNT + inputWordLength];
71 inline void clearSubQueue(const int wordIndex) {
73 WordsPriorityQueue *queue = getSubQueue(wordIndex, i);
  /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
SHA1Impl.java 179 int wordIndex = index >>2;
192 intArray[wordIndex] |= ( byteInput[i] & 0xFF ) << ((3 - byteIndex)<<3) ;
196 wordIndex++;
197 if ( wordIndex == 16 ) { // intArray is full, computing hash
200 wordIndex = 0;
213 intArray[wordIndex] = ( ((int) byteInput[i ] & 0xFF) <<24 ) |
218 wordIndex++;
220 if ( wordIndex < 16 ) { // buffer is not full yet
224 wordIndex = 0;
241 intArray[wordIndex] = w
    [all...]
  /external/libphonenumber/java/src/com/android/i18n/phonenumbers/geocoding/
FlyweightMapStorage.java 201 int wordIndex = index * wordSize;
203 outputBuffer.putShort(wordIndex, objectInput.readShort());
205 outputBuffer.putInt(wordIndex, objectInput.readInt());
221 int wordIndex = index * wordSize;
223 objectOutput.writeShort(inputBuffer.getShort(wordIndex));
225 objectOutput.writeInt(inputBuffer.getInt(wordIndex));
240 int wordIndex = index * wordSize;
241 return wordSize == SHORT_NUM_BYTES ? buffer.getShort(wordIndex) : buffer.getInt(wordIndex);
256 int wordIndex = index * wordSize
    [all...]
  /external/webkit/Source/WebKit/android/content/
PhoneEmailDetector.cpp 302 int wordIndex = 0;
307 match = wordMatch[wordIndex];
310 if (chars[wordIndex] != match)
312 wordIndex++;
317 wordIndex = 0;
320 wordIndex = 1;
322 chars += wordIndex;
  /dalvik/vm/
BitVector.cpp 298 unsigned int wordIndex = bitIndex >> 5;
300 if (pBits->storage[wordIndex] & mask) {

Completed in 251 milliseconds