Lines Matching refs:match
217 * set, or otherwise can match multiple keys, the index value is -1.
222 // match any key.
237 * then it will match any key.
241 // If there is neither then we match any key; return true.
330 * Attempt a match and replacement at the given position. Return
331 * the degree of match between this rule and the given text. The
332 * degree of match may be mismatch, a partial match, or a full
333 * match. A mismatch means at least one character of the text
334 * does not match the context or key. A partial match means some
335 * context and key characters match, but the text is not long
336 * enough to match all of them. A full match means all context
337 * and key characters match.
339 * If a full match is obtained, perform a replacement, update pos,
355 // match. Another way to do this is to have the match method
356 // create a match result struct with relevant offsets, and to pass
359 // ============================ MATCH ===========================
361 // Reset segment match data
382 // always in the BMP and because we are doing a literal match
387 UMatchDegree match;
389 // Start reverse match at char before pos.start
393 match = anteContext->matches(text, oText, anteLimit, FALSE);
394 if (match != U_MATCH) {
412 match = key->matches(text, oText, pos.limit, incremental);
413 if (match != U_MATCH) {
414 return match;
425 // pos.limit -- this is a partial match.
429 match = postContext->matches(text, oText, pos.contextLimit, incremental);
430 if (match != U_MATCH) {
431 return match;
448 // We have a full match. The key is between pos.start and
