HomeSort by relevance Sort by last modified time
    Searched full:words (Results 326 - 350 of 2986) sorted by null

<<11121314151617181920>>

  /external/libvncserver/common/
md5.c 303 const md5_uint32 *words = buffer; local
305 const md5_uint32 *endp = words + nwords;
320 while (words < endp)
330 unit is a 32-bit word and it is determined to work on words in
333 we store the swapped words in the array CORRECT_WORDS. */
338 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
339 ++words; \
373 /* For the second to fourth round we have the possibly swapped words
  /external/libxml2/doc/
searches.xsl 22 <p><xsl:value-of select="@total"/> total words,
23 <xsl:value-of select="@uniq"/> uniq words.</p>
  /external/mesa3d/src/glx/
glxconfig.h 114 ** we require 2 words across the wire. In order to maintain backwards
115 ** compatibility, we need to send the total number of words that the
  /external/owasp/sanitizer/src/tests/org/owasp/html/
CssGrammarTest.java 45 "words with-dashes #hashes .dots. -and-leading-dashes",
65 "words:IDENT",
  /libcore/luni/src/main/java/java/text/
BreakIterator.java 26 * example, to break a piece of text into words, sentences, or logical
34 * boundaries between words. This is useful for double-click selection or "find
35 * whole words" searches. This type of {@code BreakIterator} makes sure there is
37 * count as words, too). Whitespace and punctuation are kept separate from real
38 * words.</li>
42 * kept with words (you don't want a line to start with whitespace, for
214 * words. The above code uses a simple heuristic to determine which boundary is
219 * between words.)
  /libcore/luni/src/main/java/javax/xml/validation/
Schema.java 35 * change the set of constraints once it is created. In other words,
52 * In other words, if you parse the same schema twice, you may
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
PersonalDictionaryLookupTest.java 84 UserDictionary.Words.addWord(mContext, word, frequency, shortcut, locale);
86 Cursor cursor = mContentResolver.query(UserDictionary.Words.CONTENT_URI, null,
87 UserDictionary.Words.WORD + "='" + word + "'", null, null);
89 Uri uri = Uri.withAppendedPath(UserDictionary.Words.CONTENT_URI,
90 cursor.getString(cursor.getColumnIndex(UserDictionary.Words._ID)));
221 // But similar looking words don't match.
249 // But similar looking words don't match.
274 // But similar looking words don't match.
  /packages/inputmethods/LatinIME/tools/dicttool/tests/com/android/inputmethod/latin/makedict/
FusionDictionaryTest.java 70 private static void checkDictionary(final FusionDictionary dict, final ArrayList<String> words,
74 for (final String word : words) {
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/
tcp.h 66 __be32 words[5]; member in union:tcp_word_hdr
69 #define tcp_flag_word(tp) ( ((union tcp_word_hdr *)(tp))->words [3])
  /art/runtime/arch/arm/
instruction_set_features_assembly_tests.S 31 // sdiv r0,r1,r1 is two words: 0xfb91 0xf1f0. We need little endian.
  /art/tools/dexfuzz/src/dexfuzz/program/
MInsn.java 33 * The location of this instruction, as an offset in code words from the beginning.
  /cts/suite/audio_quality/lib/src/
SimpleScriptExec.h 44 * check if the given str include magic words for pass.
  /development/samples/SearchableDictionary/res/values/
strings.xml 34 <string name="settings_description">Definitions of words</string>
  /external/icu/icu4c/source/data/xml/rbnf/
en.xml 15 <ruleset type="with-words">
mt.xml 15 <ruleset type="with-words">
  /external/kernel-headers/original/uapi/linux/
filter.h 55 * Number of scratch memory words for: BPF_ST and BPF_STX
  /external/libunwind/doc/
unw_flush_cache.man 54 less. In other words, unw_flush_cache()
unw_flush_cache.tex 28 but \emph{never} less. In other words, \Func{unw\_flush\_cache}() may
  /external/libvpx/libvpx/
keywords.dox 3 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL
  /external/llvm/test/CodeGen/ARM/
2013-05-02-AAPCS-ByVal-Structs-C4-C5-VFP2.ll 18 %st_t* byval %p1, ; --> SP+8, 4 words NSAA=SP+24
  /external/llvm/test/MC/Disassembler/Hexagon/
alu32_perm.txt 4 # Combine words in to doublewords
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_context.h 29 unsigned offset, unsigned words, const uint32_t *);
  /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/
Value.java 40 * Returns the size of this value in words.
  /external/neven/Embedded/common/src/b_BasicEm/
ComplexArr.h 84 /** calculates the amount of heap memory needed (16bit words) if created with given parameters */
104 /** size in 16-bit words object needs when written to memory */
108 /** writes object to memory; returns number of words (16-bit) written */
113 /** reads object from memory; returns number of words (16-bit) read */
MemTbl.h 120 /** returns pointer to fastest exclusive segment that has at least minSizeA words available */
125 /** returns pointer to exclusive segment that has most words available */
129 /** returns fastest shared segment that has at least minSizeA words available */
134 /** returns shared segment that has most words available */

Completed in 961 milliseconds

<<11121314151617181920>>