From 3ecf79ee089d9c2393965dd48451df6f608991db Mon Sep 17 00:00:00 2001
From: Ansgar Becker <ansgarbecker@users.noreply.github.com>
Date: Sun, 18 Dec 2011 09:51:49 +0000
Subject: [PATCH] Fix broken sorting logic for positive small numbers, broken
 in r3987.

---
 source/helpers.pas | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/source/helpers.pas b/source/helpers.pas
index e2135d7d..9ff1df79 100644
--- a/source/helpers.pas
+++ b/source/helpers.pas
@@ -2430,10 +2430,18 @@ end;
 function CompareAnyNode(Text1, Text2: String): Integer;
 var
   Number1, Number2 : Extended;
+  a1, a2, b1, b2: Char;
+const
+  Numbers = ['0'..'9'];
 begin
   Result := 0;
   // Apply different comparisons for numbers and text
-  if (StrToIntDef(Copy(Text1, 0, 2), 100) <> 100) and (StrToIntDef(Copy(Text2, 0, 2), 100) <> 100) then begin
+  a1 := Text1[1];
+  a2 := Text1[2];
+  b1 := Text2[1];
+  b2 := Text2[2];
+  if ((a1='-') and (CharInSet(a2, Numbers)) or CharInSet(a1, Numbers))
+    and ((b1='-') and (CharInSet(b2, Numbers)) or CharInSet(b1, Numbers)) then begin
     // Assuming numeric values
     Number1 := MakeFloat(Text1);
     Number2 := MakeFloat(Text2);