| /external/nist-sip/java/gov/nist/core/ |
| Match.java | 28 /** Match template for pattern matching.
38 public interface Match {
39 /** Return true if a match occurs for searchString.
40 * This is used for pattern matching in the find and replace and match
45 public boolean match(String searchString); method in interface:Match
|
| /external/regex-re2/re2/ |
| set.cc | 47 // Concatenate with match index and push on vector.
94 bool RE2::Set::Match(const StringPiece& text, vector<int>* v) const {
96 LOG(DFATAL) << "RE2::Set::Match without Compile";
104 LOG(DFATAL) << "RE2::Set::Match: DFA ran out of cache space";
109 LOG(DFATAL) << "RE2::Set::Match: match but unknown regexp set";
|
| /external/chromium/chrome/browser/history/ |
| text_database.cc | 29 // url URL of the page so searches will match the URL.
61 TextDatabase::Match::Match() {}
63 TextDatabase::Match::~Match() {}
248 // First get all rows that match. Selecing on time (which has an index) allows
250 // generally be only one match per time).
304 std::vector<Match>* results,
312 "WHERE pages MATCH ? AND time >= ? AND time < ? "
344 Match& match = results->at(results->size() - 1) local
[all...] |
| text_database.h | 30 struct Match {
31 Match();
32 ~Match();
34 // URL of the match.
49 // Snippet of the match we generated from the body.
137 std::vector<Match>* results,
|
| /external/chromium/webkit/glue/ |
| regular_expression_unittest.cc | 17 struct Match {
25 const Match* matches,
30 EXPECT_EQ(matches[i].matchPosition, regex.match(
47 EXPECT_EQ(0, regex.match("the quick brown fox"));
48 EXPECT_EQ(1, regex.match(" the quick brown fox"));
49 EXPECT_EQ(3, regex.match("foothe quick brown foxbar"));
51 EXPECT_EQ(-1, regex.match("The quick brown FOX"));
52 EXPECT_EQ(-1, regex.match("the quick brown fo"));
66 const Match matches[] = {
88 const Match matches[] =
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| AddrModeMatcher.h | 81 /// Match - Find the maximal addressing mode that a load/store of V can fold,
84 static ExtAddrMode Match(Value *V, Type *AccessTy,
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 24 /** A match is a potential pairing of two segments with a given {@link ConstraintType}. */
25 class Match {
35 /** the type of constraint this is a match for */
38 /** whether this {@link Match} results in a cycle */
41 /** The associated {@link GuidelineHander} which performed the match */
45 * Create a new match.
47 * @param handler the handler which performed the match
50 * @param type the type of constraint this is a match for
53 public Match(GuidelineHandler handler, Segment edge, Segment with,
64 * Returns the XML constraint attribute value for this match
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| Lexer.cs | 39 * uses simplified match() and error recovery mechanisms in the interest
109 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
137 // match() routine has already called recover()
208 public virtual void Match(string s) {
230 public virtual void Match(int c) {
294 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay(e.Character);
331 * Lexers can normally match any char in it's vocabulary after matching
|
| BaseRecognizer.cs | 117 * Match current input symbol against ttype. Attempt
131 public virtual object Match(IIntStream input, int ttype, BitSet follow) {
132 //System.out.println("match "+((TokenStream)input).LT(1));
148 /** <summary>Match the wildcard: in a symbol</summary> */
195 * To get out of recovery mode, the parser must successfully match
202 * 5. next match() will reset errorRecovery mode
301 msg = "required (...)+ loop did not match anything at input " +
323 * an error and next valid token match
375 * token that the match() routine could not recover from.
470 * with the successful match exits errorRecovery mode)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| Lexer.cs | 40 * uses simplified match() and error recovery mechanisms in the interest
127 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
166 // Match() routine has already called recover()
250 public virtual void Match( string s )
277 public virtual void Match( int c )
356 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay( e.Character );
403 * Lexers can normally match any char in it's vocabulary after matching
|
| BaseRecognizer.cs | 127 * Match current input symbol against ttype. Attempt
141 public virtual object Match( IIntStream input, int ttype, BitSet follow )
143 //System.out.println("match "+((TokenStream)input).LT(1));
161 /** <summary>Match the wildcard: in a symbol</summary> */
215 * To get out of recovery mode, the parser must successfully match
222 * 5. next match() will reset errorRecovery mode
348 msg = "required (...)+ loop did not match anything at input " +
376 * an error and next valid token match
441 * token that the match() routine could not recover from.
540 * with the successful match exits errorRecovery mode)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.h | 50 // Using (for example) kBlockSize = 4 guarantees that no match smaller
59 // match length that is guaranteed to be found in FindBestMatch(),
76 // This class is used to store the best match found by FindBestMatch()
78 class Match {
80 Match() : size_(0), source_offset_(-1), target_offset_(-1) { }
97 // The size of the best (longest) match passed to ReplaceIfBetterMatch().
100 // The source offset of the match, including the starting_offset_
101 // of the BlockHash for which the match was found.
104 // The target offset of the match. An offset of 0 corresponds to the
110 Match(const Match&); // NOLIN
[all...] |
| /external/v8/src/ |
| interface.cc | 35 static bool Match(void* key1, void* key2) {
88 if (*map == NULL) *map = new ZoneHashMap(Match, 8);
|
| interpreter-irregexp.cc | 628 RegExpImpl::IrregexpResult IrregexpInterpreter::Match(
|
| regexp-macro-assembler.cc | 104 NativeRegExpMacroAssembler::Result NativeRegExpMacroAssembler::Match(
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/ |
| SlimLexer.cs | 128 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
170 // match() routine has already called recover()
266 public void Match( string s )
293 public void Match( int c )
373 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay( e.Character );
420 * Lexers can normally match any char in it's vocabulary after matching
|
| /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/chrome/browser/renderer_host/ |
| gtk_key_bindings_handler.cc | 28 bool GtkKeyBindingsHandler::Match(const NativeWebKeyboardEvent& wke,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.cpp | 95 bool Match = true;
102 Match = false;
104 Match = false;
113 Match = false;
132 MatchReg &= Match;
704 "#operands for dag node doesn't match .td file!");
[all...] |
| /external/v8/test/cctest/ |
| test-date.cc | 64 if (Match(&rules_[i], year, month, day, time_in_day_sec)) {
71 bool Match(Rule* rule, int year, int month, int day, int time_in_day_sec) {
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| messagequeue.h | 128 inline bool Match(MessageHandler* handler, uint32 id) const {
|
| /external/chromium/chrome/browser/autofill/ |
| form_field.cc | 83 UBool match = matcher.find(0, status); local
85 return !!match;
125 bool FormField::Match(AutofillField* field,
208 if (Match(field, pattern, match_label_only)) {
269 // then we will match an element only if it is in the standard.
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 100 // Returns true on match.
101 virtual bool Match(const std::string &S) = 0;
126 virtual bool Match(const std::string &S) {
145 virtual bool Match(const std::string &S) {
146 return Regex.match(S);
442 if (D.Match(RightText))
449 // We are only interested in at least one match, so exit the loop.
|
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 1 //===- FileCheck.cpp - Check that File's Contents match what is expected --===//
59 /// FixedStr - If non-empty, this pattern is a fixed string match with the
84 /// Match - Match the pattern string against the input buffer Buffer. This
85 /// returns the position that is matched or npos if there is no match. If
86 /// there is a match, the size of the matched string is returned in MatchLen.
89 /// variables and is updated if this match defines new values.
90 size_t Match(StringRef Buffer, size_t &MatchLen,
93 /// PrintFailureInfo - Print additional information about a failure to match
104 /// should correspond to a perfect match
[all...] |
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| atom.c | 270 * Match() - See if a hash table entry is matches a string.
274 static int Match(HashTable *htable, StringTable *stable, const char *s, int hashloc)
284 } // Match
413 if (Match(&atable->htable, &atable->stable, s, hashloc))
421 if (Match(&atable->htable, &atable->stable, s, hashloc)) {
|
