HomeSort by relevance Sort by last modified time
    Searched refs:words (Results 51 - 75 of 529) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/flac/libFLAC/
bitreader.c 81 * This should be at least twice as large as the largest number of words
94 static const unsigned FLAC__BITREADER_DEFAULT_CAPACITY = 65536u / FLAC__BITS_PER_WORD; /* in words */
140 unsigned capacity; /* in words */
141 unsigned words; /* # of completed words in buffer */ member in struct:FLAC__BitReader
142 unsigned bytes; /* # of bytes in incomplete word at buffer[words] */
143 unsigned consumed_words; /* #words ... */
217 end = br->words + (br->bytes? 1:0);
220 br->words -= start;
227 bytes = (br->capacity - br->words) * FLAC__BYTES_PER_WORD - br->bytes
    [all...]
bitwriter.c 79 static const unsigned FLAC__BITWRITER_DEFAULT_CAPACITY = 32768u / sizeof(bwword); /* size in words */
81 static const unsigned FLAC__BITWRITER_DEFAULT_INCREMENT = 4096u / sizeof(bwword); /* size in words */
83 #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD)
84 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
105 unsigned capacity; /* capacity of buffer in words */
106 unsigned words; /* # of complete words in buffer */ member in struct:FLAC__BitWriter
128 /* calculate total words needed to store 'bits_to_add' additional bits */
129 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD)
    [all...]
  /external/bison/lib/
lbitset.c 41 /* Number of words to use for each element. The larger the value the
66 bitset_word words[LBITSET_ELT_WORDS]; /* Bits that are set. */ member in struct:lbitset_elt_struct
84 ((lbitset_elt *) (void *) ((char *) (X) - offsetof (lbitset_elt, words)))
151 memset (elt->words, 0, sizeof (elt->words));
189 bset->b.cdata = next->words;
194 bset->b.cdata = prev->words;
221 bset->b.cdata = elt->prev->words;
248 if (elt->words[i])
314 bset->b.cdata = elt->words;
    [all...]
  /build/core/
