Searched defs:keywords (Results 1 - 25 of 33) sorted by relevance

12

/external/protobuf/editors/
H A Dprotobuf-mode.el105 ;; The following keywords do not fit well in keyword classes defined by
123 ;; Remove syntax for "do" and "else" keywords.
127 ;; Remove syntax for "for", "if", "switch" and "while" keywords.
131 ;; Remove syntax for "break", "continue", "goto" and "return" keywords.
139 ;; Remove case label syntax for the "case" and "default" keywords.
158 (defconst protobuf-font-lock-keywords-1 (c-lang-const c-matchers-1 protobuf)
161 (defconst protobuf-font-lock-keywords-2 (c-lang-const c-matchers-2 protobuf)
164 (defconst protobuf-font-lock-keywords-3 (c-lang-const c-matchers-3 protobuf)
167 (defvar protobuf-font-lock-keywords protobuf-font-lock-keywords
[all...]
/external/v8/test/mjsunit/
H A Dkeywords-and-reserved_words.js28 // Test proper handling of keywords, future reserved words and
33 // http://trac.webkit.org/export/89109/trunk/LayoutTests/fast/js/script-tests/keywords-and-reserved_words.js
60 // All non-strict keywords are also keywords in strict code.
107 // Not keywords - these are all just identifiers.
127 var keywords = [ variable
144 for (var i = 0; i < keywords.length; i++) {
145 testKeyword(keywords[i]);
H A Dobject-literal.js108 // Test keywords are valid as property names in initializers and dot-access.
109 var keywords = [ variable
190 for (var i = 0; i < keywords.length; i++) {
191 testKeywordProperty(keywords[i]);
/external/llvm/utils/lit/
H A Dsetup.py15 keywords = 'test C++ automatic discovery', variable
/external/llvm/utils/emacs/
H A Dllvm-mode.el9 (defvar llvm-font-lock-keywords
120 font-lock-defaults `(llvm-font-lock-keywords))
H A Dtablegen-mode.el14 (defvar tablegen-font-lock-keywords
39 ;; Type keywords
43 (put 'tablegen-mode 'font-lock-defaults '(tablegen-font-lock-keywords))
108 font-lock-defaults `(tablegen-font-lock-keywords)
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/
H A DKeywordsBox.java27 * List of keywords according to 3GPP 26.244.
33 private String[] keywords; field in class:KeywordsBox
44 return keywords;
51 public void setKeywords(String[] keywords) { argument
52 this.keywords = keywords;
57 for (String keyword : keywords) {
68 keywords = new String[keywordCount];
71 keywords[i] = IsoTypeReader.readString(content);
79 IsoTypeWriter.writeUInt8(byteBuffer, keywords
[all...]
/external/icu4c/test/intltest/
H A Dselfmts.cpp115 // ICU 4.8 does not check for duplicate keywords any more.
168 logln("SelectFormat Unit test: Testing format() with keyword method and with invalid keywords...");
171 UnicodeString keywords[] = { local
186 for (int32_t i = 0; i < LENGTHOF(keywords); i++ ){
188 selFmt->format( keywords[i], result , ignore , status);
191 keywords[i]+" ("+u_errorName(status)+")");
H A Dplurults.cpp392 StringEnumeration *keywords = rules->getKeywords(status); local
398 while (NULL != (keyword = keywords->snext(status))) {
422 errln("keywords don't match");
427 delete keywords;
H A Dloctest.cpp1621 StringEnumeration *keywords; local
1630 keywords = l.createKeywords(status);
1637 if(keywords) {
1638 if((keyCount = keywords->count(status)) != testCases[i].numKeywords) {
1639 err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1644 if((keyword = keywords->next(&keywordLen, status)) == NULL) {
1651 if((keywordString = keywords->snext(status)) == NULL) {
1661 // replace keywords with a clone of itself
1662 StringEnumeration *k2 = keywords->clone();
1666 delete keywords;
[all...]
/external/icu4c/i18n/
H A Ddcfmtsym.cpp356 const char* keywords[UNUM_CURRENCY_SPACING_COUNT] = { local
365 currencySpcBeforeSym[i] = ures_getStringByKey(dataRes, keywords[i],
375 currencySpcAfterSym[i] = ures_getStringByKey(dataRes, keywords[i],
H A Dcurrpinf.cpp278 StringEnumeration* keywords = fPluralRules->getKeywords(ec); local
281 while ((pluralCount = keywords->next(NULL, ec)) != NULL) {
316 delete keywords;
H A Dplurrule.cpp521 // fully support it (for example, the returned keywords is a list and not a set).
1100 RuleChain::getKeywords(int32_t capacityOfKeywords, UnicodeString* keywords, int32_t& arraySize) const { argument
1102 keywords[arraySize++]=keyword;
1109 return next->getKeywords(capacityOfKeywords, keywords, arraySize);
H A Dtmutfmt.cpp558 StringEnumeration* keywords = fPluralRules->getKeywords(err); local
561 while ((pluralCount = keywords->snext(err)) != NULL) {
590 delete keywords;
H A Ducol_tok.cpp2257 char *keywords = (char *)locale_getKeywordsStart(locale); local
2258 if(keywords != NULL) {
2259 *keywords = 0;
/external/chromium/chrome/browser/webdata/
H A Dweb_data_service.h107 std::vector<TemplateURL*> keywords; member in struct:WDKeywordsResult
111 // Version of the built-in keywords. A value of 0 indicates a first run.
323 // Fetches the keywords.
327 // Sets the keywords used for the default search provider.
330 // Sets the version of the builtin keywords.
/external/chromium/testing/gmock/scripts/generator/cpp/
H A Dast.py45 from cpp import keywords namespace
417 modifiers: [str] type modifiers (keywords) eg, const, mutable, etc.
493 if keywords.IsKeyword(t.name):
564 if keywords.IsKeyword(p.name):
739 if (keywords.IsKeyword(token.name) and
740 not keywords.IsBuiltinType(token.name)):
1342 keywords.IsKeyword(token.name)):
1393 if keywords.IsKeyword(key) or key == ',':
/external/icu4c/common/
H A Dlocid.cpp73 char *keywords, int32_t keywordCapacity,
956 char *keywords; member in class:KeywordEnumeration
967 : keywords((char *)&fgClassID), current((char *)&fgClassID), length(0) {
972 keywords = (char *)uprv_malloc(keywordLen+1);
973 if (keywords == NULL) {
977 uprv_memcpy(keywords, keys, keywordLen);
978 keywords[keywordLen] = 0;
979 current = keywords + currentIndex;
987 uprv_free(keywords);
993 return new KeywordEnumeration(keywords, lengt
1041 char keywords[256]; local
[all...]
H A Duloc.c57 char *keywords, int32_t keywordCapacity,
644 char *keywords, int32_t keywordCapacity,
663 /* we will grab pairs, trim spaces, lowercase keywords, sort and return */
763 /* now we have a list of keywords */
770 uprv_strcpy(keywords+keywordsLen, keywordList[i].keyword);
772 keywords[keywordsLen + keywordList[i].keywordLen] = '=';
774 keywords[keywordsLen + keywordList[i].keywordLen] = 0;
780 uprv_strncpy(keywords+keywordsLen, keywordList[i].valueStart, keywordList[i].valueLen);
786 keywords[keywordsLen] = ';';
805 return u_terminateChars(keywords, keywordCapacit
642 _getKeywords(const char *localeID, char prev, char *keywords, int32_t keywordCapacity, char *values, int32_t valuesCapacity, int32_t *valLen, UBool valuesToo, const char* addKeyword, const char* addValue, UErrorCode *status) argument
812 locale_getKeywords(const char *localeID, char prev, char *keywords, int32_t keywordCapacity, char *values, int32_t valuesCapacity, int32_t *valLen, UBool valuesToo, UErrorCode *status) argument
1462 char* keywords; member in struct:UKeywordsContext
1553 char keywords[256]; local
[all...]
/external/openssh/
H A Dreadconf.c146 } keywords[] = { variable in typeref:struct:__anon9660
337 for (i = 0; keywords[i].name; i++)
338 if (strcasecmp(cp, keywords[i].name) == 0)
339 return keywords[i].opcode;
H A Dservconf.c343 } keywords[] = { variable in typeref:struct:__anon9667
479 for (i = 0; keywords[i].name; i++)
480 if (strcasecmp(cp, keywords[i].name) == 0) {
481 *flags = keywords[i].flags;
482 return keywords[i].opcode;
1627 for (i = 0; keywords[i].name != NULL; i++)
1628 if (keywords[i].opcode == code)
1629 return(keywords[i].name);
/external/v8/test/cctest/
H A Dtest-parsing.cc50 static const KeywordToken keywords[] = { local
60 for (int i = 0; (key_token = keywords[i]).keyword != NULL; i++) {
68 // The scanner should parse Harmony keywords for this test.
/external/valgrind/main/coregrind/m_gdbserver/
H A Dm_gdbserver.c1164 Int VG_(keyword_id) (Char* keywords, Char* input_word, kwd_report_error report) argument
1168 Char kwds[VG_(strlen)(keywords)+1];
1191 VG_(strcpy) (kwds, keywords);
1231 iw, keywords);
/external/doclava/src/com/google/doclava/
H A DClassInfo.java713 public void makeKeywordEntries(List<KeywordEntry> keywords) { argument
721 keywords.add(new KeywordEntry(name(), htmlPage, "class in " + containingPackage().name()));
731 keywords.add(new KeywordEntry(field.name(), htmlPage + "#" + field.anchor(),
739 keywords.add(new KeywordEntry(field.name(), htmlPage + "#" + field.anchor(), "constant in "
747 keywords.add(new KeywordEntry(field.name(), htmlPage + "#" + field.anchor(), "field in "
755 keywords.add(new KeywordEntry(m.prettySignature(), htmlPage + "#" + m.anchor(),
764 keywords.add(new KeywordEntry(m.prettySignature(),
774 keywords.add(new KeywordEntry(m.prettySignature(),
784 keywords.add(new KeywordEntry(m.name() + m.prettySignature(),
793 keywords
[all...]
/external/icu4c/test/cintltst/
H A Dcloctst.c690 static const char *expect[] = { "Spanish (Calendar=Japanese Calendar, Sort Order=Traditional Sort Order)", /* note sorted order of keywords */
1626 UEnumeration *keywords; local
1634 keywords = uloc_openKeywords(testCases[i].localeID, &status);
1642 if(keywords) {
1643 if((keyCount = uenum_count(keywords, &status)) != testCases[i].numKeywords) {
1644 log_err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1648 while((keyword = uenum_next(keywords, &keywordLen, &status))) {
1655 uenum_reset(keywords, &status);
1656 while((keyword = uenum_next(keywords, &keywordLen, &status))) {
1663 uenum_close(keywords);
[all...]

Completed in 5426 milliseconds

12