@trebco/treb 23.6.5 → 25.0.0-rc1

package/treb-calculator/src/functions/base-functions.ts

@@ -0,0 +1,1214 @@
+/*
+ * This file is part of TREB.
+ *
+ * TREB is free software: you can redistribute it and/or modify it under the 
+ * terms of the GNU General Public License as published by the Free Software 
+ * Foundation, either version 3 of the License, or (at your option) any 
+ * later version.
+ *
+ * TREB is distributed in the hope that it will be useful, but WITHOUT ANY 
+ * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS 
+ * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more 
+ * details.
+ *
+ * You should have received a copy of the GNU General Public License along 
+ * with TREB. If not, see <https://www.gnu.org/licenses/>. 
+ *
+ * Copyright 2022-2023 trebco, llc. 
+ * info@treb.app
+ * 
+ */
+
+import type { FunctionMap } from '../descriptors';
+import * as Utils from '../utilities';
+import { ReferenceError, NotImplError, NAError, ArgumentError, DivideByZeroError, ValueError } from '../function-error';
+import { Box, UnionValue, ValueType, GetValueType, 
+         RenderFunctionResult, RenderFunctionOptions, ComplexOrReal, Complex } from 'treb-base-types';
+import { Sparkline } from './sparkline';
+import { LotusDate, UnlotusDate } from 'treb-format';
+
+import { ClickCheckbox, RenderCheckbox } from './checkbox';
+import { UnionIsMetadata } from '../expression-calculator';
+
+import { Exp as ComplexExp, Power as ComplexPower, Multiply as ComplexMultply } from '../complex-math';
+
+/**
+ * BaseFunctionLibrary is a static object that has basic spreadsheet
+ * functions and associated metadata (there's also a list of aliases).
+ *
+ * Calculator should register this one first, followed by any other
+ * application-specific libraries.
+ *
+ * FIXME: there's no reason this has to be a single, monolithic library.
+ * we could split up by category or something.
+ *
+ * ALSO: add category to descriptor.
+ */
+
+/** milliseconds in one day, used in time functions */
+// const DAY_MS = 1000 * 60 * 60 * 24;
+
+// some functions have semantics that can't be represented inline,
+// or we may want to refer to them from other functions.
+
+// OK, just one.
+
+/** error function (for gaussian distribution) */
+const erf = (x: number): number => {
+
+  const a1 = 0.254829592;
+  const a2 = -0.284496736;
+  const a3 = 1.421413741;
+  const a4 = -1.453152027;
+  const a5 = 1.061405429;
+  const p = 0.3275911;
+
+  x = Math.abs(x);
+  const t = 1 / (1 + p * x);
+  return 1 - ((((((a5 * t + a4) * t) + a3) * t + a2) * t) + a1) * t * Math.exp(-1 * x * x);
+
+};
+
+const sqrt2pi = Math.sqrt(2 * Math.PI);
+
+/** imprecise but reasonably fast normsinv function */
+const inverse_normal = (q: number): number => {
+
+  if (q === 0.50) {
+    return 0;
+  }
+  
+  const p = (q < 1.0 && q > 0.5) ? (1 - q) : q;
+  const t = Math.sqrt(Math.log(1.0 / Math.pow(p, 2.0)));
+  const x = t - (2.515517 + 0.802853 * t + 0.010328 * Math.pow(t, 2.0)) /
+    (1.0 + 1.432788 * t + 0.189269 * Math.pow(t, 2.0) + 0.001308 * Math.pow(t, 3.0));
+
+  return (q > 0.5 ? x : -x);
+
+};
+
+/**
+ * alternate functions. these are used (atm) only for changing complex 
+ * behavior.
+ */
+export const AltFunctionLibrary: FunctionMap = {
+
+  Sqrt: {
+    description: 'Returns the square root of the argument',
+    arguments: [
+      {boxed: true},
+    ],
+    fn: Utils.ApplyAsArray((ref: UnionValue): UnionValue => {
+
+      if (ref.type === ValueType.complex) {
+        const value = ComplexPower(ref.value, {real: 0.5, imaginary: 0});
+        return ComplexOrReal(value);
+      }
+      else if (ref.type === ValueType.undefined || !ref.value) {
+        return {
+          type: ValueType.number, value: 0,
+        }
+      }
+      else if (ref.type === ValueType.number && ref.value < 0) {
+        const value = ComplexPower({real: ref.value, imaginary: 0}, {real: 0.5, imaginary: 0});
+        return {
+          type: ValueType.complex,
+          value,
+        }
+      }
+      else {
+        const value = Math.sqrt(ref.value);
+        if (isNaN(value)) {
+          return ValueError();
+        }
+        return { type: ValueType.number, value };
+      }
+    }),
+  },
+  
+  Power: {
+    description: 'Returns base raised to the given power',
+    arguments: [
+      { name: 'base', boxed: true, },
+      { name: 'exponent', boxed: true, }
+    ],
+    fn: Utils.ApplyAsArray2((base: UnionValue, exponent: UnionValue): UnionValue => {
+
+      // we're leaking complex numbers here because our functions are
+      // very slightly imprecise. I would like to stop doing that. try to
+      // use real math unless absolutely necessary.
+      
+      // in the alternative we could update the epsilon on our ComplexOrReal
+      // function, but I would prefer not to do that if we don't have to.
+
+      // so: if both arguments are real, and base is >= 0 we can use real math.
+      // also if exponent is either 0 or >= 1 we can use real math.
+
+      if (base.type === ValueType.number && exponent.type === ValueType.number) {
+        if (base.value >= 0 || exponent.value === 0 || Math.abs(exponent.value) >= 1) {
+          const value = Math.pow(base.value, exponent.value);
+          if (isNaN(value)) {
+            return ValueError();
+          }
+          return { type: ValueType.number, value };
+        }
+      }
+      
+      /*
+      if (base.type === ValueType.number) {
+        base = {
+          type: ValueType.complex,
+          value: { imaginary: 0, real: base.value },
+        };
+      }
+      */
+
+      const a = base.type === ValueType.complex ? base.value : 
+        { real: base.value || 0, imaginary: 0, };
+
+      const b = exponent.type === ValueType.complex ? exponent.value :
+        { real: exponent.value || 0, imaginary: 0, };
+
+      const value = ComplexPower(a, b);
+      return ComplexOrReal(value);
+
+    }),
+  },
+
+};
+
+// use a single, static object for base functions
+
+export const BaseFunctionLibrary: FunctionMap = {
+
+  Int: {
+    fn: (value: number) => {
+      return {type: ValueType.number, value: Math.floor(value) };
+    },
+  },
+
+  Rand: {
+    volatile: true,
+    fn: () => { return { type: ValueType.number, value: Math.random() }},
+  },
+
+  RandBetween: {
+    arguments: [{name: 'min'}, {name: 'max'}],
+    volatile: true,
+    fn: (min = 0, max = 1) => { 
+      if (min > max) { 
+        const tmp = min;
+        min = max;
+        max = tmp;
+      }
+      return { type: ValueType.number, value: Math.floor(Math.random() * (max + 1 - min) + min) }
+    },
+  },
+
+  Sum: {
+    description: 'Adds arguments and ranges',
+    arguments: [{ boxed: true, name: 'values or ranges' }],
+    fn: (...args: UnionValue[]) => {
+
+      const sum = { real: 0, imaginary: 0 };
+
+      const values = Utils.FlattenBoxed(args); // as UnionValue[];
+
+      for (const value of values) {
+
+        switch (value.type) {
+          case ValueType.number: sum.real += value.value; break;
+          case ValueType.boolean: sum.real += (value.value ? 1 : 0); break;
+          case ValueType.complex:
+            sum.real += value.value.real;
+            sum.imaginary += value.value.imaginary;
+            break;
+          case ValueType.error: return value;
+        }
+      }
+
+      return ComplexOrReal(sum);
+
+    },
+  },
+
+  Now: {
+    description: 'Returns current time',
+    volatile: true,
+    fn: () => {
+      return { type: ValueType.number, value: UnlotusDate(new Date().getTime()) };
+    },
+  },
+
+  Date: {
+    description: 'Constructs a Lotus date from parts',
+    arguments: [
+      { name: 'year' },
+      { name: 'month' },
+      { name: 'day' },
+    ],
+    fn: (year: number, month: number, day: number) => {
+      const date = new Date();
+      date.setMilliseconds(0);
+      date.setSeconds(0);
+      date.setMinutes(0);
+      date.setHours(0);
+      
+      if (year < 0 || year > 10000) { 
+        return ArgumentError();
+      }
+      if (year < 1899) { year += 1900; }
+      date.setFullYear(year);
+
+      if (month < 1 || month > 12) {
+        return ArgumentError();
+      }
+      date.setMonth(month - 1);
+
+      if (day < 1 || day > 31) {
+        return ArgumentError();
+      }
+      date.setDate(day);
+
+      return { type: ValueType.number, value: UnlotusDate(date.getTime()) };
+    },
+  },
+
+  Today: {
+    description: 'Returns current day',
+    volatile: true,
+    fn: () => {
+      const date = new Date();
+      date.setMilliseconds(0);
+      date.setSeconds(0);
+      date.setMinutes(0);
+      date.setHours(12);
+      return { type: ValueType.number, value: UnlotusDate(date.getTime()) };
+    },
+  },
+
+  IfError: {
+    description: 'Returns the original value, or the alternate value if the original value contains an error',
+    arguments: [{ name: 'original value', allow_error: true, boxed: true }, { name: 'alternate value' }],
+    fn: (ref: UnionValue, value_if_error: unknown = 0): UnionValue => {
+      if (ref && ref.type === ValueType.error) {
+        return { value: value_if_error, type: GetValueType(value_if_error) } as UnionValue;
+      }
+      return ref;
+    },
+  },
+
+  IsError: {
+    description: 'Checks if another cell contains an error',
+    arguments: [{ name: 'reference', allow_error: true, boxed: true }],
+    fn: (...args: UnionValue[]): UnionValue => {
+
+      const values = Utils.FlattenBoxed(args);
+      for (const value of values) {
+        if (value.type === ValueType.error) {
+          return { type: ValueType.boolean, value: true };
+        }
+      }
+
+      /*
+      if (Array.isArray(ref)) {
+        const values = Utils.Flatten(ref) as UnionValue[];
+        for (const value of values) {
+          if (value.type === ValueType.error) {
+            return { type: ValueType.boolean, value: true };
+          }
+        }
+      }
+      else if (ref) {
+        return { type: ValueType.boolean, value: ref.type === ValueType.error };
+      }
+      */
+
+      return { type: ValueType.boolean, value: false };
+
+    },
+  },
+
+
+    Cell: {
+      description: 'Returns data about a cell',
+      arguments: [
+        { name: 'type', description: 'Type of data to return' },
+        { name: 'reference', description: 'Cell reference', metadata: true },
+      ],
+
+      // there's no concept of "structure volatile", and structure events
+      // don't trigger recalc, so this is not helpful -- we may need to 
+      // think about both of those things
+      
+      // volatile: true, 
+
+      fn: Utils.ApplyAsArray2((type: string, reference: UnionValue): UnionValue => {
+
+        if (!UnionIsMetadata(reference)) {
+          return ReferenceError();
+        }
+
+        if (type) {
+          switch (type.toString().toLowerCase()) {
+            case 'format':
+              return reference.value.format ? // || ReferenceError;
+                { type: ValueType.string, value: reference.value.format } : ReferenceError();
+            case 'address':
+              return { type: ValueType.string, value: reference.value.address.label.replace(/\$/g, '') };
+          }
+        }
+
+        return { type: ValueType.error, value: NotImplError.error };
+
+      }),
+    },
+
+    Year: {
+      description: 'Returns year from date',
+      arguments: [{
+        name: 'date',
+      }],
+      fn: (source: number): UnionValue => {
+        return Box(new Date(LotusDate(source)).getUTCFullYear());
+      },
+    },
+
+
+    Month: {
+      description: 'Returns month from date',
+      arguments: [{
+        name: 'date',
+      }],
+      fn: (source: number): UnionValue => {
+        return Box(new Date(LotusDate(source)).getUTCMonth() + 1); // 0-based
+      },
+    },
+
+    
+    Day: {
+      description: 'Returns day of month from date',
+      arguments: [{
+        name: 'date',
+      }],
+      fn: (source: number): UnionValue => {
+        return Box(new Date(LotusDate(source)).getUTCDate());
+      },
+    },
+
+    Radians: {
+      description: 'Converts degrees to radians',
+      arguments: [{ name: 'Degrees', description: 'Angle in degrees' }],
+      fn: Utils.ApplyAsArray((degrees: number): UnionValue => {
+        return Box(degrees * Math.PI / 180);
+      }),
+    },
+
+    Degrees: {
+      description: 'Converts radians to degrees',
+      arguments: [{ name: 'Radians', description: 'Angle in radians' }],
+      fn: Utils.ApplyAsArray((radians: number): UnionValue => {
+        return Box(radians / Math.PI * 180);
+      }),
+    },
+
+    CountA: {
+      description: 'Counts cells that are not empty',
+      fn: (...args: unknown[]): UnionValue => {
+        return Box(Utils.FlattenUnboxed(args).reduce((a: number, b: unknown) => {
+          if (typeof b === 'undefined') return a;
+          return a + 1;
+        }, 0));
+      },
+    },
+
+    Count: {
+      description: 'Counts cells that contain numbers',
+      fn: (...args: unknown[]): UnionValue => {
+        return Box(Utils.FlattenUnboxed(args).reduce((a: number, b: unknown) => {
+          if (typeof b === 'number') return a + 1;
+          return a;
+        }, 0));
+      },
+    },
+
+    Or: {
+      fn: (...args: unknown[]): UnionValue => {
+        let result = false;
+        args = Utils.FlattenUnboxed(args);
+        for (const arg of args) {
+          result = result || !!arg;
+        }
+        return Box(result);
+      },
+    },
+
+    And: {
+      fn: (...args: unknown[]): UnionValue => {
+        let result = true;
+        args = Utils.FlattenUnboxed(args);
+        for (const arg of args) {
+          result = result && !!arg;
+        }
+        return Box(result);
+      },
+    },
+
+    Not: {
+      fn: (...args: unknown[]): UnionValue => {
+        if (args.length === 0) {
+          return ArgumentError();
+        }
+        if (args.length === 1) {
+          return Box(!args[0]);
+        }
+        return Box(true);
+      }
+    },
+
+    If: {
+      arguments: [
+        { name: 'test value', boxed: true },
+        { name: 'value if true', boxed: true, allow_error: true },
+        { name: 'value if false', boxed: true, allow_error: true },
+      ],
+
+      /**
+       * should we really have defaults for the t/f paths? not sure what X does
+       * @returns 
+       */
+      fn: (a: UnionValue, 
+           b: UnionValue = {type: ValueType.boolean, value: true}, 
+           c: UnionValue = {type: ValueType.boolean, value: false}): UnionValue => {
+
+        const b_array = b.type === ValueType.array;
+        const c_array = c.type === ValueType.array;
+
+        if (a.type === ValueType.array) {
+          return {
+            type: ValueType.array,
+            value: a.value.map((row, x) => row.map((cell, y) => {
+              const value = (cell.type === ValueType.string) ?
+                (cell.value.toLowerCase() !== 'false' && cell.value.toLowerCase() !== 'f') : !!cell.value;
+              return value ? (b_array ? b.value[x][y] : b) : (c_array ? c.value[x][y] : c);
+            })) as UnionValue[][],
+          };
+        }
+
+        const value = a.type === ValueType.string ? //  UnionIs.String(a) ? 
+          (a.value.toLowerCase() !== 'false' && a.value.toLowerCase() !== 'f') : !!a.value;
+
+        return value ? b : c;
+
+      },
+    },
+
+    Fact: {
+      description: 'Returns the factorial of a number',
+      arguments: [
+        { name: 'number' },
+      ],
+      fn: Utils.ApplyAsArray((number: number): UnionValue => {
+        number = Math.floor(number);
+        let value = 1;
+        while (number > 1) {
+          value *= number;
+          number--;
+        }
+        return {
+          type: ValueType.number,
+          value,
+        }
+      }),
+    },
+
+    Power: {
+      description: 'Returns base raised to the given power',
+      arguments: [
+        { name: 'base', boxed: true, },
+        { name: 'exponent', boxed: true, }
+      ],
+      fn: Utils.ApplyAsArray2((base: UnionValue, exponent: UnionValue): UnionValue => {
+
+        /*
+        if (base.type === ValueType.number) {
+          base = {
+            type: ValueType.complex,
+            value: { imaginary: 0, real: base.value },
+          };
+        }
+        */
+
+        if (base.type === ValueType.complex || exponent.type === ValueType.complex) {
+
+          const a = base.type === ValueType.complex ? base.value : 
+            { real: base.value || 0, imaginary: 0, };
+          const b = exponent.type === ValueType.complex ? exponent.value :
+            { real: exponent.value || 0, imaginary: 0, };
+
+          const value = ComplexPower(a, b);
+
+          return ComplexOrReal(value);
+
+        }
+        else {
+          const value = Math.pow(base.value, exponent.value);
+          if (isNaN(value)) {
+            return ValueError();
+          }
+          return { type: ValueType.number, value };
+          // return Box(Math.pow(base.value, exponent.value))
+        }
+
+      }),
+    },
+
+    Mod: {
+      fn: Utils.ApplyAsArray2((num: number, divisor: number): UnionValue => {
+        if (!divisor) { 
+          return DivideByZeroError();
+        }
+        return Box(num % divisor);
+      })
+    },
+
+    /**
+     * sort arguments, but ensure we return empty strings to
+     * fill up the result array
+     * 
+     * FIXME: instead of boxing all the values, why not pass them in boxed?
+     * was this function just written at the wrong time?
+     */
+    Sort: {
+      arguments: [
+        { name: 'values' }
+      ],
+      fn: (...args: any[]): UnionValue => {
+
+        args = Utils.FlattenUnboxed(args);
+
+        if(args.every(test => typeof test === 'number')) {
+          args.sort((a, b) => a - b);
+        }
+        else {
+          args.sort(); // lexical
+        }
+
+        return { type: ValueType.array, value: [args.map(value => Box(value))] };
+
+      },
+    },
+
+    Transpose: {
+      description: 'Returns transpose of input matrix',
+      arguments: [{name: 'matrix', boxed: true}],
+      fn: (mat: UnionValue): UnionValue => {
+
+        if (mat.type === ValueType.array) {
+          return {
+            type: ValueType.array,
+            value: Utils.Transpose2(mat.value),
+          };
+        }
+
+        /*
+        if (Array.isArray(mat)) {
+          return Utils.Transpose2(mat);
+        }
+        */
+
+        return mat;
+      } 
+    },
+
+    Max: {
+      fn: (...args: any[]): UnionValue => {
+        return { 
+          type: ValueType.number, 
+          value: Math.max.apply(0, Utils.FlattenUnboxed(args).filter(x => typeof x === 'number')),
+        };
+      },
+    },
+
+    Min: {
+      fn: (...args: any[]): UnionValue => {
+        return { 
+          type: ValueType.number, 
+          value: Math.min.apply(0, Utils.FlattenUnboxed(args).filter(x => typeof x === 'number')),
+        };
+      },
+    },
+
+
+    /*
+    MMult: {
+      description: 'Multiplies two matrices',
+      arguments: [{ name: 'Matrix 1'}, { name: 'Matrix 2'}],
+      fn: (a, b) => {
+        if (!a || !b) return ArgumentError;
+
+        const a_cols = a.length || 0;
+        const a_rows = a[0]?.length || 0;
+
+        const b_cols = b.length || 0;
+        const b_rows = b[0]?.length || 0;
+
+        if (!a_rows || !b_rows || !a_cols || !b_cols
+           || a_rows !== b_cols || a_cols !== b_rows) return ValueError;
+
+        const result: number[][] = [];
+
+        // slightly confusing because we're column-major
+
+        for (let c = 0; c < b_cols; c++) {
+          result[c] = [];
+          for (let r = 0; r < a_rows; r++) {
+            result[c][r] = 0;
+            for (let x = 0; x < a_cols; x++) {
+              result[c][r] += a[x][r] * b[c][x];
+            }
+          }
+        }
+        return result;
+
+      }
+    },
+    */
+
+    SumProduct: {
+      description: 'Returns the sum of pairwise products of two or more ranges',
+      fn: (...args: any[]): UnionValue  => {
+
+        const flattened = args.map(arg => Utils.FlattenUnboxed(arg));
+        const len = Math.max.apply(0, flattened.map(x => x.length));
+
+        let sum = 0;
+        for (let i = 0; i < len; i++) {
+          sum += flattened.reduce((a, arg) => {
+            return a * (arg[i] || 0);
+          }, 1);
+        }        
+
+        return { type: ValueType.number, value: sum };
+
+      },
+    },
+
+    /**
+     * 
+     * match type: 
+     * 
+     *  1: largest value <= target value; assumes table is in ascending order.
+     *  0: exact match only.
+     * -1: smallest value >= target value; assumes table is in descending order.
+     * 
+     * NOTE that string matches can accept wildcards in Excel, not sure if we 
+     * necessarily want to support that... how does string matching deal with
+     * inequalities?
+     * /
+    Match: {
+      fn: (value: CellValue, table: CellValue[][], match_type: 1|0|-1 = 1) => {
+
+        const flat = table.reduce((a, row) => ([...a, ...row]), []);
+        for (let i = 0; i < flat.length; i++) {
+
+          const compare = flat[i];
+
+          console.info("CV", compare, value);
+
+          // this is true regardless of match type... right?
+          if (compare === value) {
+            return { type: ValueType.number, value: i + 1 };
+          }
+ 
+          if ((typeof compare !== 'undefined' && typeof value !== 'undefined') && (
+              (match_type === 1 && compare > value) || 
+              (match_type === -1 && compare < value))) {
+
+            if (i === 0 || i === flat.length - 1) {
+              return NAError();
+            }
+
+            return { type: ValueType.number, value: i }; // implicit -1
+          }
+
+        }
+        return NAError();
+      },
+    },
+    */
+   
+    /**
+     * FIXME: does not implement inexact matching (what's the algo for
+     * that, anyway? nearest? price is right style? what about ties?)
+     */
+    VLookup: {
+      fn: (value: any, table: any[][], col: number, inexact = true): UnionValue => {
+
+        col = Math.max(0, col - 1);
+
+        if (inexact) {
+
+          let min = Math.abs(value - table[0][0]);
+          let result: any = table[col][0];
+
+          for (let i = 1; i < table[0].length; i++) {
+
+            const abs = Math.abs(table[0][i] - value);
+
+            if (abs < min) { // implies first match
+              min = abs;
+              result = table[col][i];
+            }
+          }
+
+          return Box(result);
+
+        }
+        else {
+          for (let i = 1; i < table[0].length; i++) {
+            if (table[0][i] == value) { // ==
+              return table[col][i];
+            }
+          }
+          return NAError();
+        }
+
+      },
+    },
+
+    Product: {
+      arguments: [{boxed: true}],
+      fn: (...args: any[]): UnionValue => {
+
+        let product: Complex = { real: 1, imaginary: 0 };
+
+        args = Utils.FlattenBoxed(args);
+
+        for (const arg of args as UnionValue[]) {
+          if (arg.type === ValueType.complex) {
+            product = ComplexMultply(product, arg.value);
+          }
+          else if (arg.type === ValueType.number) {
+            product.real *= arg.value;
+            product.imaginary *= arg.value;
+          }
+        }
+
+        return ComplexOrReal(product);
+
+        /*
+        return { type: ValueType.number, value: Utils.Flatten(args).reduce((a: number, b: any) => {
+          if (typeof b === 'undefined') return a;
+          return a * Number(b);
+        }, 1) };
+        */
+
+      },
+    },
+
+    Log: {
+      /** default is base 10; allow specific base */
+      fn: Utils.ApplyAsArray2((a: number, base = 10): UnionValue => {
+        return { type: ValueType.number, value: Math.log(a) / Math.log(base) };
+      }),
+    },
+
+    Log10: {
+      fn: Utils.ApplyAsArray((a: number): UnionValue => {
+        return { type: ValueType.number, value: Math.log(a) / Math.log(10) };
+      }),
+    },
+
+    Ln: {
+      fn: Utils.ApplyAsArray((a: number): UnionValue => {
+        return { type: ValueType.number, value: Math.log(a) };
+      }),
+    },
+
+    Round: {
+      fn: Utils.ApplyAsArray2((a, digits = 0) => {
+        const m = Math.pow(10, digits);
+        return { 
+          type: ValueType.number, 
+          value: Math.round(m * a) / m,
+        };
+      }),
+    },
+
+    RoundDown: {
+      fn: Utils.ApplyAsArray2((a, digits = 0) => {
+        const m = Math.pow(10, digits);
+        const positive = a >= 0;
+        return { 
+          type: ValueType.number, 
+          value: positive ? Math.floor(m * a) / m : Math.ceil(m * a) / m,
+        };
+      }),
+    },
+
+    /*
+
+    Round: {
+      description: 'Round to a specified number of digits',
+
+      / ** round with variable digits * /
+      fn: (value: number, digits = 0) => {
+        const m = Math.pow(10, digits);
+        return Math.round(m * value) / m;
+      },
+    },
+
+    RoundDown: {
+      / ** round down with variable digits * /
+      fn: (value: number, digits = 0) => {
+        digits = Math.max(0, digits);
+        const m = Math.pow(10, digits);
+        return Math.floor(m * value) / m;
+      },
+    },
+
+
+    */
+
+
+    Reverse: {
+      arguments: [
+        { boxed: true },
+      ],
+      fn: (a: UnionValue): UnionValue => {
+
+        /*
+
+        what is this? this would do anything useful
+        ...oh I see, it reverses along one axis or the other
+
+        if ( Array.isArray(a)) {
+          if (a.length === 1 ) return [a[0].reverse()];
+          return a.reverse();
+        }
+        */
+
+        if (a.type === ValueType.array) {
+          if (a.value.length === 1) {
+            a.value[0].reverse();
+          }
+          else {
+            a.value.reverse();
+          }
+          return a;
+        }
+
+        return { 
+          type: ValueType.string, 
+          value: a.value.toString().split('').reverse().join(''),
+        };
+      },
+    },
+    
+    /**
+     * exp was not broken out, but added so we can support complex numbers.
+     */
+    Exp: {
+      arguments: [
+        { boxed: true },
+      ],
+      fn: Utils.ApplyAsArray((x: UnionValue) => {
+        if (x.type === ValueType.complex) {
+          const value = ComplexExp(x.value);
+          return ComplexOrReal(value);
+        }
+        return { type: ValueType.number, value: Math.exp(x.value || 0) };
+      }),
+    },
+
+    /**
+     * abs was already broken out so we could support array application,
+     * then updated to support complex numbers.
+     */
+    Abs: {
+      arguments: [
+        { boxed: true },
+      ],
+      fn: Utils.ApplyAsArray((a: UnionValue) => {
+        if (a.type === ValueType.complex) {
+          return { 
+            type: ValueType.number, 
+            value: Math.sqrt(a.value.real * a.value.real + a.value.imaginary * a.value.imaginary), 
+          };
+        }
+        return { type: ValueType.number, value: Math.abs(a.value || 0) };
+      }),
+    },
+
+    Simplify: {
+      arguments: [
+        { name: 'value' }, 
+        { name: 'significant digits' },
+      ],
+      fn: Utils.ApplyAsArray2((value: number, significant_digits = 2): UnionValue => {
+        significant_digits = significant_digits || 2;
+        if (value === 0) {
+          return { type: ValueType.number, value };
+        }
+        const negative = value < 0 ? -1 : 1;
+        value *= negative;
+        const x = Math.pow(10, Math.floor(Math.log10(value)) + 1 - significant_digits);
+        return {
+          type: ValueType.number,
+          value: Math.round(value / x) * x * negative
+        };
+      }),
+    },
+ 
+    Erf: {
+      fn: (a: number): UnionValue => {
+        return { type: ValueType.number, value: erf(a) };
+      },
+    },
+
+    'NormsInv': {
+      
+      description: 'Inverse of the normal cumulative distribution', 
+      arguments: [
+        {name: 'probability'},
+      ],
+
+      fn: (q: number): UnionValue => {
+        return {
+          type: ValueType.number,
+          value: inverse_normal(q),
+        }
+      }
+    },
+
+    'Norm.Inv': {
+      description: 'Inverse of the normal cumulative distribution', 
+      arguments: [
+        {name: 'probability'},
+        {name: 'mean', default: 0},
+        {name: 'standard deviation', default: 1},
+      ],
+      xlfn: true,
+      fn: (q: number, mean = 0, stdev = 1): UnionValue => {
+        return {
+          type: ValueType.number,
+          value: inverse_normal(q) * stdev + mean,
+        }
+      }
+    },
+
+    'Norm.Dist': {
+
+      description: 'Cumulative normal distribution',
+      arguments: [
+        {name: 'value'},
+        {name: 'mean', default: 0},
+        {name: 'standard deviation', default: 1},
+        {name: 'cumulative', default: true},
+      ],
+
+      // this does need xlfn but it also requires four parameters
+      // (we have three and they are not required).
+      
+      xlfn: true,
+
+      fn: (x: number, mean = 0, stdev = 1, cumulative = true): UnionValue => {
+
+        let value = 0;
+
+        if (cumulative) {
+          const sign = (x < mean) ? -1 : 1;
+          value = 0.5 * (1.0 + sign * erf((Math.abs(x - mean)) / (stdev * Math.sqrt(2))));
+        }
+        else {
+          value = Math.exp(-1/2 * Math.pow((x - mean) / stdev, 2)) / (stdev * sqrt2pi);
+        }
+
+        return { 
+          type: ValueType.number, 
+          value,
+        };
+
+      },
+    },
+
+    Sqrt: {
+      description: 'Returns the square root of the argument',
+      arguments: [
+        {boxed: true},
+      ],
+      fn: Utils.ApplyAsArray((ref: UnionValue): UnionValue => {
+
+        // little bit torn on this. what should sqrt(-1) return? a complex 
+        // number, or NaN? or should we control that with a flag? 
+
+        // UPDATE: now optional, see AltFunctionLibrary
+
+        if (ref.type === ValueType.complex) {
+          const value = ComplexPower(ref.value, {real: 0.5, imaginary: 0});
+          return ComplexOrReal(value);
+        }
+        else if (ref.type === ValueType.undefined || !ref.value) {
+          return {
+            type: ValueType.number, value: 0,
+          }
+        }
+        /*
+        else if (ref.type === ValueType.number && ref.value < 0) {
+          const value = ComplexPower({real: ref.value, imaginary: 0}, {real: 0.5, imaginary: 0});
+          return {
+            type: ValueType.complex,
+            value,
+          }
+        }
+        */
+        else {
+          const value = Math.sqrt(ref.value);
+          if (isNaN(value)) {
+            return ValueError();
+          }
+          return { type: ValueType.number, value };
+        }
+      }),
+    },
+
+    HexToDec: {
+      arguments: [{ description: 'hexadecimal string' }],
+      fn: (hex: string): UnionValue => {
+        return { type: ValueType.number, value: parseInt(hex, 16) };
+      },
+    },
+
+    DecToHex: {
+      arguments: [{ description: 'number' }],
+      fn: (num: number): UnionValue => {
+        return { type: ValueType.string, value: num.toString(16) };
+      },
+    },
+
+    Checkbox: {
+      arguments: [
+        { name: 'checked' },
+      ],
+      click: ClickCheckbox,
+      render: RenderCheckbox,
+      fn: (checked: boolean): UnionValue => {
+        return { value: !!checked, type: ValueType.boolean, }
+      },
+    },
+
+    'Sparkline.Column': {
+      arguments: [
+        {name: 'data' }, 
+        {name: 'color'}, 
+        {name: 'negative color'}],
+      render: (options: RenderFunctionOptions): RenderFunctionResult => {
+        Sparkline.RenderColumn(options.width, options.height, options.context, options.cell, options.style);
+        return { handled: true }; // painted
+      },
+      fn: (...args: unknown[]): UnionValue => {
+        return { type: ValueType.object, value: args, key: 'sparkline-data' };
+      },
+    },
+
+    'Sparkline.Line': {
+      arguments: [
+        {name: 'data'}, 
+        {name: 'color'},
+        {name: 'line width'},
+      ],
+      render: (options: RenderFunctionOptions): RenderFunctionResult => {
+        Sparkline.RenderLine(options.width, options.height, options.context, options.cell, options.style);
+        return { handled: true }; // painted
+      },
+      fn: (...args: unknown[]): UnionValue => {
+        return { type: ValueType.object, value: args, key: 'sparkline-data' };
+      },
+    }
+
+};
+
+// alias
+
+// add functions from Math (intrinsic), unless the name overlaps
+// with something already in there
+
+// we need to construct a separate map to match icase (this is now
+// even more useful since we have a separate section for aliases)
+
+const name_map: {[index: string]: string} = {};
+
+for (const key of Object.keys(BaseFunctionLibrary)) {
+  name_map[key.toLowerCase()] = key;
+}
+
+// block these names from auto-import from Math
+
+const block_list = [
+  'pow', 
+];
+
+const block_map: Record<string, string> = {};
+for (const entry of block_list) {
+  block_map[entry.toLowerCase()] = entry;
+}
+
+for (const name of Object.getOwnPropertyNames(Math)) {
+
+  // check if it exists (we have already registered something
+  // with the same name) -- don't override existing
+
+  const lc = name.toLowerCase();
+
+  if (name_map[lc]) { continue; }
+
+  // also explicitly block some names we don't want to include (pow vs. power, etc)
+
+  if (block_map[lc]) { continue; }
+
+  const descriptor = Object.getOwnPropertyDescriptor(Math, name);
+  if (!descriptor) { continue; }
+
+  const value = descriptor.value;
+  const type = typeof (value);
+
+  switch (type) {
+  case 'number':
+    // console.info("MATH CONSTANT", name);
+    BaseFunctionLibrary[name] = {
+      fn: () => { 
+        return { type: ValueType.number, value }
+      },
+      category: ['Math Functions'],
+    };
+    break;
+
+  case 'function':
+    // console.info("MATH FUNC", name);
+    BaseFunctionLibrary[name] = {
+      fn: (...args: any) => {
+        return Box(value(...args));
+      },
+      category: ['Math Functions'],
+    };
+    break;
+
+  default:
+    console.info('unexpected type:', type, name);
+    break;
+  }
+
+}
+
+// IE11: patch log10 function // FIXME: is this necessary anymore?
+
+if (!Math.log10) {
+  Math.log10 = (a) => Math.log(a) / Math.log(10);
+  /*
+  BaseFunctionLibrary.log10 = {
+    fn: (x) => Math.log(x) / Math.log(10),
+    category: ['Math Functions'],
+  };
+  */
+}