Index: source/i18n/nfrs.cpp |
diff --git a/source/i18n/nfrs.cpp b/source/i18n/nfrs.cpp |
index 6cc0c6381889a8fcca0a3924eed0efcabfdbc632..1a4bf493f3eb7ef83cd1ab8a601884a69c890044 100644 |
--- a/source/i18n/nfrs.cpp |
+++ b/source/i18n/nfrs.cpp |
@@ -1,6 +1,6 @@ |
/* |
****************************************************************************** |
-* Copyright (C) 1997-2012, International Business Machines |
+* Copyright (C) 1997-2014, International Business Machines |
* Corporation and others. All Rights Reserved. |
****************************************************************************** |
* file name: nfrs.cpp |
@@ -335,7 +335,7 @@ NFRuleSet::operator==(const NFRuleSet& rhs) const |
#define RECURSION_LIMIT 50 |
void |
-NFRuleSet::format(int64_t number, UnicodeString& toAppendTo, int32_t pos) const |
+NFRuleSet::format(int64_t number, UnicodeString& toAppendTo, int32_t pos, UErrorCode& status) const |
{ |
NFRule *rule = findNormalRule(number); |
if (rule) { // else error, but can't report it |
@@ -344,14 +344,14 @@ NFRuleSet::format(int64_t number, UnicodeString& toAppendTo, int32_t pos) const |
// stop recursion |
ncThis->fRecursionCount = 0; |
} else { |
- rule->doFormat(number, toAppendTo, pos); |
+ rule->doFormat(number, toAppendTo, pos, status); |
ncThis->fRecursionCount--; |
} |
} |
} |
void |
-NFRuleSet::format(double number, UnicodeString& toAppendTo, int32_t pos) const |
+NFRuleSet::format(double number, UnicodeString& toAppendTo, int32_t pos, UErrorCode& status) const |
{ |
NFRule *rule = findDoubleRule(number); |
if (rule) { // else error, but can't report it |
@@ -360,7 +360,7 @@ NFRuleSet::format(double number, UnicodeString& toAppendTo, int32_t pos) const |
// stop recursion |
ncThis->fRecursionCount = 0; |
} else { |
- rule->doFormat(number, toAppendTo, pos); |
+ rule->doFormat(number, toAppendTo, pos, status); |
ncThis->fRecursionCount--; |
} |
} |