1 files changed, 75 insertions, 0 deletions
diff --git a/ka/ka.go b/ka/ka.go
index 2fd3e013..6caf8d55 100644
--- a/ka/ka.go
+++ b/ka/ka.go
@@ -251,3 +251,78 @@ func (ka *ka) FmtCurrency(num float64, v uint64, currency currency.Type) []byte
 
 	return b
 }
+
+// FmtAccounting returns the currency representation of 'num' with digits/precision of 'v' for 'ka'
+// in accounting notation. returned as a []byte just in case the caller wishes to add more and can help
+// avoid allocations; otherwise just cast as string.
+func (ka *ka) FmtAccounting(num float64, v uint64, currency currency.Type) []byte {
+
+	s := strconv.FormatFloat(math.Abs(num), 'f', int(v), 64)
+	symbol := ka.currencies[currency]
+	l := len(s) + len(ka.decimal) + len(ka.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] == '.' {
+			b = append(b, ka.decimal[0])
+			inWhole = true
+
+			continue
+		}
+
+		if inWhole {
+			if count == 3 {
+				for j := len(ka.group) - 1; j >= 0; j-- {
+					b = append(b, ka.group[j])
+				}
+
+				count = 1
+			} else {
+				count++
+			}
+		}
+
+		b = append(b, s[i])
+	}
+
+	if num < 0 {
+
+		b = append(b, ka.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]
+	}
+
+	if int(v) < 2 {
+
+		if v == 0 {
+			b = append(b, ka.decimal...)
+		}
+
+		for i := 0; i < 2-int(v); i++ {
+			b = append(b, '0')
+		}
+	}
+
+	if num < 0 {
+
+		b = append(b, ka.currencyNegativeSuffix...)
+
+		b = append(b, symbol...)
+
+	} else {
+
+		b = append(b, ka.currencyPositiveSuffix...)
+
+		b = append(b, symbol...)
+
+	}
+
+	return b
+}