From 5d67fac7966b6f05611d014420eb4971b8016c31 Mon Sep 17 00:00:00 2001
From: "Kartik K. Agaram" <vc@akkartik.com>
Date: Thu, 11 Feb 2016 16:13:10 -0800
Subject: 2646 - redo static dispatch algorithm

The old approach of ad hoc boosts and penalties based on various
features was repeatedly running into exceptions and bugs. New
organization: multiple tiered scores interleaved with tie-breaks. The
moment one tier yields one or more candidates, we stop scanning further
tiers. Just break ties and return.
---
 070text.mu | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

(limited to '070text.mu')

diff --git a/070text.mu b/070text.mu
index 56291b75..a37e8a6e 100644
--- a/070text.mu
+++ b/070text.mu
@@ -297,7 +297,8 @@ recipe to-text n:number -> result:address:shared:array:character [
   # add sign
   {
     break-unless negate-result:boolean
-    tmp <- append tmp, 45  # '-'
+    minus:character <- copy 45/-
+    tmp <- append tmp, minus
   }
   # reverse buffer into text result
   len:number <- get *tmp, length:offset
-- 
cgit 1.4.1-2-gfad0