| /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...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/tests/ |
| 039-func-arg-obj-macro-with-comma.c | 2 #define bar two,words
|
| /external/mesa3d/src/glsl/glcpp/tests/ |
| 039-func-arg-obj-macro-with-comma.c | 2 #define bar two,words
|
| /external/e2fsprogs/ |
| wordwrap.pl | 12 @words = split;
13 while (defined($word = shift @words)) {
|
| /external/llvm/utils/emacs/ |
| llvm-mode.el | 21 `(,(regexp-opt '("void" "i[0-9]+" "float" "double" "type" "label" "opaque") 'words) . font-lock-type-face)
33 "pointersize" "volatile" "fastcc" "coldcc" "cc") 'words) . font-lock-keyword-face)
36 "setne" "seteq" "setlt" "setgt" "setle" "setge") 'words) . font-lock-keyword-face)
38 `(,(regexp-opt '("fadd" "fsub" "fmul" "fdiv" "frem") 'words) . font-lock-keyword-face)
40 `(,(regexp-opt '("phi" "tail" "call" "select" "to" "shl" "lshr" "ashr" "fcmp" "icmp" "va_arg" "landingpad") 'words) . font-lock-keyword-face)
42 `(,(regexp-opt '("ret" "br" "switch" "invoke" "resume" "unwind" "unreachable" "indirectbr") 'words) . font-lock-keyword-face)
44 `(,(regexp-opt '("malloc" "alloca" "free" "load" "store" "getelementptr" "fence" "cmpxchg" "atomicrmw") 'words) . font-lock-keyword-face)
46 `(,(regexp-opt '("bitcast" "inttoptr" "ptrtoint" "trunc" "zext" "sext" "fptrunc" "fpext" "fptoui" "fptosi" "uitofp" "sitofp" "addrspacecast") 'words) . font-lock-keyword-face)
48 `(,(regexp-opt '("extractelement" "insertelement" "shufflevector") 'words) . font-lock-keyword-face)
50 `(,(regexp-opt '("extractvalue" "insertvalue") 'words) . font-lock-keyword-face
[all...] |
| /external/chromium_org/content/common/android/ |
| address_parser.cc | 13 // Minimum number of words in an address after the house number
18 // Maximum number of words allowed in an address between the house number
30 // Maximum number of words after the house number in which the location name
68 // detected. Start tokenizing the following words to find a valid
83 WordList words; local
84 words.push_back(house_number);
97 if (next_word == words.size()) {
112 words.push_back(Word(tokenizer.token_begin(), tokenizer.token_end()));
117 const Word& current_word = words[next_word];
148 // Look for location names in the words after the house number
[all...] |
| /external/chromium_org/components/query_parser/ |
| query_parser.h | 37 // the number of words in this node.
47 // Returns true if this node matches at least one of the words in |words|. An
48 // entry is added to |match_positions| for all matching words giving the
50 virtual bool HasMatchIn(const QueryWordVector& words,
53 // Returns true if this node matches at least one of the words in |words|.
54 virtual bool HasMatchIn(const QueryWordVector& words) const = 0;
56 // Appends the words that make up this node in |words|
[all...] |
| query_parser.cc | 81 const QueryWordVector& words,
84 const QueryWordVector& words) const OVERRIDE;
85 virtual void AppendWords(std::vector<base::string16>* words) const OVERRIDE;
120 bool QueryNodeWord::HasMatchIn(const QueryWordVector& words,
123 for (size_t i = 0; i < words.size(); ++i) {
124 if (Matches(words[i].word, false)) {
125 size_t match_start = words[i].position;
135 bool QueryNodeWord::HasMatchIn(const QueryWordVector& words) const {
136 for (size_t i = 0; i < words.size(); ++i) {
137 if (Matches(words[i].word, false)
[all...] |
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| two_client_dictionary_sync_test.cc | 32 std::vector<std::string> words; local
33 words.push_back("foo");
34 words.push_back("bar");
35 ASSERT_EQ(num_clients(), static_cast<int>(words.size()));
38 ASSERT_TRUE(dictionary_helper::AddWord(i, words[i]));
41 ASSERT_EQ(words.size(), dictionary_helper::GetDictionarySize(0));
44 ASSERT_TRUE(dictionary_helper::RemoveWord(i, words[i]));
51 ASSERT_TRUE(dictionary_helper::AddWord(i, words[i]));
53 ASSERT_EQ(words.size(), dictionary_helper::GetDictionarySize(0));
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
| templite.py | 62 # Action tag: split into words and parse further.
63 words = tok[2:-2].strip().split()
64 if words[0] == 'if':
67 assert len(words) == 2
68 ops.append(('if', (words[1], if_ops)))
71 elif words[0] == 'for':
73 assert len(words) == 4 and words[2] == 'in'
75 ops.append(('for', (words[1], words[3], for_ops))
[all...] |
| /external/chromium_org/third_party/webrtc/build/ |
| version.py | 42 words = line.split()
43 for index, word in enumerate(words):
45 return words[index+1]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_bitmask.c | 53 util_bitmask_word *words; member in struct:util_bitmask
72 bm->words = (util_bitmask_word *)CALLOC(UTIL_BITMASK_INITIAL_WORDS, sizeof(util_bitmask_word));
73 if(!bm->words) {
114 new_words = (util_bitmask_word *)REALLOC((void *)bm->words,
125 bm->words = new_words;
174 if(!(bm->words[word] & mask))
190 assert(!(bm->words[word] & mask));
191 bm->words[word] |= mask;
215 bm->words[word] |= mask;
240 bm->words[word] &= ~mask
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_bitmask.c | 53 util_bitmask_word *words; member in struct:util_bitmask
72 bm->words = (util_bitmask_word *)CALLOC(UTIL_BITMASK_INITIAL_WORDS, sizeof(util_bitmask_word));
73 if(!bm->words) {
114 new_words = (util_bitmask_word *)REALLOC((void *)bm->words,
125 bm->words = new_words;
174 if(!(bm->words[word] & mask))
190 assert(!(bm->words[word] & mask));
191 bm->words[word] |= mask;
215 bm->words[word] |= mask;
240 bm->words[word] &= ~mask
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| List4.java | 118 public SpeechView(Context context, String title, String words) {
132 mDialogue.setText(words);
147 public void setDialogue(String words) {
148 mDialogue.setText(words);
|
| /external/chromium_org/chrome/renderer/spellchecker/ |
| custom_dictionary_engine.h | 14 // Custom spellcheck dictionary. Words in this dictionary are always correctly
15 // spelled. Words that are not in this dictionary may or may not be correctly
23 void Init(const std::set<std::string>& words);
32 // Update custom dictionary words.
38 // Correctly spelled words.
|
| /external/chromium_org/chrome/tools/convert_dict/ |
| dic_reader.h | 37 // Returns the words read by Read(). These will be in order.
38 const WordList& words() const { return words_; } function in class:convert_dict::DicReader
44 // Contains all words and their corresponding affix index.
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/common/ |
| TextUtils.js | 110 var words = [];
115 words.push(text.substring(startWord, i));
121 words.push(text.substring(startWord));
122 return words;
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_nan.c | 51 _scan_nan(uint32_t *words, int num_words, const char *s)
54 int bitpos; /* index into words (in bits) */
56 bzero(words, num_words * sizeof(uint32_t));
66 /* Scan backwards, filling in the bits in words[] as we go. */
74 words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
|
| /build/tools/ |
| diff_package_overlays.py | 55 words = line.split()
56 result[words[0]] = " ".join(words[1:])
|
| product_debug.py | 28 words = line.split("=", 1)
29 if len(words) == 1:
30 return (words[0], "")
32 return (words[0], words[1])
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
| CompletionDictionary.js | 107 var words = [];
110 words.push(i);
112 return words;
|
| /bionic/libc/upstream-openbsd/lib/libc/net/ |
| inet_ntop.c | 106 u_int words[IN6ADDRSZ / INT16SZ]; local
115 memset(words, '\0', sizeof words);
117 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
121 if (words[i] == 0) {
169 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
175 advance = snprintf(tp, ep - tp, "%x", words[i]);
|
| /external/chromium_org/third_party/icu/source/common/ |
| dictbe.cpp | 97 // List size, limited by the maximum number of words in the dictionary
191 // How many words in a row are "good enough"?
210 // Minimum number of characters for two words
248 return 0; // Not enough characters for two words
255 PossibleWord words[THAI_LOOKAHEAD]; local
263 // Look for candidate words at the current position
264 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
268 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
271 // If there was more than one, see which one can take us forward the most words
279 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
483 PossibleWord words[LAO_LOOKAHEAD]; local
684 PossibleWord words[KHMER_LOOKAHEAD]; local
[all...] |
| /external/icu/icu4c/source/common/ |
| dictbe.cpp | 100 // List size, limited by the maximum number of words in the dictionary
194 // How many words in a row are "good enough"?
213 // Minimum number of characters for two words
251 return 0; // Not enough characters for two words
258 PossibleWord words[THAI_LOOKAHEAD]; local
266 // Look for candidate words at the current position
267 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd);
271 wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text);
274 // If there was more than one, see which one can take us forward the most words
282 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
486 PossibleWord words[LAO_LOOKAHEAD]; local
687 PossibleWord words[KHMER_LOOKAHEAD]; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AXInlineTextBox.cpp | 105 void AXInlineTextBox::wordBoundaries(Vector<PlainTextRange>& words) const
112 words.resize(wordBoundaries.size());
114 words[i] = PlainTextRange(wordBoundaries[i].startIndex, wordBoundaries[i].endIndex - wordBoundaries[i].startIndex);
|
