Class AffixMatcher
java.lang.Object
org.graalvm.shadowed.com.ibm.icu.impl.number.parse.AffixMatcher
- All Implemented Interfaces:
NumberParseMatcher
-
Nested Class Summary
Nested classes/interfaces inherited from interface org.graalvm.shadowed.com.ibm.icu.impl.number.parse.NumberParseMatcher
NumberParseMatcher.Flexible -
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final Comparator<AffixMatcher> Comparator for two AffixMatcher instances which prioritizes longer prefixes followed by longer suffixes, ensuring that the longest prefix/suffix pair is always chosen. -
Method Summary
Modifier and TypeMethodDescriptionstatic voidcreateMatchers(AffixPatternProvider patternInfo, NumberParserImpl output, AffixTokenMatcherFactory factory, IgnorablesMatcher ignorables, int parseFlags) booleaninthashCode()booleanmatch(StringSegment segment, ParsedNumber result) Runs this matcher starting at the beginning of the given StringSegment.voidpostProcess(ParsedNumber result) Method called at the end of a parse, after all matchers have failed to consume any more chars.booleansmokeTest(StringSegment segment) Performs a fast "smoke check" for whether or not this matcher could possibly match against the given string segment.toString()
-
Field Details
-
COMPARATOR
Comparator for two AffixMatcher instances which prioritizes longer prefixes followed by longer suffixes, ensuring that the longest prefix/suffix pair is always chosen.
-
-
Method Details
-
createMatchers
public static void createMatchers(AffixPatternProvider patternInfo, NumberParserImpl output, AffixTokenMatcherFactory factory, IgnorablesMatcher ignorables, int parseFlags) -
match
Description copied from interface:NumberParseMatcherRuns this matcher starting at the beginning of the given StringSegment. If this matcher finds something interesting in the StringSegment, it should update the offset of the StringSegment corresponding to how many chars were matched.- Specified by:
matchin interfaceNumberParseMatcher- Parameters:
segment- The StringSegment to match against. Matches always start at the beginning of the segment. The segment is guaranteed to contain at least one char.result- The data structure to store results if the match succeeds.- Returns:
- Whether this matcher thinks there may be more interesting chars beyond the end of the string segment.
-
smokeTest
Description copied from interface:NumberParseMatcherPerforms a fast "smoke check" for whether or not this matcher could possibly match against the given string segment. The test should be as fast as possible but also as restrictive as possible. For example, matchers can maintain a UnicodeSet of all code points that count possibly start a match. Matchers should use theStringSegment.startsWith(int)method in order to correctly handle case folding.- Specified by:
smokeTestin interfaceNumberParseMatcher- Parameters:
segment- The segment to check against.- Returns:
- true if the matcher might be able to match against this segment; false if it definitely will not be able to match.
-
postProcess
Description copied from interface:NumberParseMatcherMethod called at the end of a parse, after all matchers have failed to consume any more chars. Allows a matcher to make final modifications to the result given the knowledge that no more matches are possible.- Specified by:
postProcessin interfaceNumberParseMatcher- Parameters:
result- The data structure to store results.
-
equals
-
hashCode
-
toString
-