Searched refs:rules (Results 176 - 200 of 330) sorted by relevance

1234567891011>>

/external/icu4c/common/unicode/
H A Dubrk.h70 * The text boundary positions are found according to the rules
221 * Open a new UBreakIterator for locating text boundaries using specified breaking rules.
223 * @param rules A set of rules specifying the text breaking conventions.
224 * @param rulesLength The number of characters in rules, or -1 if null-terminated.
229 * detected while parsing the rules.
231 * @return A UBreakIterator for the specified rules.
236 ubrk_openRules(const UChar *rules,
457 * within brackets, {123}, for example. For rules that do not specify a
467 * Get the statuses from the break rules tha
[all...]
/external/webkit/Source/WebCore/icu/unicode/
H A Dubrk.h321 * Open a new UBreakIterator for locating text boundaries using specified breaking rules.
323 * @param rules A set of rules specifying the text breaking conventions.
324 * @param rulesLength The number of characters in rules, or -1 if null-terminated.
329 * detected while parsing the rules.
331 * @return A UBreakIterator for the specified rules.
336 ubrk_openRules(const UChar *rules,
519 * within brackets, {123}, for example. For rules that do not specify a
529 * Get the statuses from the break rules that determined the most recently
531 * within brackets, {123}, for example. The default status value for rules
[all...]
/external/icu4c/test/cintltst/
H A Dcbiapts.c503 // Open a break iterator from char * rules. Take care of conversion
504 // of the rules and error checking.
506 static UBreakIterator * testOpenRules(char *rules) { argument
513 ruleSourceU = toUChar(rules, &strCleanUp);
515 bi = ubrk_openRules(ruleSourceU, -1, /* The rules */
530 * a set of source rules.
537 char rules[] = "abc{666}/def;\n [\\p{L} - [a]]* {2}; . {1};"; local
550 UBreakIterator *bi = testOpenRules(rules);
584 * TestBreakIteratorRuleError - Try to create a BI from rules with syntax errors,
587 char rules[] local
618 UChar rules[RULE_STRING_LENGTH]; local
[all...]
H A Dusrchtst.c54 UChar rules[1024]; local
67 u_strcpy(rules, ucol_getRules(DE_, &rulelength));
68 u_unescape(EXTRACOLLATIONRULE, rules + rulelength, 1024 - rulelength);
72 DE_ = ucol_openRules(rules, u_strlen(rules), UCOL_ON, UCOL_TERTIARY,
74 u_strcpy(rules, ucol_getRules(ES_, &rulelength));
75 u_unescape(EXTRACOLLATIONRULE, rules + rulelength, 1024 - rulelength);
78 ES_ = ucol_openRules(rules, u_strlen(rules), UCOL_ON, UCOL_TERTIARY,
927 UChar rules[3 local
1652 UChar rules[128]; local
1695 UChar rules[128]; local
2030 UChar rules[32]; local
2380 UChar rules[128]; local
[all...]
/external/icu4c/tools/tzcode/
H A Dzic.c293 static struct rule * rules; variable in typeref:struct:rule
294 static int nrules; /* number of rules */
315 /* Indices into rules[] for final rules. They will occur in pairs,
318 * index into finalRules[]. FinalRules[] are aliases into rules[]. */
846 ** Associate sets of rules with zones.
871 (void) qsort((void *) rules, (size_t) nrules,
872 (size_t) sizeof *rules, rcomp);
874 if (strcmp(rules[i].r_name,
875 rules[
[all...]
/external/icu4c/i18n/
H A Ducol_tok.cpp210 void syntaxError(const UChar* rules, argument
222 u_memcpy(parseError->preContext,rules+start,stop-start);
232 u_memcpy(parseError->postContext,rules+start,stop-start);
700 // reads and conforms to various options in rules
1027 // enabling rules to start with non-tokens a < b
1205 // enabling rules to start with a non-token character a < b
1239 /* if it is, it's just a regular character in collation rules */
1786 if(lastToken == NULL) { /* this means that rules haven't started properly */
1912 } else { /* repeated one thing twice in rules, stay with the stronger strength */
2099 } else { /* reset to something already in rules */
2129 const UChar* rules = NULL; local
2158 ucol_tok_initTokenList( UColTokenParser *src, const UChar *rules, uint32_t rulesLength, const UCollator *UCA, GetCollationRulesFunction importFunc, void* context, UErrorCode *status) argument
[all...]
H A Dvtzone.cpp550 // No more rules
594 // Parse the rest of rules if number of rules is not exceeding 7.
1369 UVector *rules = NULL; // list of TimeZoneRule instances local
1374 rules = new UVector(status);
1379 rules->setDeleter(deleteTimeZoneRule);
1385 if (rules == NULL || dates == NULL) {
1565 rules->addElement(rule, status);
1575 if (rules->size() == 0) {
1596 for (n = 0; n < rules
[all...]
H A Drbnf.cpp830 UnicodeString rules = rhs.getRules(); local
832 init(rules, rhs.localizations ? rhs.localizations->ref() : NULL, perror, status);
849 UnicodeString rules = getRules(); local
852 result = new RuleBasedNumberFormat(rules, localizations, locale, perror, status);
1298 RuleBasedNumberFormat::init(const UnicodeString& rules, LocalizationInfo* localizationInfos, argument
1310 UnicodeString description(rules);
1316 // start by stripping the trailing whitespace from all the rules
1323 // check to see if there's a set of lenient-parse rules. If there
1334 // rules (there may be whitespace between the name and
1346 // copy out the lenient-parse rules an
[all...]
/external/icu4c/test/intltest/
H A Dsrchtest.cpp66 UnicodeString rules; local
67 rules.setTo(((RuleBasedCollator *)m_de_)->getRules());
70 rules.append(extrarules, u_strlen(extrarules));
73 m_de_ = new RuleBasedCollator(rules, status);
75 rules.setTo(((RuleBasedCollator *)m_es_)->getRules());
76 rules.append(extrarules, u_strlen(extrarules));
80 m_es_ = new RuleBasedCollator(rules, status);
1069 UnicodeString rules; local
1070 rules.setTo(temp, u_strlen(temp));
1071 RuleBasedCollator *tailored = new RuleBasedCollator(rules, statu
1599 UnicodeString rules; local
1635 UnicodeString rules; local
1923 UnicodeString rules; local
2202 UnicodeString rules; local
[all...]
H A Dtrnserr.cpp155 errln("FAIL: The rules is malformed but error was not reported.");
214 UnicodeString rules="ab>y"; local
224 Transliterator *t = Transliterator::createFromRules(id, rules, UTRANS_REVERSE, parseErr, status);
/external/iptables/libiptc/
H A Dlibiptc.c1 /* Library which manipulates firewall rules. Version $Revision$ */
3 /* Architecture of firewall rules is as follows:
124 unsigned int num_rules; /* number of rules in list */
125 struct list_head rules; /* list of rules */ member in struct:chain_head
172 INIT_LIST_HEAD(&c->rules);
664 list_for_each_entry(r, &c->rules, list) {
679 list_for_each_entry_reverse(r, &c->rules, list) {
815 * chain policy rules.
825 h->chain_iterator_cur->rules
[all...]
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/model/
H A DTestSuiteFactory.java76 result.rules = loadRulesFromGrammar(grammarFile);
89 /* Load rules from an ANTLR grammar file. */
99 parser.rules = ruleNames;
174 // load un-tested rules from grammar
/external/bison/src/
H A DLR0.c110 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
264 | Find which rules can be used for reduction transitions from the |
275 /* Find and count the active items that represent ends of rules. */
282 redset[count++] = &rules[r];
/external/chromium/chrome/browser/resources/
H A Dprint_preview_animations.js189 var rules = document.createTextNode(
194 el.appendChild(rules);
/external/dhcpcd/mk/
H A Dprog.mk0 # rules to build a program
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/configuration/org.eclipse.osgi/bundles/59/1/.cp/
H A DjdtCompilerAdapter.jar ... .Commandline$Argument arg String[] pathElements int rulesLength String[] rules int nextRule StringBuffer result int i int max String pathElement ...
/external/icu4c/common/
H A Dubrk.cpp89 // ubrk_openRules open a break iterator from a set of break rules.
94 ubrk_openRules( const UChar *rules, argument
106 UnicodeString ruleString(rules, rulesLength);
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
H A DJava.stg51 /** The overall file structure of a recognizer; stores methods for rules
56 name, tokens, tokenNames, rules, cyclicDFAs,
84 lexer(grammar, name, tokens, scopes, rules, numRules, filterMode, labelType="CommonToken",
124 <rules; separator="\n\n">
200 genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRules,
245 <rules; separator="\n\n">
247 <! generate rule/method definitions for imported rules so they
249 // Delegated rules
273 parser(grammar, name, scopes, tokens, tokenNames, rules, numRules, bitsets,
276 <genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRule
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DBaseRecognizer.java705 /** Return List<String> of the rules in your parser instance
728 List rules = new ArrayList();
742 rules.add(t.getMethodName());
744 return rules;
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DRule.java137 * Rewrite rules force tracking of all tokens.
147 * Rewrite rules force tracking of all rule result ASTs. 1..n
268 * token IDs to check for token IDs without corresponding lexer rules.
308 /** For use with rewrite rules, we must track all tokens matched on the
339 /** For use with rewrite rules, we must track all rule AST results on the
344 Set rules = new HashSet();
348 rules.addAll(m.keySet());
351 return rules;
566 /** Used during grammar imports to see if sets of rules intersect... This
573 /** Used during grammar imports to see if sets of rules intersec
[all...]
H A DGrammar.java148 * lexer rules from combined grammars.
302 * a global list of rules, token types, decision numbers, etc...
340 /** A list of all rules that are in any left-recursive cycle. There
342 * rules. This is stuff we couldn't refactor to precedence rule.
355 * and build faux rules for them later. See my blog entry Dec 2, 2005:
369 * early when we look for prec rules.
385 /** If this rule is a delegate, some rules might be overridden; don't
390 /** The list of all rules referenced in this grammar, not defined here,
399 /** The ANTLRParser tracks lexer rules when reading combined grammars
404 /** Track the scopes defined outside of rules an
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
H A DDelphi.stg50 /** The overall file structure of a recognizer; stores methods for rules
62 * rules:
72 * numRules (Integer): number of rules
83 name, tokens, tokenNames, rules, cyclicDFAs,
117 lexer(grammar, name, tokens, scopes, rules, numRules, labelType="Token",
163 <rules: {r | <if(!r.ruleDescriptor.isSynPred)><lexerRuleDeclaration(r)><endif>}>
215 <rules; separator="\n\n">
306 genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRules,
310 <rules: {r | <genericParserRuleReturnType(rule=r, ruleDescriptor=r.ruleDescriptor)>}>
312 <rules
[all...]
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DANTLRTreePrinter.g156 rules
227 rules
H A DAssignTokenTypesWalker.g37 * Compute the token types for all literals and rules etc.. There are
70 * no token rules implies pure parser.
219 rules
289 rules
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
H A DActionScript.stg38 /** The overall file structure of a recognizer; stores methods for rules
43 name, tokens, tokenNames, rules, cyclicDFAs,
64 lexer(grammar, name, tokens, scopes, rules, numRules, labelType="Token",
98 <rules; separator="\n\n">
170 genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRules,
208 <rules; separator="\n\n">
210 <! generate rule/method definitions for imported rules so they
212 // Delegated rules
235 parser(grammar, name, scopes, tokens, tokenNames, rules, numRules, bitsets, ASTLabelType="Object", superClass="Parser", labelType="Token", members={<actions.parser.members>}) ::= <<
242 treeParser(grammar, name, scopes, tokens, tokenNames, globalAction, rules, numRule
[all...]

Completed in 597 milliseconds

1234567891011>>