porffor 0.49.5 → 0.49.7

package/README.md

@@ -42,7 +42,7 @@ Expect nothing to work! Only very limited JS is currently supported. See files i
 > [!WARNING]
 > Very experimental WIP feature!
 
-**`porf profile path/to/script.js`**
+**`porf hotlines path/to/script.js`**
 
 ### Debugging a JS file
 > [!WARNING]
@@ -54,7 +54,7 @@ Expect nothing to work! Only very limited JS is currently supported. See files i
 > [!WARNING]
 > Very experimental WIP feature!
 
-**`porf debug-wasm path/to/script.js`**
+**`porf dissect path/to/script.js`**
 
 
 ### Options
@@ -80,7 +80,7 @@ Asur is Porffor's own Wasm engine; it is an intentionally simple interpreter wri
 Rhemyn is Porffor's own regex engine; it compiles literal regex to Wasm bytecode AOT (remind you of anything?). It is quite basic and WIP. See [its readme](rhemyn/README.md) for more details.
 
 ### 2c
-2c is Porffor's own Wasm -> C compiler, using generated Wasm bytecode and internal info to generate specific and efficient/fast C code. Little boilerplate/preluded code or required external files, just for CLI binaries (not like wasm2c very much).
+2c is Porffor's own Wasm -> C compiler, using generated Wasm bytecode and internal info to generate specific and efficient C code. Little boilerplate/preluded code or required external files, just for CLI binaries (not like wasm2c very much).
 
 ## Versioning
 Porffor uses a unique versioning system, here's an example: `0.48.7`. Let's break it down:

package/compiler/builtins/console.ts

@@ -86,7 +86,7 @@ export const __Porffor_miniLog = (arg: any) => {
   Porffor.printStatic('\n');
 };
 
-export const __Porffor_print = (arg: any, colors: boolean = true) => {
+export const __Porffor_print = (arg: any, colors: boolean = true, depth: number = 0) => {
   // todo: Symbol.toStringTag could reduce duplication here
 
   // note: this doesn't have access to the upper scope!! do not use any variables from up there
@@ -154,21 +154,23 @@ export const __Porffor_print = (arg: any, colors: boolean = true) => {
           return;
         }
 
-        Porffor.printStatic('{ ');
+        Porffor.printStatic('{\n');
         const len: i32 = keys.length - 1;
         for (let i: i32 = 0; i <= len; i++) {
           const x: any = keys[i];
 
-          Porffor.printStatic('  ');
+          for (let j: i32 = 0; j <= depth; j++) Porffor.printStatic('  ');
           __Porffor_printString(x);
 
           Porffor.printStatic(': ');
-          __Porffor_print(Porffor.object.get(arg, ecma262.ToPropertyKey(x)));
+          __Porffor_print(Porffor.object.get(arg, ecma262.ToPropertyKey(x)), colors, depth + 1);
 
           if (i != len) Porffor.printStatic(',\n');
         }
 
-        Porffor.printStatic(' }');
+        Porffor.printStatic('\n');
+        for (let j: i32 = 0; j < depth; j++) Porffor.printStatic('  ');
+        Porffor.printStatic('}');
       } else {
         if (colors) Porffor.printStatic('\x1b[1m'); // bold
         Porffor.printStatic('null');
@@ -295,7 +297,7 @@ export const __Porffor_print = (arg: any, colors: boolean = true) => {
 
       for (let i: i32 = 0; i < mapLen; i++) {
         const key: any = map[i];
-        __Porffor_print(key);
+        __Porffor_print(key, colors);
         Porffor.printStatic(' => ');
         __Porffor_print(__Map_prototype_get(arg, key), colors);
         if (i != mapLen) Porffor.printStatic(', ');

package/compiler/builtins/math.ts

@@ -76,18 +76,38 @@ export const __Math_log = (y: number): number => {
   }
   if (!Number.isFinite(y)) return y;
 
-  // guess using log knowledge
-  let x: number = y > 1 ? Math.log2(y) : 0;
+  // very large numbers
+  if (y > 1e308) {
+    const n = Math.floor(Math.log2(y));
+    return Math.LN2 * n + Math.log(y / (1 << 30) / (1 << (n - 30)));
+  }
 
-  // refine with Newton-Raphson method
-  let delta: number;
-  do {
-    const e_x: number = Math.exp(x);
-    delta = (e_x - y) / e_x;
-    x -= delta;
-  } while (Math.abs(delta) > 1e-15);
+  let m = 0;
+  while (y >= 2) {
+    y /= 2;
+    m++;
+  }
+  while (y < 1) {
+    y *= 2;
+    m--;
+  }
 
-  return x;
+  y--;  // 1 <= y < 2 -> 0 <= y < 1
+
+  // more accurate series expansion
+  let x = y / (2 + y);
+  const x2 = x * x;
+  let sum = x;
+  let term = x;
+  let i = 1;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= x2 * (2 * i - 1) / (2 * i + 1);
+    sum += term;
+    i++;
+  }
+
+  return 2 * sum + m * Math.LN2;
 };
 
 export const __Math_log10 = (x: number): number => {
@@ -206,7 +226,25 @@ export const __Math_pow = (base: number, exponent: number): number => {
   if (base < 0) if (!Number.isInteger(exponent)) return NaN;
 
   // 13. Return an implementation-approximated Number value representing the result of raising ℝ(base) to the ℝ(exponent) power.
-  return Math.exp(exponent * Math.log(base));
+  let currentBase: number = base;
+  let currentExponent: number = Math.abs(exponent);
+
+  let result: number = 1;
+  while (currentExponent > 0) {
+    if (currentExponent >= 1) {
+      if (currentExponent % 2 != 0) {
+        result *= currentBase;
+      }
+      currentBase *= currentBase;
+      currentExponent = Math.floor(currentExponent / 2);
+    } else {
+      // Handle fractional part
+      result *= Math.exp(currentExponent * Math.log(Math.abs(currentBase)));
+      break;
+    }
+  }
+
+  return exponent < 0 ? 1 / result : result;
 };