diff options
author | joeybloggs <Dean.Karn@gmail.com> | 2016-08-13 05:03:24 +0300 |
---|---|---|
committer | joeybloggs <Dean.Karn@gmail.com> | 2016-08-13 05:03:24 +0300 |
commit | 99657750cc781e41c9c1e3be6b6316c18fc430bd (patch) | |
tree | 3366a7d2a645600dbe8efbadc86874f94c1cedb5 /az_Latn_AZ | |
parent | 7639a439740dfc3cdda4ae188bf3baf7cc2ff7a3 (diff) |
ad variable grouping logic + cleanup generated code newlines
Diffstat (limited to 'az_Latn_AZ')
-rw-r--r-- | az_Latn_AZ/az_Latn_AZ.go | 25 |
1 files changed, 8 insertions, 17 deletions
diff --git a/az_Latn_AZ/az_Latn_AZ.go b/az_Latn_AZ/az_Latn_AZ.go index 5e6fdd1a..975e8eb5 100644 --- a/az_Latn_AZ/az_Latn_AZ.go +++ b/az_Latn_AZ/az_Latn_AZ.go @@ -66,9 +66,9 @@ func (az *az_Latn_AZ) OrdinalPluralRule(num float64, v uint64) locales.PluralRul n := math.Abs(num) i := int64(n) - iMod1000 := i % 1000 iMod10 := i % 10 iMod100 := i % 100 + iMod1000 := i % 1000 if (iMod10 == 1 || iMod10 == 2 || iMod10 == 5 || iMod10 == 7 || iMod10 == 8) || (iMod100 == 20 || iMod100 == 50 || iMod100 == 70 || iMod100 == 80) { return locales.PluralRuleOne @@ -102,36 +102,24 @@ func (az *az_Latn_AZ) RangePluralRule(num1 float64, v1 uint64, num2 float64, v2 // avoid allocations; otherwise just cast as string. func (az *az_Latn_AZ) FmtNumber(num float64, v uint64) []byte { - s := strconv.FormatFloat(num, 'f', int(v), 64) - + s := strconv.FormatFloat(math.Abs(num), 'f', int(v), 64) l := len(s) + len(az.decimal) + len(az.group)*len(s[:len(s)-int(v)-1])/3 - count := 0 inWhole := v == 0 - b := make([]byte, 0, l) for i := len(s) - 1; i >= 0; i-- { if s[i] == '.' { - - for j := len(az.decimal) - 1; j >= 0; j-- { - b = append(b, az.decimal[j]) - } - + b = append(b, az.decimal[0]) inWhole = true continue } if inWhole { - if count == 3 { - - for j := len(az.group) - 1; j >= 0; j-- { - b = append(b, az.group[j]) - } - + b = append(b, az.group[0]) count = 1 } else { count++ @@ -141,11 +129,14 @@ func (az *az_Latn_AZ) FmtNumber(num float64, v uint64) []byte { b = append(b, s[i]) } + if num < 0 { + b = append(b, az.minus[0]) + } + // reverse for i, j := 0, len(b)-1; i < j; i, j = i+1, j-1 { b[i], b[j] = b[j], b[i] } return b - } |