bt              -- Show a backtrace with node.js JavaScript 
                   functions and their args.

findjsinstances -- List every object with the specified type 
                   name.

findjsobjects   -- List all object types and instance counts 
                   grouped by typename and sorted by instance 
                   count.

findrefs        -- Finds all the object properties which meet 
                   the search criteria.
                         
inspect         -- Print detailed description and contents of 
                   the JavaScript value.

nodeinfo        -- Print information about Node.js

print           -- Print short description of the JavaScript 
                   value.

source          -- Source code information

const createDivisor = require("./helper.js").createDivisor;

// Long-processing time block function
function greatestCommonDivisor(a, b) {
  let lowest = Math.min(a, b), greatest = Math.max(a, b),
      aDivisor = null, bDivisor = null, commonDivisor = null;

  for(i = lowest; i > 0; i--) {
    aDivisor = createDivisor(lowest, i);
    if(aDivisor.isDivisor) {
      bDivisor = createDivisor(greatest, i);
      if(bDivisor.isDivisor) {
        commonDivisor = i;
        break;
      }
    }
  }

  return commonDivisor;
}

// Look, I know how to implement Dynamic Programming!
let storedDivisors = {};

class Divisor {
  constructor(number, divisor) {
    this.isDivisor = number % divisor == 0;
    this.number = number;
    this.divisor = divisor;
  }
}

function createDivisor(number, divisor) {
  let divisorObject = storedDivisors[[number, divisor]];
  if(divisorObject === undefined) {
    divisorObject = new Divisor(number, divisor);
    storedDivisors[number, divisor] = divisorObject;
  }
  return divisorObject;
}

function isDivisor(number, divisor) {
  return (number % divisor) == 0;
}

// Long-processing time block function
function greatestCommonDivisor(a, b) {
  let lowest = Math.min(a, b), greatest = Math.max(a, b), commonDivisor = -1;

  for(i = lowest; i > 0; i--) {
    if(isDivisor(lowest, i)) {
      if(isDivisor(greatest, i)) {
        commonDivisor = i;
        break;
      }
    }
  }

  return commonDivisor;
}