HomeSort by relevance Sort by last modified time
    Searched refs:match (Results 326 - 350 of 3045) sorted by null

<<11121314151617181920>>

  /external/iproute2/examples/diffserv/
Edge32-ca-u32 58 match ip tos 0x88 0xfc \
62 match ip tos 0x88 0xfc \
71 match ip tos 0x88 0xfc \
75 match ip tos 0x88 0xfc \
83 match ip tos 0x88 0xfc \
87 match ip tos 0x88 0xfc \
98 match ip tos 0x90 0xfc \
102 match ip tos 0x90 0xfc \
110 match ip tos 0x90 0xfc \
114 match ip tos 0x90 0xfc
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
MoveHandler.java 211 List<Match> horizontalMatches = findClosest(edge, mHorizontalEdges);
216 List<Match> verticalMatches = findClosest(edge, mVerticalEdges);
220 // Match center
226 // Match baseline
249 Match match = pickBestMatch(mHorizontalSuggestions); local
250 if (match != null) {
251 if (mHorizontalDeps.contains(match.edge.node)) {
252 match.cycle = true;
262 snapHorizontal(match.with, match.edge.at, mBounds)
    [all...]
ResizeHandler.java 218 Match match = pickBestMatch(mHorizontalSuggestions); local
219 if (match != null
220 && (!mSnap || Math.abs(match.delta) < BaseLayoutRule.getMaxMatchDistance())) {
221 if (mHorizontalDeps.contains(match.edge.node)) {
222 match.cycle = true;
225 snapHorizontal(hEdge, match.edge.at, newBounds);
228 mCurrentTopMatch = match;
230 mCurrentBottomMatch = match;
234 mCurrentTopMatch = match;
242 Match match = pickBestMatch(mVerticalSuggestions); local
    [all...]
  /libcore/luni/src/test/java/tests/security/cert/
X509CertSelectorTest.java 530 assertTrue("Any certificate should match in the case of null "
532 selector.match(cert1) && selector.match(cert2));
642 assertTrue("The certificate should match the selection criteria.",
643 selector.match(cert_1));
648 selector.match(cert_1));
    [all...]
X509CRLSelector2Test.java 62 * specified issuers match the selector, and if not specified issuer does
63 * not match the selector.
73 assertTrue("The CRL should match the selection criteria.", selector
74 .match(crl1));
75 assertFalse("The CRL should not match the selection criteria.",
76 selector.match(crl2));
78 assertTrue("The CRL should match the selection criteria.", selector
79 .match(crl2));
84 * issuers match the selector, and if not specified issuer does not match
    [all...]
  /external/chromium_org/chrome/browser/history/
shortcuts_backend.cc 34 // Takes Match classification vector and removes all matched positions,
42 &unmatched, i->offset, i->style & ~ACMatchClassification::MATCH);
47 // Normally shortcuts have the same match type as the original match they were
48 // created from, but for certain match types, we should modify the shortcut's
72 const AutocompleteMatch& match)
73 : fill_into_edit(match.fill_into_edit),
74 destination_url(match.destination_url),
75 contents(match.contents),
76 contents_class(StripMatchMarkers(match.contents_class))
109 AutocompleteMatch match; local
    [all...]
  /external/chromium_org/components/autofill/core/browser/
form_field.cc 70 const AutofillField** match) {
71 return ParseFieldSpecifics(scanner, pattern, MATCH_DEFAULT, match);
78 const AutofillField** match) {
87 return MatchAndAdvance(scanner, pattern, match_type, match);
92 const AutofillField** match) {
96 match);
114 const AutofillField** match) {
116 if (FormField::Match(field, pattern, match_type)) {
117 if (match)
118 *match = field
    [all...]
  /external/iptables/extensions/
libip6t_mh.c 66 "mh match options:\n"
67 "[!] --mh-type type[:type] match mh type\n");
82 unsigned int match = limit; local
88 if (match == limit || len == namelen)
89 match = i;
93 if (match != limit) {
94 return mh_names[match].type;
175 static void mh_print(const void *ip, const struct xt_entry_match *match,
178 const struct ip6t_mh *mhinfo = (struct ip6t_mh *)match->data;
189 static void mh_save(const void *ip, const struct xt_entry_match *match)
    [all...]
libxt_multiport.c 25 "multiport match options:\n"
28 " match source port(s)\n"
31 " match destination port(s)\n"
33 " match both source and destination port(s)\n"
40 "multiport match options:\n"
43 " match source port(s)\n"
46 " match destination port(s)\n"
48 " match both source and destination port(s)\n");
281 __multiport_print(const struct xt_entry_match *match, int numeric,
285 = (const struct xt_multiport *)match->data
    [all...]
  /frameworks/base/core/tests/coretests/src/android/app/activity/
LocalProvider.java 89 int match = sURLMatcher.match(url); local
90 switch (match) {
118 int match = sURLMatcher.match(url); local
119 switch (match) {
133 int match = sURLMatcher.match(url); local
135 switch (match) {
  /ndk/sources/host-tools/sed-4.2.1/testsuite/
tst-regex2.c 126 puts ("\nregexec without REG_NOSUB did not find the correct match");
144 int match; local
147 match = re_search (&rpbuf, string, len, 0, len,
149 if (match < 0)
155 if (match + 11 > len
156 || string + match >= strchr (string, 'R')
157 || strncmp (string + match,
162 puts ("\nre_search did not find the correct match");
174 if (regs.start[0] != match || regs.end[0] != match + 11
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
SimpleCLexer.java 55 match(';');
75 match('(');
95 match(',');
115 match(')');
135 match('{');
155 match('}');
175 match("for");
196 match("int");
217 match("char");
238 match("void");
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
SimpleCLexer.java 55 match(';');
75 match('(');
95 match(',');
115 match(')');
135 match('{');
155 match('}');
175 match("for");
196 match("int");
217 match("char");
238 match("void");
    [all...]
  /external/chromium/chrome/browser/bookmarks/
bookmark_index.cc 19 // Used when finding the set of bookmarks that match a query. Each match
22 struct BookmarkIndex::Match {
27 // when we match only one term, and is filled in when we get more than one
45 BookmarkIndex::Match::nodes_begin() const {
49 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const {
93 // We use a QueryParser to fill in match positions for us. It's not the most
127 const Match& match,
130 for (NodeSet::const_iterator i = match.nodes_begin()
171 Match match; local
183 Match match; local
206 Match* match = &((*matches)[i]); local
225 const Match& match = current_matches[i]; local
    [all...]
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_index.cc 20 // Used when finding the set of bookmarks that match a query. Each match
23 struct BookmarkIndex::Match {
28 // when we match only one term, and is filled in when we get more than one
46 BookmarkIndex::Match::nodes_begin() const {
50 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const {
95 // We use a QueryParser to fill in match positions for us. It's not the most
135 const Match& match,
138 for (NodeSet::const_iterator i = match.nodes_begin()
179 Match match; local
191 Match match; local
214 Match* match = &((*matches)[i]); local
233 const Match& match = current_matches[i]; local
    [all...]
  /external/chromium_org/v8/test/webkit/
regexp-alternatives.js 29 shouldBe('s1.match(/<((\\/([^>]+)>)|(([^>]+)>))/)', '["<p>","p>",undefined,undefined,"p>","p"]');
30 shouldBe('s1.match(/<((ABC>)|(\\/([^>]+)>)|(([^>]+)>))/)', '["<p>","p>",undefined,undefined,undefined,"p>","p"]');
31 shouldBe('s1.match(/<(a|\\/p|.+?)>/)', '["<p>","p"]');
34 shouldBe('s1.match(/<((\\/([^>]+)>)|((([^>])+)>))/)', '["<p>","p>",undefined,undefined,"p>","p","p"]');
35 shouldBe('s1.match(/<((ABC>)|(\\/([^>]+)>)|((([^>])+)>))/)', '["<p>","p>",undefined,undefined,undefined,"p>","p","p"]');
36 shouldBe('s1.match(/<(a|\\/p|(.)+?)>/)', '["<p>","p","p"]');
40 shouldBe('s2.match(/<((\\/([^>]+)>)|(([^>]+)>))\\5/)', '["<p>p","p>",undefined,undefined,"p>","p"]');
41 shouldBe('s2.match(/<((ABC>)|(\\/([^>]+)>)|(([^>]+)>))\\6/)', '["<p>p","p>",undefined,undefined,undefined,"p>","p"]');
42 shouldBe('s2.match(/<(a|\\/p|.+?)>\\1/)', '["<p>p","p"]');
  /external/chromium/chrome/browser/autocomplete/
autocomplete_edit.cc 103 // Weird edge case to match other browsers: if the edit is empty, revert to
131 AutocompleteMatch match; local
132 GetInfoForCurrentText(&match, NULL);
133 return match;
248 AutocompleteMatch match; local
249 GetInfoForCurrentText(&match, NULL);
250 *url = match.destination_url;
288 // match. This would make the autocompleted text disappear, leaving our user
309 AutocompleteMatch match;
310 GetInfoForCurrentText(&match, NULL)
315 AutocompleteMatch match; local
434 AutocompleteMatch match; local
513 const AutocompleteMatch& match = local
605 AutocompleteMatch match; local
    [all...]
  /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/
tokenizer.py 116 match = matcher.regex.match(string, index)
118 if match:
125 # Add the match.
126 self.__AddToken(self._CreateToken(match.group(), matcher.type, line,
127 line_number, match.groupdict()))
129 # Change the mode to the correct one for after this match.
133 index = match.end()
139 # first character to the string of consecutive non match characters.
  /external/chromium_org/chrome/browser/ui/views/omnibox/
touch_omnibox_popup_contents_view.cc 34 const AutocompleteMatch& match,
38 if (!match.description.empty()) {
41 DrawString(canvas, match.description, match.description_class, true, x, y);
49 DrawString(canvas, match.contents, match.contents_class, false, x, y);
  /external/chromium_org/third_party/closure_linter/closure_linter/common/
tokenizer.py 116 match = matcher.regex.match(string, index)
118 if match:
125 # Add the match.
126 self.__AddToken(self._CreateToken(match.group(), matcher.type, line,
127 line_number, match.groupdict()))
129 # Change the mode to the correct one for after this match.
133 index = match.end()
139 # first character to the string of consecutive non match characters.
  /external/compiler-rt/lib/asan/scripts/
symbolize.py 42 match = re.match(r'\s*LOAD\s+0x[01-9a-zA-Z]+\s+(0x[01-9a-zA-Z]+)', line, re.UNICODE)
43 if match:
44 load_addr = int(match.group(1), 16)
64 match = re.match(r'^(\s*#)([0-9]+) *(0x[0-9a-f]+) *\((.*)\+(0x[0-9a-f]+)\)', line, re.UNICODE)
65 if match:
66 frameno = match.group(2)
67 binary = match.group(4)
68 addr = match.group(5
    [all...]
  /external/robolectric/src/test/java/com/xtremelabs/robolectric/tester/org/apache/http/
FakeHttpLayerTest.java 65 HttpGet match = new HttpGet("example.com"); local
67 match.setHeader(new BasicHeader("header1", "header one"));
68 noMatch.setHeader(new BasicHeader("header1", "header not a match"));
72 assertTrue(requestMatcherBuilder.matches(match));
86 HttpPut match = new HttpPut("example.com"); local
87 match.setEntity(new StringEntity(expectedText));
90 noMatch.setEntity(new StringEntity("some text that does not match"));
94 assertTrue(requestMatcherBuilder.matches(match));
  /external/skia/tests/
ReadWriteAlphaTest.cpp 71 // make sure the original & read back versions match
72 bool match = true; local
77 match = false;
82 REPORTER_ASSERT(reporter, match);
99 match = true;
104 match = false;
109 REPORTER_ASSERT(reporter, match);
  /libcore/luni/src/test/java/libcore/java/nio/charset/
OldCharset_SingleByteAbstractTest.java 71 assertEqualChars2("Decoded charactes must match!",
75 // assertTrue("Decoded charactes (REPLACEed ones INCLUSIVE) must match!",
78 // assertEqualChars("Decoded charactes (REPLACEed ones INCLUSIVE) must match!",
82 // assertEquals("Decoded charactes must match!",
95 // assertEqualChars("Decoded charactes must match!",
98 //// assertEquals("Decoded charactes must match!",
110 assertEqualBytes2("Encoded bytes must match!", allBytes, outputBB.array(), allChars);
122 //// System.out.format("Match index %d: %d = %d\n",
130 boolean match = true;
151 match = false
    [all...]
  /external/chromium_org/third_party/icu/source/common/
ucnv_ext.c 108 * or if the match length fits with the current converter state
110 #define UCNV_EXT_TO_U_VERIFY_SISO_MATCH(sisoState, match) \
111 ((sisoState)<0 || ((sisoState)==0) == (match==1))
132 return 0; /* no extension data, no match */
145 return 0; /* no match of a DBCS sequence in SBCS mode */
158 /* match input units until there is a full match or the input is consumed */
172 /* remember longest match so far */
177 /* match pre[] then src[] */
183 /* all input consumed, partial match */
283 int32_t match; local
333 int32_t match; local
371 int32_t match, length; local
752 int32_t match; local
811 int32_t match; local
865 int32_t match; local
    [all...]

Completed in 644 milliseconds

<<11121314151617181920>>