Výběr z polí bez opakování

data = [
  [1,1,1,3,3,4,4,4,5,5,6,7,8,8],
  [1,7],
  [1,1,1,3,3,4,4,4,5,5,6,7,8,8],
  [1,2,5,5],
  [2,2,3,3,4,5,5,5,6,8],
  [1,2,2,4,6,6,8]
];

function arrayUnique(arr) {
  var a = [];
  for (var i = 0; i < arr.length; i++) {
    for (var j = i + 1; j < arr.length; j++) {if (arr[i] === arr[j]) {j = ++i;}}
    a.push(arr[i]);
  }
  return a;
}
  
function removeDuplicateElement(arr) {
  var newArray = new Array();
  label: for (var i = 0; i < arr.length; i++) {
    var tempArray = arr[i].slice(0);;
    arr[i].sort();
    for (var j = 0; j < tempArray.length; j++) {
      for (var k = j+1; k < tempArray.length; k++) {if (arr[i][j] == arr[i][k]) {continue label;}}
    }
    newArray[newArray.length] = tempArray;
  }
  return newArray;
}

function getPermutation(n, arr, divisors) {
  var result = [];
  var curArray;
  for (var i = 0; i < arr.length; i++) {
    curArray = arr[i];
    result.push(curArray[Math.floor(n / divisors[i]) % curArray.length]);
  }
  return result;
}

function arraysToCombine(arr) {
  for (var i = 0; i < arr.length; i++) {arr[i] = arrayUnique(arr[i]);}
  var divisors = [];
  for (var i = arr.length - 1; i >= 0; i--) {divisors[i] = divisors[i + 1] ? divisors[i + 1] * arr[i + 1].length : 1;}
  var numPerms = arr[0].length;
  for (var i = 1; i < arr.length; i++) {numPerms *= arr[i].length;}
  var combinations = [];
  for (var i = 0; i < numPerms; i++) {combinations.push(getPermutation(i, arr, divisors));}
  return combinations;
}

var unique = removeDuplicateElement(arraysToCombine(data));
document.write('počet kombinací: '+unique.length+'<hr>');
for (var i = 0; i < unique.length; i++) {document.write(unique[i]+'<br>');}