1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
// © 2018 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
#include "unicode/utypes.h"
#if !UCONFIG_NO_FORMATTING
#ifndef __SOURCE_NUMPARSE_COMPOSITIONS__
#define __SOURCE_NUMPARSE_COMPOSITIONS__
#include "numparse_types.h"
U_NAMESPACE_BEGIN
// Export an explicit template instantiation of the MaybeStackArray that is used as a data member of ArraySeriesMatcher.
// When building DLLs for Windows this is required even though no direct access to the MaybeStackArray leaks out of the i18n library.
// (See digitlst.h, pluralaffix.h, datefmt.h, and others for similar examples.)
#if U_PF_WINDOWS <= U_PLATFORM && U_PLATFORM <= U_PF_CYGWIN
template class U_I18N_API MaybeStackArray<const numparse::impl::NumberParseMatcher*, 3>;
#endif
namespace numparse::impl {
/**
* Base class for AnyMatcher and SeriesMatcher.
*/
// Exported as U_I18N_API for tests
class U_I18N_API CompositionMatcher : public NumberParseMatcher {
protected:
// No construction except by subclasses!
CompositionMatcher() = default;
// To be overridden by subclasses (used for iteration):
virtual const NumberParseMatcher* const* begin() const = 0;
// To be overridden by subclasses (used for iteration):
virtual const NumberParseMatcher* const* end() const = 0;
};
// NOTE: AnyMatcher is no longer being used. The previous definition is shown below.
// The implementation can be found in SVN source control, deleted around March 30, 2018.
///**
// * Composes a number of matchers, and succeeds if any of the matchers succeed. Always greedily chooses
// * the first matcher in the list to succeed.
// *
// * NOTE: In C++, this is a base class, unlike ICU4J, which uses a factory-style interface.
// *
// * @author sffc
// * @see SeriesMatcher
// */
//class AnyMatcher : public CompositionMatcher {
// public:
// bool match(StringSegment& segment, ParsedNumber& result, UErrorCode& status) const override;
//
// bool smokeTest(const StringSegment& segment) const override;
//
// void postProcess(ParsedNumber& result) const override;
//
// protected:
// // No construction except by subclasses!
// AnyMatcher() = default;
//};
/**
* Composes a number of matchers, running one after another. Matches the input string only if all of the
* matchers in the series succeed. Performs greedy matches within the context of the series.
*
* @author sffc
* @see AnyMatcher
*/
// Exported as U_I18N_API for tests
class U_I18N_API SeriesMatcher : public CompositionMatcher {
public:
bool match(StringSegment& segment, ParsedNumber& result, UErrorCode& status) const override;
bool smokeTest(const StringSegment& segment) const override;
void postProcess(ParsedNumber& result) const override;
virtual int32_t length() const = 0;
protected:
// No construction except by subclasses!
SeriesMatcher() = default;
};
/**
* An implementation of SeriesMatcher that references an array of matchers.
*
* The object adopts the array, but NOT the matchers contained inside the array.
*/
// Exported as U_I18N_API for tests
class U_I18N_API ArraySeriesMatcher : public SeriesMatcher {
public:
ArraySeriesMatcher(); // WARNING: Leaves the object in an unusable state
typedef MaybeStackArray<const NumberParseMatcher*, 3> MatcherArray;
/** The array is std::move'd */
ArraySeriesMatcher(MatcherArray& matchers, int32_t matchersLen);
UnicodeString toString() const override;
int32_t length() const override;
protected:
const NumberParseMatcher* const* begin() const override;
const NumberParseMatcher* const* end() const override;
private:
MatcherArray fMatchers;
int32_t fMatchersLen;
};
} // namespace numparse::impl
U_NAMESPACE_END
#endif //__SOURCE_NUMPARSE_COMPOSITIONS__
#endif /* #if !UCONFIG_NO_FORMATTING */
|
