git.scottworley.com Git - inverse-tax/blob - tax.js

   1 "use strict";
   2
   3 function parse_table(as_text) {
   4   function parse_line(line) {
   5     return line.trim().split(' ').filter(x => x !== '').map(x => parseFloat(x));
   6   }
   7   return as_text.trim().split('\n').map(parse_line);
   8 }
   9
  10 function parse_tax_table(as_text) {
  11   return parse_table(as_text).map(([start, rate], i, table) =>
  12     [start, i < table.length - 1 ? table[i+1][0] : Infinity, rate / 100.0]);
  13 }
  14
  15 function sum(nums) {
  16   return nums.reduce((total, num) => total + num, 0);
  17 }
  18
  19 function tax(table, income) {
  20   return sum(table.map(([start, end, rate]) =>
  21     Math.max(0, Math.min(income, end) - start) * rate));
  22 }
  23
  24 function apply_deductible(table, deductible) {
  25   return table.map(([start, end, rate]) => [start + deductible, end + deductible, rate]);
  26 }
  27
  28 function merge_tax_tables(t1, t2) {
  29   if (t1.length == 0) return t2;
  30   if (t2.length == 0) return t1;
  31   const [start1, end1, rate1] = t1[0];
  32   const [start2, end2, rate2] = t2[0];
  33   if (start1 == start2) {
  34     if (end1 == end2) {
  35       return [[start1, end1, rate1 + rate2]].concat(merge_tax_tables(t1.slice(1), t2.slice(1)));
  36     }
  37     if (end1 < end2) {
  38       return [[start1, end1, rate1 + rate2]].concat(merge_tax_tables(t1.slice(1), [[end1, end2, rate2]].concat(t2.slice(1))));
  39     }
  40     return merge_tax_tables(t2, t1);
  41   }
  42   if (start1 < start2) {
  43     if (end1 <= start2) {
  44       return [t1[0]].concat(merge_tax_tables(t1.slice(1), t2));
  45     }
  46     return [[start1, start2, rate1]].concat(merge_tax_tables([[start2, end1, rate1]].concat(t1.slice(1)), t2));
  47   }
  48   return merge_tax_tables(t2, t1);
  49 }
  50
  51 function invert(table) {
  52   // Here we solve
  53   //   net = m * gross + b
  54   // for gross:
  55   //   net - b = m * gross
  56   //   (net - b) / m = gross
  57   // and the calculate the inverse's bounds
  58
  59   const ms = table.map(([start, end, rate]) => 1 - rate);
  60   const full_brackets = [[0]].concat(table.map(([start, end, rate]) => (end - start) * rate)).slice(0, table.length);
  61   function sum_lower_brackets(remaining_brackets, acc = 0) {
  62     if (remaining_brackets.length == 0) return [];
  63     return [acc + remaining_brackets[0]].concat(sum_lower_brackets(remaining_brackets.slice(1), acc + remaining_brackets[0]));
  64   }
  65   const bs = sum_lower_brackets(full_brackets).map((lower_brackets, i) => {
  66     const [start, end, rate] = table[i];
  67     // Finding b:
  68     //   net = gross - lower_brackets - rate * (gross - start)
  69     //   net = gross - lower_brackets - rate * gross + rate * start
  70     //   net = gross - rate * gross - lower_brackets + rate * start
  71     //   net = (1 - rate) * gross - lower_brackets + rate * start
  72     //   net = m * gross - lower_brackets + rate * start
  73     //                   \_____________________________/  - here is b
  74     return rate * start - lower_brackets;
  75   });
  76   const inverse_table = table.map(([start, end, rate], i) => {
  77     const m = ms[i];
  78     const b = bs[i];
  79     return [(start - b) / m, (end - b) / m, m, b];
  80   });
  81   return function(net) {
  82     for (const [start, end, m, b] of inverse_table) {
  83       if (start < net && net < end) {
  84         return (net - b) / m;
  85       }
  86     }
  87   };
  88 }