| /external/icu4c/i18n/ |
| nfrs.cpp | 119 , rules(0)
175 // the descriptions of the rules (one rule per element). The rules
194 NFRule::makeRules(currentDescription, this, rules.last(), owner, rules, status);
198 // for rules that didn't specify a base value, their base values
200 // set all those rules' base values. We also remove any special
201 // rules from the list and put them into their own member variables
208 while (i < rules.size()) {
209 NFRule* rule = rules[i]
[all...] |
| tblcoll.cpp | 34 * Modified getRules() to load rules dynamically. Changed
88 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
92 construct(rules,
98 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
102 construct(rules,
108 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
113 construct(rules,
119 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
124 construct(rules,
145 // alias the rules strin
301 UChar *rules = (UChar*) uprv_malloc( sizeof(UChar) * (rulesize) ); local
595 const UChar *rules = ucol_getRules(ucollator, &length); local
[all...] |
| rbt_set.cpp | 134 // Fill the precontext and postcontext with the patterns of the rules
171 rules = NULL;
181 rules(0),
203 if (other.rules != 0 && U_SUCCESS(status)) {
213 delete ruleVector; // This deletes the contained rules
214 uprv_free(rules);
223 rules[i]->setData(d);
236 * Add a rule to this set. Rules are added in order, and order is
241 * unfreezes the rules, and freeze() must be called again.
258 uprv_free(rules);
[all...] |
| /external/bison/src/ |
| reader.c | 47 /* Should rules have a default precedence? */
413 | Convert the rules into the representation using RRHS, RLHS and |
429 rules = xnmalloc (nrules, sizeof *rules);
434 rules[ruleno].user_number = ruleno;
435 rules[ruleno].number = ruleno;
436 rules[ruleno].lhs = p->sym;
437 rules[ruleno].rhs = ritem + itemno;
438 rules[ruleno].prec = NULL;
439 rules[ruleno].dprec = p->dprec
[all...] |
| gram.c | 38 rule *rules = NULL; variable
186 int length = rule_rhs_length (&rules[r]);
196 | Print the grammar's rules that match FILTER on OUT under TITLE. |
210 if (filter && !filter (&rules[r]))
214 else if (previous_lhs && previous_lhs != rules[r].lhs)
217 rule_lhs_print (&rules[r], previous_lhs, out);
218 rule_rhs_print (&rules[r], out);
219 previous_lhs = rules[r].lhs;
227 | Print the grammar's useful rules on OUT. |
263 fprintf (out, "Rules\n-----\n\n")
[all...] |
| reduce.c | 47 /* Set of all rules which have no useless nonterminals in their RHS. */
77 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
85 | Remember that rules are 1-origin, symbols are 0-origin. |
123 bitset_set (Np, rules[r].lhs->number - ntokens);
181 && bitset_test (V, rules[r].lhs->number))
184 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
225 if (rules[r].precsym != 0)
226 bitset_set (V1, rules[r].precsym->number);
232 | Put the useless productions at the end of RULES, and adjust NRULES |
243 rules[r].useful = bitset_test (P, r)
[all...] |
| /external/webkit/WebCore/css/ |
| CSSMediaRule.h | 38 static PassRefPtr<CSSMediaRule> create(CSSStyleSheet* parent, PassRefPtr<MediaList> media, PassRefPtr<CSSRuleList> rules)
40 return adoptRef(new CSSMediaRule(parent, media, rules));
|
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/lib/ldscripts/ |
| i386linux.x | 20 *(.rules)
|
| i386linux.xbn | 20 *(.rules)
|
| i386linux.xn | 20 *(.rules)
|
| /external/chromium/third_party/icu/source/test/cintltst/ |
| cg7coll.c | 17 * Sample Rules: & Z < p , P
20 * Sample Rules: & c < ch , cH, Ch, CH
25 * Sample Rules: & Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'
28 * Sample Rules: & aa ; a'-' & ee ; e'-' & ii ; i'-' & oo ; o'-' & uu ; u'-'
116 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
118 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
120 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
122 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
191 static const char rules[] = "& Z < p, P"; local
192 int32_t len=(int32_t)strlen(rules);
222 static const char rules[] = "& C < ch , cH, Ch, CH"; local
251 static const char rules[] = "& Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'"; local
281 static const char rules[] = " & aa ; a'-' & ee ; e'-' & ii ; i'-' & oo ; o'-' & uu ; u'-' "; local
[all...] |
| callcoll.h | 53 void genericRulesStarterWithResult(const char *rules, const char * const s[], uint32_t size, UCollationResult result);
54 void genericRulesStarter(const char *rules, const char * const s[], uint32_t size);
55 void genericRulesStarterWithOptionsAndResult(const char *rules, const char * const s[], uint32_t size, const UColAttribute *attrs, const UColAttributeValue *values, uint32_t attsize, UCollationResult result);
|
| /external/icu4c/test/cintltst/ |
| cg7coll.c | 17 * Sample Rules: & Z < p , P
20 * Sample Rules: & c < ch , cH, Ch, CH
25 * Sample Rules: & Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'
28 * Sample Rules: & aa ; a'-' & ee ; e'-' & ii ; i'-' & oo ; o'-' & uu ; u'-'
116 /* new table collation with rules "& Z < p, P" loop to FIXEDTESTSET */
118 /* new table collation with rules "& C < ch , cH, Ch, CH " loop to TOTALTESTSET */
120 /* new table collation with rules "& Question-mark ; ? & Hash-mark ; # & Ampersand ; '&' " loop to TOTALTESTSET */
122 /* analogous to Japanese rules " & aa ; a- & ee ; e- & ii ; i- & oo ; o- & uu ; u- " */ /* loop to TOTALTESTSET */
129 To save space, Android does not include the collation tailoring rules.
195 static const char rules[] = "& Z < p, P" local
226 static const char rules[] = "& C < ch , cH, Ch, CH"; local
255 static const char rules[] = "& Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'"; local
285 static const char rules[] = " & aa ; a'-' & ee ; e'-' & ii ; i'-' & oo ; o'-' & uu ; u'-' "; local
[all...] |
| callcoll.h | 53 void genericRulesStarterWithResult(const char *rules, const char * const s[], uint32_t size, UCollationResult result);
54 void genericRulesStarter(const char *rules, const char * const s[], uint32_t size);
55 void genericRulesStarterWithOptionsAndResult(const char *rules, const char * const s[], uint32_t size, const UColAttribute *attrs, const UColAttributeValue *values, uint32_t attsize, UCollationResult result);
|
| /libcore/luni/src/main/java/java/text/ |
| RuleBasedCollator.java | 35 * The collation table is composed of a list of collation rules, where each rule
70 * modification at the end of a set of rules:
137 * The following rules are not valid:
154 * rule-based collator object with specialized rules tailored to your needs, you
155 * construct the {@code RuleBasedCollator} with the rules contained in a
194 * // First, get the collation rules from en_USCollator
197 * // Second, get the collation rules from da_DKCollator
201 * // newCollator has the combined rules
212 * // Create a new Collator object with additional rules
216 * // myCollator contains the new rules
[all...] |
| /external/chromium/net/base/ |
| escape.cc | 113 UnescapeRule::Type rules,
122 if (rules == UnescapeRule::NONE)
151 (value == ' ' && (rules & UnescapeRule::SPACES)) ||
154 (value > ' ' && (rules & UnescapeRule::URL_SPECIAL_CHARS)) ||
156 (value < ' ' && (rules & UnescapeRule::CONTROL_CHARS)))) {
179 } else if ((rules & UnescapeRule::REPLACE_PLUS_WITH_SPACE) &&
262 UnescapeRule::Type rules,
267 UnescapeURLImpl(text, rules, offset_for_adjustment));
281 UnescapeRule::Type rules) {
282 return UnescapeURLImpl(escaped_text, rules, NULL)
[all...] |
| escape.h | 55 // just the absence of them). All other unescape rules imply "normal" in
94 UnescapeRule::Type rules);
96 UnescapeRule::Type rules);
108 UnescapeRule::Type rules,
|
| /external/chromium/third_party/icu/public/i18n/unicode/ |
| plurfmt.h | 63 * rules define both what plural cases exist in a language, and to
65 * <li>It provides predefined plural rules for many locales. Thus, the programmer
75 * a predefined set of plural rules. You can create one using one of
93 * rules of the <code>PluralFormat</code> object do not contain a plural case
159 * <h4>Defining Custom Plural Rules</h4>
160 * <p>If you need to use <code>PluralFormat</code> with custom rules, you can
179 * This locale will be used to get the set of plural rules and for standard
190 * rules for this locale. This locale will also be used for
199 * Creates a new <code>PluralFormat</code> for a given set of rules.
201 * @param rules defines the behavior of the <code>PluralFormat</code
[all...] |
| /external/icu4c/i18n/unicode/ |
| plurfmt.h | 63 * rules define both what plural cases exist in a language, and to
65 * <li>It provides predefined plural rules for many locales. Thus, the programmer
75 * a predefined set of plural rules. You can create one using one of
93 * rules of the <code>PluralFormat</code> object do not contain a plural case
159 * <h4>Defining Custom Plural Rules</h4>
160 * <p>If you need to use <code>PluralFormat</code> with custom rules, you can
179 * This locale will be used to get the set of plural rules and for standard
190 * rules for this locale. This locale will also be used for
199 * Creates a new <code>PluralFormat</code> for a given set of rules.
201 * @param rules defines the behavior of the <code>PluralFormat</code
[all...] |
| /external/chromium/net/tools/tld_cleanup/ |
| tld_cleanup.cc | 18 // * Strips blank lines and comments, as well as notes for individual rules.
24 // * Adds explicit rules for true TLDs found in any rule.
52 // Writes the list of domain rules contained in the 'rules' set to the
55 bool WriteRules(const RuleMap& rules, FilePath outfile) {
72 for (RuleMap::const_iterator i = rules.begin(); i != rules.end(); ++i) {
162 // the most severe of the result codes encountered when normalizing the rules.
178 RuleMap rules; local
200 // Check the existing rules to make sure we don't have an exception an
[all...] |
| /external/chromium/net/proxy/ |
| proxy_resolver_js_bindings_unittest.cc | 88 host_resolver->rules()->AddSimulatedFailure("");
92 host_resolver->rules()->AddRule("google.com", "192.168.1.1");
96 host_resolver->rules()->AddSimulatedFailure("fail");
139 host_resolver->rules()->AddRuleForAddressFamily(
141 host_resolver->rules()->AddRuleForAddressFamily(
143 host_resolver->rules()->AddRuleForAddressFamily(
145 host_resolver->rules()->AddRuleForAddressFamily(
|
| /external/chromium/third_party/icu/source/i18n/ |
| tblcoll.cpp | 34 * Modified getRules() to load rules dynamically. Changed
88 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
92 construct(rules,
98 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
102 construct(rules,
108 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
113 construct(rules,
119 RuleBasedCollator::RuleBasedCollator(const UnicodeString& rules,
124 construct(rules,
145 // alias the rules strin
301 UChar *rules = (UChar*) uprv_malloc( sizeof(UChar) * (rulesize) ); local
595 const UChar *rules = ucol_getRules(ucollator, &length); local
[all...] |
| rbt_set.cpp | 134 // Fill the precontext and postcontext with the patterns of the rules
171 rules = NULL;
181 rules(0),
203 if (other.rules != 0 && U_SUCCESS(status)) {
213 delete ruleVector; // This deletes the contained rules
214 uprv_free(rules);
223 rules[i]->setData(d);
236 * Add a rule to this set. Rules are added in order, and order is
241 * unfreezes the rules, and freeze() must be called again.
258 uprv_free(rules);
[all...] |
| /external/chromium/third_party/icu/source/test/intltest/ |
| itrbnfp.cpp | 58 // these rules make no sense but behave rationally
102 // these rules would throw exceptions when formatting, if we could throw exceptions
111 // none of these rules should crash the formatter
119 const char** rules = allrules[j]; local
120 for (int i = 0; rules[i]; ++i) {
121 const char* rule = rules[i];
|
| /external/icu4c/test/intltest/ |
| itrbnfp.cpp | 58 // these rules make no sense but behave rationally
102 // these rules would throw exceptions when formatting, if we could throw exceptions
111 // none of these rules should crash the formatter
119 const char** rules = allrules[j]; local
120 for (int i = 0; rules[i]; ++i) {
121 const char* rule = rules[i];
|