device.mk 62 $(if $(filter 1,$(words $(d))), \
64 $(if $(filter 0,$(words $(d))), \
dex_preopt_libdvm.mk 65 $(if $(filter 1,$(words $(1)))$(filter 0,$(words $(1))),,\
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
AbstractDictDecoder.java 44 public void readUnigramsAndBigramsBinary(final TreeMap<Integer, String> words,
51 BinaryDictIOUtils.readUnigramsAndBigramsBinary(this, words, frequencies, bigrams);
  /external/chromium_org/chrome/renderer/safe_browsing/
phishing_term_feature_extractor_unittest.cc 56 base::hash_set<std::string> words; local
57 words.insert("one");
58 words.insert("two");
59 words.insert("multi");
60 words.insert("word");
61 words.insert("test");
62 words.insert("capitalization");
63 words.insert("space");
64 words.insert("separator");
65 words.insert("punctuation")
    [all...]
  /external/chromium_org/tools/deep_memory_profiler/subcommands/
expand.py 96 words = line.split()
97 bucket = bucket_set.get(int(words[BUCKET_ID]))
106 precedence += '(alloc=%d) ' % int(words[ALLOC_COUNT])
107 precedence += '(free=%d) ' % int(words[FREE_COUNT])
112 int(words[COMMITTED]), sizes)
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
BinaryDictionaryTests.java 409 final ArrayList<String> words = new ArrayList<>(); local
417 words.add(word);
424 final String word0 = words.get(random.nextInt(wordCount));
425 final String word1 = words.get(random.nextInt(wordCount));
632 final ArrayList<String> words = new ArrayList<>(); local
640 words.add(word);
647 final String word0 = words.get(random.nextInt(wordCount));
648 final String word1 = words.get(random.nextInt(wordCount));
709 final ArrayList<String> words = new ArrayList<>(); local
818 final ArrayList<String> words = new ArrayList<>(); local
869 final ArrayList<String> words = new ArrayList<>(); local
1002 final ArrayList<String> words = new ArrayList<>(); local
1105 final ArrayList<String> words = new ArrayList<>(); local
1254 final ArrayList<String> words = new ArrayList<>(); local
1395 final ArrayList<String> words = new ArrayList<>(); local
    [all...]
  /external/chromium_org/chrome/browser/autocomplete/
shortcuts_provider.cc 271 // First, convert |text| to a vector of the unique words in it.
277 std::vector<base::string16> words;
280 words.push_back(word_iter.GetString());
282 if (words.empty())
284 std::sort(words.begin(), words.end());
285 words.erase(std::unique(words.begin(), words.end()), words.end())
    [all...]
  /external/chromium_org/chrome/browser/ui/webui/options/
edit_dictionary_browsertest.js 38 // Verify that users can add and remove words in the dictionary.
58 // Verify that users can search words in the dictionary.
91 // Verify that dictionary shows newly added words that arrived in a
108 // Backend notifies UI that the words 'bar' and 'baz' were added. UI shows
109 // these new words.
114 // Verify that dictionary hides newly removed words that arrived in a
117 // Begin with a dictionary with words 'foo', 'bar', 'baz', and 'baz'. The
132 // Backend notifies UI that words 'foo' and 'bar' have been removed. UI
133 // removes these words.
language_dictionary_overlay_handler.cc 95 const chrome::spellcheck_common::WordSet& words = dictionary_->GetWords(); local
96 for (chrome::spellcheck_common::WordSet::const_iterator it = words.begin();
97 it != words.end(); ++it) {
  /external/chromium_org/chrome/browser/history/
in_memory_url_index_types.cc 96 String16Vector words = local
99 for (String16Vector::const_iterator iter = words.begin(); iter != words.end();
114 String16Vector words; local
116 return words;
129 words.push_back(word);
137 return words;
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/personalization/
UserHistoryDictionaryTests.java 113 private static void addToDict(final UserHistoryDictionary dict, final List<String> words) {
115 for (String word : words) {
124 * @param checkContents if true, checks whether written words are actually in the dictionary
129 final List<String> words = generateWords(numberOfWords, random); local
132 // Add random words to the user history dictionary.
133 addToDict(dict, words);
137 final String word = words.get(i);
262 final List<String> words = generateWords(numberOfWords, random); local
267 for (final String word : words) {
277 for (final String word : words) {
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/
filelist.py 79 words = line.split()
80 action = words[0]
86 if len(words) < 2:
90 patterns = map(convert_path, words[1:])
93 if len(words) < 3:
97 dir = convert_path(words[1])
98 patterns = map(convert_path, words[2:])
101 if len(words) != 2:
105 dir_pattern = convert_path(words[1])
113 # Parse the line: split it up, make sure the right number of words
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/
filelist.py 79 words = line.split()
80 action = words[0]
86 if len(words) < 2:
90 patterns = map(convert_path, words[1:])
93 if len(words) < 3:
97 dir = convert_path(words[1])
98 patterns = map(convert_path, words[2:])
101 if len(words) != 2:
105 dir_pattern = convert_path(words[1])
113 # Parse the line: split it up, make sure the right number of words
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
clike.js 167 function words(str) {
168 var obj = {}, words = str.split(" ");
169 for (var i = 0; i < words.length; ++i) obj[words[i]] = true;
212 keywords: words(cKeywords),
213 blockKeywords: words("case do else for if switch while struct"),
214 atoms: words("null"),
219 keywords: words(cKeywords + " asm dynamic_cast namespace reinterpret_cast try bool explicit new " +
223 blockKeywords: words("catch class do else finally for if struct switch try while"),
224 atoms: words("true false null")
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
dtoa.cpp 150 uint32_t* words() function in struct:WTF::BigInt
155 const uint32_t* words() const function in struct:WTF::BigInt
177 uint32_t* x = b.words();
272 b.words()[0] = i;
306 for (xc = c.words(), xa = xc + wc; xc < xa; xc++)
308 xa = a->words();
310 xb = b->words();
312 xc0 = c.words();
358 for (xc0 = c.words(), xc = xc0 + wc; wc > 0 && !*--xc; --wc) { }
437 const uint32_t* srcStart = b.words();
    [all...]
  /external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
sctp_sha1.h 74 unsigned int words[80];
  /external/libedit/doc/
mdoc2man.awk 46 retval=retval words[++w]
73 nwords=split($0,words)
76 if(match(words[w],"^Li|Pf$")) {
78 } else if(match(words[w],"^Xo$")) {
83 } else if(match(words[w],"^Xc$")) {
89 } else if(match(words[w],"^Bd$")) {
91 if(match(words[w+1],"-literal")) {
96 } else if(match(words[w],"^Po$")) {
101 } else if(match(words[w],"^Pc$")) {
106 } else if(match(words[w],"^Ed$"))
    [all...]
  /ndk/
GNUmakefile 31 ifneq ($(words $(NDK_ROOT)),1)
  /external/chromium_org/third_party/libjingle/source/talk/examples/call/
callclient.cc 86 std::string GetWord(const std::vector<std::string>& words,
88 if (words.size() > index) {
89 return words[index];
95 int GetInt(const std::vector<std::string>& words, size_t index, int def) {
97 if (words.size() > index && talk_base::FromString(words[index], &val)) {
169 std::vector<std::string> words; local
183 words.push_back(word);
191 const std::string& command = GetWord(words, 0, "");
197 options.video_bandwidth = GetInt(words, 1, cricket::kAutoBandwidth)
    [all...]
  /external/chromium_org/content/common/android/
address_parser_internal.cc 249 bool FindStateStartingInWord(WordList* words,
345 const Word& first_word = words->at(state_first_word);
384 if (!WordLowerCaseEqualsASCII(words->at(state_word).begin,
385 words->at(state_word).end, &state_names[state].string[pos]))
388 pos += words->at(state_word).end - words->at(state_word).begin + 1;
394 // Ran out of words, extract more from the tokenizer.
395 if (++state_word == words->size()) {
400 words->push_back(
  /external/chromium_org/third_party/skia/include/core/
SkChecksum.h 52 const size_t words = bytes/4; local
55 for (size_t i = 0; i < words; i++) {
  /external/llvm/utils/emacs/
tablegen-mode.el 17 'words))
19 'words))

Completed in 672 milliseconds

1 23 4 5 6 7 8 91011>>