HomeSort by relevance Sort by last modified time
    Searched full:words (Results 1 - 25 of 2738) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/robolectric/.idea/dictionaries/
pivotal.xml 3 <words>
7 </words>
  /external/valgrind/main/none/tests/s390x/
stfle.stdout.exp 1 the value of cc is 0 and #double words is 2
2 the value of cc is 0 and #double words is 2
4 the value of cc is 0 and #double words is 2
6 the value of cc is 3 and #double words is 2
7 the value of cc is 3 and #double words is 2
  /external/openssh/
mdoc2man.awk 47 retval=retval words[++w]
74 nwords=split($0,words)
77 if(match(words[w],"^Li|Pf$")) {
79 } else if(match(words[w],"^Xo$")) {
84 } else if(match(words[w],"^Xc$")) {
90 } else if(match(words[w],"^Bd$")) {
92 if(match(words[w+1],"-literal")) {
97 } else if(match(words[w],"^Ed$")) {
100 } else if(match(words[w],"^Ns$")) {
105 } else if(match(words[w],"^No$"))
    [all...]
  /development/samples/training/multiscreen/newsreader/src/com/example/android/newsreader/
NonsenseGenerator.java 77 List<String> words = new ArrayList<String>(); local
78 generateSentence(words, isHeadline);
79 words.set(0, String.valueOf(Character.toUpperCase(words.get(0).charAt(0))) +
80 words.get(0).substring(1));
81 return joinWords(words);
102 * @param words the list of words to which the sentence will be appended.
105 private void generateSentence(List<String> words, boolean isHeadline) {
107 generateTimeClause(words, isHeadline)
    [all...]
  /packages/providers/UserDictionaryProvider/src/com/android/providers/userdictionary/
UserDictionaryProvider.java 35 import android.provider.UserDictionary.Words;
40 * Provides access to a database of user defined words. Each item has a word and a frequency.
66 private static final String USERDICT_TABLE_NAME = "words";
72 private static final int WORDS = 1;
90 + Words._ID + " INTEGER PRIMARY KEY,"
91 + Words.WORD + " TEXT,"
92 + Words.FREQUENCY + " INTEGER,"
93 + Words.LOCALE + " TEXT,"
94 + Words.APP_ID + " INTEGER,"
95 + Words.SHORTCUT + " TEXT
    [all...]
  /external/llvm/test/CodeGen/Generic/
fastcall.ll 8 define fastcc void @gcov_read_words(i32 %words) {
10 store i32 %words, i32* getelementptr (%struct.__gcov_var*
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
SuggestedWordsTests.java 40 final SuggestedWords words = new SuggestedWords( local
47 assertEquals(NUMBER_OF_ADDED_SUGGESTIONS + 1, words.size());
48 assertEquals("typed", words.getWord(0));
49 assertEquals(SuggestedWordInfo.KIND_TYPED, words.getInfo(0).mKind);
50 assertEquals("0", words.getWord(1));
51 assertEquals(SuggestedWordInfo.KIND_CORRECTION, words.getInfo(1).mKind);
52 assertEquals("4", words.getWord(5));
53 assertEquals(SuggestedWordInfo.KIND_CORRECTION, words.getInfo(5).mKind);
55 final SuggestedWords wordsWithoutTyped = words.getSuggestedWordsExcludingTypedWord();
56 assertEquals(words.size() - 1, wordsWithoutTyped.size())
    [all...]
  /external/valgrind/main/memcheck/tests/
wrap6.c 182 UInt* words = calloc(200, sizeof(UInt)); local
183 TRASH_IREGS(r, words);
184 free(words);
208 UInt* words = calloc(200, sizeof(UInt)); local
209 words[1-1] = a1;
210 TRASH_IREGS(r, words);
211 free(words);
235 UInt* words = calloc(200, sizeof(UInt)); local
236 words[1-1] = a1;
237 words[2-1] = a2
263 UInt* words = calloc(200, sizeof(UInt)); local
292 UInt* words = calloc(200, sizeof(UInt)); local
322 UInt* words = calloc(200, sizeof(UInt)); local
353 UInt* words = calloc(200, sizeof(UInt)); local
386 UInt* words = calloc(200, sizeof(UInt)); local
422 UInt* words = calloc(200, sizeof(UInt)); local
459 UInt* words = calloc(200, sizeof(UInt)); local
497 UInt* words = calloc(200, sizeof(UInt)); local
536 UInt* words = calloc(200, sizeof(UInt)); local
576 UInt* words = calloc(200, sizeof(UInt)); local
    [all...]
  /external/webkit/Tools/android/flex-2.5.4a/MISC/fastwc/
wc4.l 6 words {word}{ws}+
13 {words}{word}{ws}* wc += 2; cc += yyleng;
14 {words}{word}{ws}*\n wc += 2; cc += yyleng; ++lc;
15 {words}{2}{word}{ws}* wc += 3; cc += yyleng;
16 {words}{2}{word}{ws}*\n wc += 3; cc += yyleng; ++lc;
17 {words}{3}{word}{ws}* wc += 4; cc += yyleng;
18 {words}{3}{word}{ws}*\n wc += 4; cc += yyleng; ++lc;
wc3.l 6 words {word}{ws}+
13 {words}{word}{ws}* cc += yyleng; wc += 2;
14 {words}{2}{word}{ws}* cc += yyleng; wc += 3;
15 {words}{3}{word}{ws}* cc += yyleng; wc += 4;
wc5.l 6 words {word}{ws}+
13 {words}{word} cc += yyleng; wc += 2; /* oops */
14 {words}{2}{word}{ws}* cc += yyleng; wc += 3;
15 {words}{3}{word}{ws}* cc += yyleng; wc += 4;
  /external/dropbear/libtomcrypt/src/pk/asn1/der/object_identifier/
der_length_object_identifier.c 35 @param nwords The number of OID words
36 @param words The actual OID words to get the size of
40 int der_length_object_identifier(unsigned long *words, unsigned long nwords, unsigned long *outlen)
44 LTC_ARGCHK(words != NULL);
48 /* must be >= 2 words */
54 if (words[0] > 3 || (words[0] < 2 && words[1] > 39)) {
60 wordbuf = words[0] * 40 + words[1]
    [all...]
der_decode_object_identifier.c 20 Decode OID data and store the array of integers in words
23 @param words [out] The destination of the OID words
24 @param outlen [in/out] The number of OID words
28 unsigned long *words, unsigned long *outlen)
33 LTC_ARGCHK(words != NULL);
41 /* must be room for at least two words */
70 /* decode words */
81 words[0] = t / 40;
82 words[1] = t % 40
    [all...]
der_encode_object_identifier.c 21 @param words The words to encode (upto 32-bits each)
22 @param nwords The number of words in the OID
27 int der_encode_object_identifier(unsigned long *words, unsigned long nwords,
33 LTC_ARGCHK(words != NULL);
38 if ((err = der_length_object_identifier(words, nwords, &x)) != CRYPT_OK) {
48 wordbuf = words[0] * 40 + words[1];
53 wordbuf = words[y + 1];
74 wordbuf = words[0] * 40 + words[1];
    [all...]
  /external/markdown/tests/misc/
br.txt 3 <p>Some of these words <em>are emphasized</em>.
4 Some of these words <em>are emphasized also</em>.</p>
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/compat/
UserDictionaryCompatUtils.java 20 import android.provider.UserDictionary.Words;
26 // UserDictionary.Words#addWord(Context, String, int, String, Locale) was introduced
28 private static final Method METHOD_addWord = CompatUtils.getMethod(Words.class, "addWord",
35 CompatUtils.invoke(Words.class, null, METHOD_addWord, context, word, freq, shortcut,
41 localeType = Words.LOCALE_TYPE_ALL;
45 localeType = Words.LOCALE_TYPE_CURRENT;
47 localeType = Words.LOCALE_TYPE_ALL;
50 Words.addWord(context, word, freq, localeType);
  /cts/tests/tests/provider/src/android/provider/cts/
UserDictionary_WordsTest.java 35 UserDictionary.Words._ID,
36 UserDictionary.Words.WORD,
37 UserDictionary.Words.FREQUENCY,
38 UserDictionary.Words.LOCALE };
66 UserDictionary.Words.addWord(getContext(), word, frequency,
67 UserDictionary.Words.LOCALE_TYPE_ALL);
69 Cursor cursor = mContentResolver.query(UserDictionary.Words.CONTENT_URI, WORDS_PROJECTION,
70 UserDictionary.Words.WORD + "='" + word + "'", null, null);
72 mAddedBackup.add(Uri.withAppendedPath(UserDictionary.Words.CONTENT_URI,
91 UserDictionary.Words.addWord(mContext, word, frequency, shortcut, locale)
    [all...]
  /external/valgrind/main/none/tests/x86/
cpuid.stdout.exp 1 cpuid words (0): 0x........ 0x........ 0x........ 0x........
2 cpuid words (1): 0x........ 0x........ 0x........ 0x........
cpuid_c.c 13 printf("cpuid words (0): 0x%x 0x%x 0x%x 0x%x\n",
17 printf("cpuid words (1): 0x%x 0x%x 0x%x 0x%x\n",
  /external/chromium/chrome/browser/history/
query_parser.h 36 // the number of words in this node.
47 // Returns true if this node matches at least one of the words in words. If
50 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
53 // Appends the words that make up this node in |words|.
54 virtual void AppendWords(std::vector<string16>* words) const = 0;
72 // sqlite_query and the number of words is returned.
76 // Parses the query words in query, returning the nodes that constitute the
77 // valid words in the query. This is intended for later usage wit
    [all...]
query_parser.cc 79 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
83 virtual void AppendWords(std::vector<string16>* words) const;
90 bool QueryNodeWord::HasMatchIn(const std::vector<QueryWord>& words,
92 for (size_t i = 0; i < words.size(); ++i) {
93 if (Matches(words[i].word, false)) {
94 size_t match_start = words[i].position;
111 void QueryNodeWord::AppendWords(std::vector<string16>* words) const {
112 words->push_back(word_);
148 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
153 virtual void AppendWords(std::vector<string16>* words) const
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/
FixedLogBuffer.java 26 * actual words; the other LogUnits do not count toward the word limit. Once the buffer reaches
36 // The number of members of mLogUnits that are actual words.
40 * Create a new LogBuffer that can hold a fixed number of LogUnits that are words (and
43 * @param wordCapacity maximum number of words
125 * @param numWords the minimum number of words in {@link LogUnit}s to shift out
126 * @return the number of actual words LogUnit}s shifted out
147 * Returns a list of {@link LogUnit}s at the front of the buffer that have words associated with
150 * There will be no more than {@code n} words in the returned list. So if 2 words are
151 * requested, and the first LogUnit has 3 words, it is not returned. If 2 words are requested
    [all...]
MainLogBuffer.java 33 * There are three forms of privacy protection: 1) only words in the main dictionary are allowed to
34 * be logged in enough detail to determine their contents, 2) only a subset of words are logged
38 * words, they are added here. But if the user backs up over their current word to edit a word
40 * the LogUnit, and it is pushed back in here when the user is done. Because words may be pulled
46 * up), the LogBuffer is considered "complete" when the user has entered enough words to form an
47 * n-gram, followed by enough additional non-detailed words (that are in the 90%, as per above).
49 * However, the additional non-detailed words are retained, in case the user backspaces to edit
50 * them. The MainLogBuffer then continues to add words, publishing individual non-detailed words
51 * as new words arrive. After enough non-detailed words have been pushed out to account for th
162 final String[] words = logUnit.getWordsAsStringArray(); local
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/userdictionary/
UserDictionarySettings.java 55 { UserDictionary.Words._ID, UserDictionary.Words.WORD};
57 { UserDictionary.Words._ID, UserDictionary.Words.WORD, UserDictionary.Words.SHORTCUT};
66 UserDictionary.Words.WORD,
70 UserDictionary.Words.WORD, UserDictionary.Words.SHORTCUT
90 UserDictionary.Words.LOCALE + "=?";
92 UserDictionary.Words.LOCALE + " is null"
    [all...]
  /external/valgrind/main/helgrind/
hg_wordset.c 3 /*--- Sets of words, with unique set identifiers. ---*/
137 UWord* words; member in struct:__anon17069
192 wv->words = NULL;
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) );
203 if (wv->words) {
204 dealloc(wv->words);
228 if (wv1->words[i] == wv2->words[i])
230 if (wv1->words[i] < wv2->words[i]
    [all...]

Completed in 882 milliseconds

1 2 3 4 5 6 7 8 91011>>