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
|
// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
******************************************************************************
* Copyright (C) 1997-2015, International Business Machines
* Corporation and others. All Rights Reserved.
******************************************************************************
* file name: nfrs.h
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* Modification history
* Date Name Comments
* 10/11/2001 Doug Ported from ICU4J
*/
#ifndef NFRS_H
#define NFRS_H
#include "unicode/uobject.h"
#include "unicode/rbnf.h"
#if U_HAVE_RBNF
#include "unicode/utypes.h"
#include "unicode/umisc.h"
#include "nfrlist.h"
U_NAMESPACE_BEGIN
class NFRuleSet : public UMemory {
public:
NFRuleSet(RuleBasedNumberFormat *owner, UnicodeString* descriptions, int32_t index, UErrorCode& status);
void parseRules(UnicodeString& rules, UErrorCode& status);
void setNonNumericalRule(NFRule *rule);
void setBestFractionRule(int32_t originalIndex, NFRule *newRule, UBool rememberRule);
void makeIntoFractionRuleSet() { fIsFractionRuleSet = true; }
~NFRuleSet();
bool operator==(const NFRuleSet& rhs) const;
bool operator!=(const NFRuleSet& rhs) const { return !operator==(rhs); }
UBool isPublic() const { return fIsPublic; }
UBool isParseable() const { return fIsParseable; }
UBool isFractionRuleSet() const { return fIsFractionRuleSet; }
void getName(UnicodeString& result) const { result.setTo(name); }
UBool isNamed(const UnicodeString& _name) const { return this->name == _name; }
void format(int64_t number, UnicodeString& toAppendTo, int32_t pos, int32_t recursionCount, UErrorCode& status) const;
void format(double number, UnicodeString& toAppendTo, int32_t pos, int32_t recursionCount, UErrorCode& status) const;
UBool parse(const UnicodeString& text, ParsePosition& pos, double upperBound, uint32_t nonNumericalExecutedRuleMask, int32_t recursionCount, Formattable& result) const;
void appendRules(UnicodeString& result) const; // toString
void setDecimalFormatSymbols(const DecimalFormatSymbols &newSymbols, UErrorCode& status);
const RuleBasedNumberFormat *getOwner() const { return owner; }
private:
const NFRule * findNormalRule(int64_t number) const;
const NFRule * findDoubleRule(double number) const;
const NFRule * findFractionRuleSetRule(double number) const;
friend class NFSubstitution;
private:
UnicodeString name;
NFRuleList rules;
NFRule *nonNumericalRules[6];
RuleBasedNumberFormat *owner;
NFRuleList fractionRules;
UBool fIsFractionRuleSet;
UBool fIsPublic;
UBool fIsParseable;
NFRuleSet(const NFRuleSet &other); // forbid copying of this class
NFRuleSet &operator=(const NFRuleSet &other); // forbid copying of this class
};
// utilities from old llong.h
// convert mantissa portion of double to int64
int64_t util64_fromDouble(double d);
// raise radix to the power exponent, only non-negative exponents
// Arithmetic is performed in unsigned space since overflow in
// signed space is undefined behavior.
uint64_t util64_pow(uint32_t radix, uint16_t exponent);
// convert n to digit string in buffer, return length of string
uint32_t util64_tou(int64_t n, char16_t* buffer, uint32_t buflen, uint32_t radix = 10, UBool raw = false);
#ifdef RBNF_DEBUG
int64_t util64_utoi(const char16_t* str, uint32_t radix = 10);
uint32_t util64_toa(int64_t n, char* buffer, uint32_t buflen, uint32_t radix = 10, UBool raw = false);
int64_t util64_atoi(const char* str, uint32_t radix);
#endif
U_NAMESPACE_END
/* U_HAVE_RBNF */
#endif
// NFRS_H
#endif
|
