Searched refs:words (Results 1 - 25 of 136) sorted by path

123456

/external/aac/libFDK/src/
H A DFDK_crc.cpp431 int words = bits >> 3; /* processing bytes */ local
435 rBits -= (calcCrc_Bytes(&crc, hCrcInfo->pCrcLookup, &bsReader, words)<<3);
438 rBits -= calcCrc_Bits(&crc, hCrcInfo->crcMask, hCrcInfo->crcPoly, &bsReader, words<<3 );
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/
H A DJUnitCodeGen.java343 List<String> words = new ArrayList<String>();
349 words.add(word.toString());
352 words.add(String.valueOf(t.charAt(i)));
359 words.add(word.toString());
383 words.add(word.toString());
391 words.add(word.toString());
393 //System.out.println("words="+words);
395 for (int j=0; j<words.size(); j++) {
396 if ( j>0 && !words
[all...]
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DBaseRecognizer.as458 * V is the set of terminals and nonterminals. In other words,
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.pas2101 /// V is the set of terminals and nonterminals. In other words,
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
H A DCodeGenerator.java586 long[] words = null;
588 words = new long[1];
593 words = bits.toPackedArray();
597 String[] wordStrings = new String[words.length];
598 for (int j = 0; j < words.length; j++) {
599 long w = words[j];
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
H A DSHA1ImplTest.java66 int[] words = new int[INDEX +6]; // working array to compute hash
72 for (int i = 0; i < words.length; i++ ) {
73 words[i] = 0;
75 words[0] = 0x61626380; // constants from Secure Hash Standard
76 words[15] = 0x00000018;
78 alternateHash(words, hash1);
102 * if data supplied takes exactly fourteen words of sixteen word buffer.
/external/bison/lib/
H A Dabitset.c29 of words. Any unused bits in the last word must be zero. */
32 #define ABITSET_WORDS(X) ((X)->a.words)
789 size_t header_size = offsetof (union bitset_union, a.words);
H A Dbitset.h56 bitset_word words[1]; /* The array of bits. */ member in struct:bitset_union::abitset_struct
H A Debitset.c49 /* Number of words to use for each element. */
61 bitset_word words[EBITSET_ELT_WORDS]; /* Bits that are set. */ member in union:ebitset_elt_struct::__anon316
95 #define EBITSET_WORDS(ELT) ((ELT)->u.words)
H A Dlbitset.c40 /* Number of words to use for each element. The larger the value the
65 bitset_word words[LBITSET_ELT_WORDS]; /* Bits that are set. */ member in struct:lbitset_elt_struct
83 ((lbitset_elt *) (void *) ((char *) (X) - offsetof (lbitset_elt, words)))
150 memset (elt->words, 0, sizeof (elt->words));
188 bset->b.cdata = next->words;
193 bset->b.cdata = prev->words;
220 bset->b.cdata = elt->prev->words;
247 if (elt->words[i])
313 bset->b.cdata = elt->words;
[all...]
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/
H A Dmux.py244 words = request_line.split(' ')
245 if len(words) != 3:
247 [command, path, version] = words
/external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/
H A Dmux_client_for_testing.py79 words = status_line.split(' ')
80 if len(words) < 3:
82 [version, response_code] = words[:2]
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_utils.cc179 // Returns true if |text| contains each string in |words|. This is used when
182 const std::vector<string16>& words) {
183 for (size_t i = 0; i < words.size(); ++i) {
184 if (text.find(words[i]) == string16::npos)
190 // Returns true if |node|s title or url contains the strings in |words|.
193 const std::vector<string16>& words,
197 l10n_util::ToLower(node->GetTitle()), words) ||
199 l10n_util::ToLower(UTF8ToUTF16(node->GetURL().spec())), words) ||
202 UnescapeRule::NORMAL, NULL, NULL, NULL)), words);
520 std::vector<string16> words; local
181 DoesBookmarkTextContainWords(const string16& text, const std::vector<string16>& words) argument
192 DoesBookmarkContainWords(const BookmarkNode* node, const std::vector<string16>& words, const std::string& languages) argument
522 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local
540 std::vector<string16> words; local
542 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local
[all...]
/external/chromium/chrome/browser/history/
H A Din_memory_url_index.cc181 // Split URL into individual, unique words then add in the title words.
185 String16Set words; local
188 std::insert_iterator<String16Set>(words, words.begin()));
189 for (String16Set::iterator word_iter = words.begin();
190 word_iter != words.end(); ++word_iter)
405 // Break the terms down into individual terms (words), get the candidate
409 // is four words: 'http', 'www', 'somewebsite', and 'com'.
411 String16Set words local
475 String16Vector words = WordVectorFromString16(uni_string, false); local
489 String16Vector words; local
[all...]
H A Dquery_parser.cc79 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, argument
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, argument
153 virtual void AppendWords(std::vector<string16>* words) cons
218 HasMatchIn( const std::vector<QueryWord>& words, Snippet::MatchPositions* match_positions) const argument
284 ExtractQueryWords(const string16& query, std::vector<string16>* words) argument
366 ExtractQueryWords(const string16& text, std::vector<QueryWord>* words) argument
[all...]
H A Dquery_parser.h36 // 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 i
[all...]
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-php/lib/lightopenid/
H A Dopenid.php547 * In other words. OP may provide whatever information it wants to.
/external/chromium/chrome/common/extensions/docs/examples/extensions/fx/
H A Dbg.js23 // Map of query parameter words to sounds.
289 var words = q.split(" ");
290 for (j in words) {
291 if (searchSounds[words[j]]) {
292 console.log("searchSound: " + words[j]);
293 playNavSound(words[j]);
/external/chromium/testing/gmock/scripts/
H A Dupload.py755 words = line.split()
756 if len(words) == 2 and words[0] == "URL:":
757 url = words[1]
/external/chromium/testing/gtest/scripts/
H A Dupload.py755 words = line.split()
756 if len(words) == 2 and words[0] == "URL:":
757 url = words[1]
/external/chromium/third_party/libjingle/source/talk/examples/call/
H A Dcallclient.cc84 std::string GetWord(const std::vector<std::string>& words, argument
86 if (words.size() > index) {
87 return words[index];
93 int GetInt(const std::vector<std::string>& words, size_t index, int def) { argument
95 if (words.size() > index && talk_base::FromString(words[index], &val)) {
141 std::vector<std::string> words; local
155 words.push_back(word);
163 const std::string& command = GetWord(words, 0, "");
169 options.video_bandwidth = GetInt(words,
[all...]
/external/compiler-rt/
H A DMakefile156 $(if $(call streq,1,$(words $(Tmp.ArchsToBuild))), \
/external/compiler-rt/make/
H A Dlib_util.mk20 $(if $(call streq,1,$(words $(Tmp.SelectFunctionDir))),\
23 $(if $(call streq,0,$(words $(Tmp.SelectFunctionDir))),\
/external/dbus/dbus/
H A Ddbus-shell.c310 * removal. Field splitting may increase the number of words.
311 * Quote removal does not increase the number of words.
583 * remove any zero-length words that didn't contain quotes
584 * originally; but since there's no expansion we know all words have

Completed in 701 milliseconds

123456