@kontur.candy/form-testing/dist/Scripts/Commons/scriptingUtils.js

"use strict";

Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.executeCommand = executeCommand;
exports.executeCommandAndGetStdout = executeCommandAndGetStdout;
exports.isDirectoryExists = isDirectoryExists;
exports.findMostNearestWord = findMostNearestWord;

var fs = _interopRequireWildcard(require("fs"));

var path = _interopRequireWildcard(require("path"));

var shell = _interopRequireWildcard(require("shelljs"));

function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }

function executeCommand(command, workingDirectory) {
  if (workingDirectory != undefined) {
    shell.pushd(workingDirectory);
  }

  try {
    console.log(command);
    shell.exec(command);
  } finally {
    if (workingDirectory != undefined) {
      shell.popd();
    }
  }
}

function executeCommandAndGetStdout(command) {
  console.log(command);
  const result = shell.exec(command, {
    silent: true
  });

  if (typeof result.stdout === "string") {
    return result.stdout;
  }

  return "";
}

function isDirectoryExists(dirPath) {
  try {
    return fs.statSync(path.resolve(dirPath)).isDirectory();
  } catch (e) {
    return false;
  }
}

function levenshtein(left, right) {
  let a = left;
  let b = right;

  if (a.length === 0) {
    return b.length;
  }

  if (b.length === 0) {
    return a.length;
  } // swap to save some memory O(min(a,b)) instead of O(a)


  if (a.length > b.length) {
    const tmp = a;
    a = b;
    b = tmp;
  }

  const row = []; // init the row

  for (let i = 0; i <= a.length; i++) {
    row[i] = i;
  } // fill in the rest


  for (let i = 1; i <= b.length; i++) {
    let prev = i;

    for (let j = 1; j <= a.length; j++) {
      let val;

      if (b.charAt(i - 1) === a.charAt(j - 1)) {
        val = row[j - 1]; // match
      } else {
        val = Math.min(row[j - 1] + 1, // substitution
        prev + 1, // insertion
        row[j] + 1); // deletion
      }

      row[j - 1] = prev;
      prev = val;
    }

    row[a.length] = prev;
  }

  return row[a.length];
}

function findMostNearestWord(list, word) {
  let minValue = 4;
  let resultWord;

  for (const item of list) {
    const distance = levenshtein(item, word);

    if (distance <= minValue) {
      minValue = distance;
      resultWord = item;
    }
  }

  return resultWord;
}
//# sourceMappingURL=scriptingUtils.js.map