1 // © 2018 and later: Unicode, Inc. and others.
2 // License & terms of use: http://www.unicode.org/copyright.html
4 #include "unicode/utypes.h"
6 #if !UCONFIG_NO_FORMATTING
7 #ifndef __NUMPARSE_TYPES_H__
8 #define __NUMPARSE_TYPES_H__
10 #include "unicode/uobject.h"
11 #include "number_decimalquantity.h"
13 U_NAMESPACE_BEGIN
namespace numparse
{
16 // Forward-declarations
20 typedef int32_t result_flags_t
;
21 typedef int32_t parse_flags_t
;
23 /** Flags for the type result_flags_t */
25 FLAG_NEGATIVE
= 0x0001,
26 FLAG_PERCENT
= 0x0002,
27 FLAG_PERMILLE
= 0x0004,
28 FLAG_HAS_EXPONENT
= 0x0008,
29 // FLAG_HAS_DEFAULT_CURRENCY = 0x0010, // no longer used
30 FLAG_HAS_DECIMAL_SEPARATOR
= 0x0020,
32 FLAG_INFINITY
= 0x0080,
36 /** Flags for the type parse_flags_t */
38 PARSE_FLAG_IGNORE_CASE
= 0x0001,
39 PARSE_FLAG_MONETARY_SEPARATORS
= 0x0002,
40 PARSE_FLAG_STRICT_SEPARATORS
= 0x0004,
41 PARSE_FLAG_STRICT_GROUPING_SIZE
= 0x0008,
42 PARSE_FLAG_INTEGER_ONLY
= 0x0010,
43 PARSE_FLAG_GROUPING_DISABLED
= 0x0020,
44 // PARSE_FLAG_FRACTION_GROUPING_ENABLED = 0x0040, // see #10794
45 PARSE_FLAG_INCLUDE_UNPAIRED_AFFIXES
= 0x0080,
46 PARSE_FLAG_USE_FULL_AFFIXES
= 0x0100,
47 PARSE_FLAG_EXACT_AFFIX
= 0x0200,
48 PARSE_FLAG_PLUS_SIGN_ALLOWED
= 0x0400,
49 // PARSE_FLAG_OPTIMIZE = 0x0800, // no longer used
50 // PARSE_FLAG_FORCE_BIG_DECIMAL = 0x1000, // not used in ICU4C
51 PARSE_FLAG_NO_FOREIGN_CURRENCY
= 0x2000,
52 PARSE_FLAG_ALLOW_INFINITE_RECURSION
= 0x4000,
56 // TODO: Is this class worthwhile?
57 template<int32_t stackCapacity
>
58 class CompactUnicodeString
{
60 CompactUnicodeString() {
61 static_assert(stackCapacity
> 0, "cannot have zero space on stack");
65 CompactUnicodeString(const UnicodeString
& text
)
66 : fBuffer(text
.length() + 1) {
67 uprv_memcpy(fBuffer
.getAlias(), text
.getBuffer(), sizeof(UChar
) * text
.length());
68 fBuffer
[text
.length()] = 0;
71 inline UnicodeString
toAliasedUnicodeString() const {
72 return UnicodeString(TRUE
, fBuffer
.getAlias(), -1);
75 bool operator==(const CompactUnicodeString
& other
) const {
76 // Use the alias-only constructor and then call UnicodeString operator==
77 return toAliasedUnicodeString() == other
.toAliasedUnicodeString();
81 MaybeStackArray
<UChar
, stackCapacity
> fBuffer
;
86 * Struct-like class to hold the results of a parsing routine.
90 // Exported as U_I18N_API for tests
91 class U_I18N_API ParsedNumber
{
95 * The numerical value that was parsed.
97 ::icu::number::impl::DecimalQuantity quantity
;
100 * The index of the last char consumed during parsing. If parsing started at index 0, this is equal
101 * to the number of chars consumed. This is NOT necessarily the same as the StringSegment offset;
102 * "weak" chars, like whitespace, change the offset, but the charsConsumed is not touched until a
103 * "strong" char is encountered.
108 * Boolean flags (see constants above).
110 result_flags_t flags
;
113 * The pattern string corresponding to the prefix that got consumed.
115 UnicodeString prefix
;
118 * The pattern string corresponding to the suffix that got consumed.
120 UnicodeString suffix
;
123 * The currency that got consumed.
125 UChar currencyCode
[4];
129 ParsedNumber(const ParsedNumber
& other
) = default;
131 ParsedNumber
& operator=(const ParsedNumber
& other
) = default;
136 * Call this method to register that a "strong" char was consumed. This should be done after calling
137 * {@link StringSegment#setOffset} or {@link StringSegment#adjustOffset} except when the char is
138 * "weak", like whitespace.
141 * <strong>What is a strong versus weak char?</strong> The behavior of number parsing is to "stop"
142 * after reading the number, even if there is other content following the number. For example, after
143 * parsing the string "123 " (123 followed by a space), the cursor should be set to 3, not 4, even
144 * though there are matchers that accept whitespace. In this example, the digits are strong, whereas
145 * the whitespace is weak. Grouping separators are weak, whereas decimal separators are strong. Most
146 * other chars are strong.
149 * The current StringSegment, usually immediately following a call to setOffset.
151 void setCharsConsumed(const StringSegment
& segment
);
153 /** Apply certain number-related flags to the DecimalQuantity. */
157 * Returns whether this the parse was successful. To be successful, at least one char must have been
158 * consumed, and the failure flag must not be set.
160 bool success() const;
162 bool seenNumber() const;
164 double getDouble(UErrorCode
& status
) const;
166 void populateFormattable(Formattable
& output
, parse_flags_t parseFlags
) const;
168 bool isBetterThan(const ParsedNumber
& other
);
173 * A mutable class allowing for a String with a variable offset and length. The charAt, length, and
174 * subSequence methods all operate relative to the fixed offset into the String.
178 // Exported as U_I18N_API for tests
179 class U_I18N_API StringSegment
: public UMemory
{
181 StringSegment(const UnicodeString
& str
, bool ignoreCase
);
183 int32_t getOffset() const;
185 void setOffset(int32_t start
);
188 * Equivalent to <code>setOffset(getOffset()+delta)</code>.
191 * This method is usually called by a Matcher to register that a char was consumed. If the char is
192 * strong (it usually is, except for things like whitespace), follow this with a call to
193 * {@link ParsedNumber#setCharsConsumed}. For more information on strong chars, see that method.
195 void adjustOffset(int32_t delta
);
198 * Adjusts the offset by the width of the current code point, either 1 or 2 chars.
200 void adjustOffsetByCodePoint();
202 void setLength(int32_t length
);
206 int32_t length() const;
208 char16_t charAt(int32_t index
) const;
210 UChar32
codePointAt(int32_t index
) const;
212 UnicodeString
toUnicodeString() const;
214 const UnicodeString
toTempUnicodeString() const;
217 * Returns the first code point in the string segment, or -1 if the string starts with an invalid
221 * <strong>Important:</strong> Most of the time, you should use {@link #matches}, which handles case
222 * folding logic, instead of this method.
224 UChar32
getCodePoint() const;
227 * Returns true if the first code point of this StringSegment equals the given code point.
230 * This method will perform case folding if case folding is enabled for the parser.
232 bool startsWith(UChar32 otherCp
) const;
235 * Returns true if the first code point of this StringSegment is in the given UnicodeSet.
237 bool startsWith(const UnicodeSet
& uniset
) const;
240 * Returns true if there is at least one code point of overlap between this StringSegment and the
241 * given UnicodeString.
243 bool startsWith(const UnicodeString
& other
) const;
246 * Returns the length of the prefix shared by this StringSegment and the given CharSequence. For
247 * example, if this string segment is "aab", and the char sequence is "aac", this method returns 2,
248 * since the first 2 characters are the same.
251 * This method only returns offsets along code point boundaries.
254 * This method will perform case folding if case folding was enabled in the constructor.
257 * IMPORTANT: The given UnicodeString must not be empty! It is the caller's responsibility to check.
259 int32_t getCommonPrefixLength(const UnicodeString
& other
);
262 * Like {@link #getCommonPrefixLength}, but never performs case folding, even if case folding is
263 * enabled for the parser.
265 int32_t getCaseSensitivePrefixLength(const UnicodeString
& other
);
267 bool operator==(const UnicodeString
& other
) const;
270 const UnicodeString
& fStr
;
275 int32_t getPrefixLengthInternal(const UnicodeString
& other
, bool foldCase
);
277 static bool codePointsEqual(UChar32 cp1
, UChar32 cp2
, bool foldCase
);
282 * The core interface implemented by all matchers used for number parsing.
284 * Given a string, there should NOT be more than one way to consume the string with the same matcher
285 * applied multiple times. If there is, the non-greedy parsing algorithm will be unhappy and may enter an
286 * exponential-time loop. For example, consider the "A Matcher" that accepts "any number of As". Given
287 * the string "AAAA", there are 2^N = 8 ways to apply the A Matcher to this string: you could have the A
288 * Matcher apply 4 times to each character; you could have it apply just once to all the characters; you
289 * could have it apply to the first 2 characters and the second 2 characters; and so on. A better version
290 * of the "A Matcher" would be for it to accept exactly one A, and allow the algorithm to run it
291 * repeatedly to consume a string of multiple As. The A Matcher can implement the Flexible interface
292 * below to signal that it can be applied multiple times in a row.
296 // Exported as U_I18N_API for tests
297 class U_I18N_API NumberParseMatcher
{
299 virtual ~NumberParseMatcher();
302 * Matchers can override this method to return true to indicate that they are optional and can be run
303 * repeatedly. Used by SeriesMatcher, primarily in the context of IgnorablesMatcher.
305 virtual bool isFlexible() const {
310 * Runs this matcher starting at the beginning of the given StringSegment. If this matcher finds
311 * something interesting in the StringSegment, it should update the offset of the StringSegment
312 * corresponding to how many chars were matched.
314 * This method is thread-safe.
317 * The StringSegment to match against. Matches always start at the beginning of the
318 * segment. The segment is guaranteed to contain at least one char.
320 * The data structure to store results if the match succeeds.
321 * @return Whether this matcher thinks there may be more interesting chars beyond the end of the
324 virtual bool match(StringSegment
& segment
, ParsedNumber
& result
, UErrorCode
& status
) const = 0;
327 * Performs a fast "smoke check" for whether or not this matcher could possibly match against the
328 * given string segment. The test should be as fast as possible but also as restrictive as possible.
329 * For example, matchers can maintain a UnicodeSet of all code points that count possibly start a
330 * match. Matchers should use the {@link StringSegment#startsWith} method in order to correctly
331 * handle case folding.
334 * The segment to check against.
335 * @return true if the matcher might be able to match against this segment; false if it definitely
336 * will not be able to match.
338 virtual bool smokeTest(const StringSegment
& segment
) const = 0;
341 * Method called at the end of a parse, after all matchers have failed to consume any more chars.
342 * Allows a matcher to make final modifications to the result given the knowledge that no more
343 * matches are possible.
346 * The data structure to store results.
348 virtual void postProcess(ParsedNumber
&) const {
349 // Default implementation: no-op
352 // String for debugging
353 virtual UnicodeString
toString() const = 0;
356 // No construction except by subclasses!
357 NumberParseMatcher() = default;
362 * Interface for use in arguments.
364 // Exported as U_I18N_API for tests
365 class U_I18N_API MutableMatcherCollection
{
367 virtual ~MutableMatcherCollection() = default;
369 virtual void addMatcher(NumberParseMatcher
& matcher
) = 0;
374 } // namespace numparse
377 #endif //__NUMPARSE_TYPES_H__
378 #endif /* #if !UCONFIG_NO_FORMATTING */