Merge branch 'bugs' (amended: Fix math examples)

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Author: ako

mdl-examples/doctype-tests/04-math-examples.mdl

@@ -67,7 +67,7 @@ BEGIN
   BEGIN
     -- Test if current divisor divides the number evenly
     IF $Number mod $Divisor = 0 THEN
-      LOG INFO NODE 'Math' 'Found divisor: {1}, not prime' WITH ({1} = $Divisor);
+      LOG INFO NODE 'Math' 'Found divisor: {1}, not prime' WITH ({1} = toString($Divisor));
       SET $IsPrime = false;
     END IF;
 
@@ -76,7 +76,7 @@ BEGIN
   END WHILE;
 
   IF $IsPrime THEN
-    LOG INFO NODE 'Math' 'Number {1} is prime' WITH ({1} = $Number);
+    LOG INFO NODE 'Math' 'Number {1} is prime' WITH ({1} = toString($Number));
   END IF;
 
   RETURN $IsPrime;
@@ -127,15 +127,15 @@ BEGIN
   DECLARE $Previous1 Long = 1;
   DECLARE $Current Long = 0;
   DECLARE $Counter Integer = 2;
-  LOG INFO NODE 'Math' 'Calculating Fibonacci({1})' WITH ({1} = $N);
+  LOG INFO NODE 'Math' 'Calculating Fibonacci({1})' WITH ({1} = toString($N));
 
   -- Main iteration loop: Calculate F(2) through F(N)
   -- Uses sliding window: shift values after each calculation
   WHILE $Counter <= $N
   BEGIN
     -- Calculate current Fibonacci number using recurrence relation
     SET $Current = $Previous1 + $Previous2;
-    LOG DEBUG NODE 'Math' 'F({1}) = {2}' WITH ({1} = $Counter, {2} = $Current);
+    LOG DEBUG NODE 'Math' 'F({1}) = {2}' WITH ({1} = toString($Counter), {2} = toString($Current));
 
     -- Slide the window: shift values for next iteration
     SET $Previous2 = $Previous1;
@@ -145,7 +145,7 @@ BEGIN
 
   -- Store final result and return
   SET $Result = $Current;
-  LOG INFO NODE 'Math' 'Fibonacci({1}) = {2}' WITH ({1} = $N, {2} = $Result);
+  LOG INFO NODE 'Math' 'Fibonacci({1}) = {2}' WITH ({1} = toString($N), {2} = toString($Result));
   RETURN $Result;
 END;
 /