Implementation method of Cartesian Integration Algorithm of JavaScript

//Cartesian product combinationfunction descartes(list)
{
  //parent previous level index; count pointer count  var point = {};
  var result = [];
  var pIndex = null;
  var tempCount = 0;
  var temp  = [];
  //Generate a reference object based on the parameter column  for(var index in list)
  {
    if(typeof list[index] == 'object')
    {
      point[index] = {'parent':pIndex,'count':0}
      pIndex = index;
    }
  }
  //Return directly to the single-dimensional data structure  if(pIndex == null)
  {
    return list;
  }
  //Dynamic generation of Cartesian products  while(true)
  {
    for(var index in list)
    {
      tempCount = point[index]['count'];
      (list[index][tempCount]);
    }
    //Press into the result array    (temp);
    temp = [];
    //Ask for checking the maximum pointer value    while(true)
    {
      if(point[index]['count']+1 >= list[index].length)
      {
        point[index]['count'] = 0;
        pIndex = point[index]['parent'];
        if(pIndex == null)
        {
          return result;
        }
        // Assign parent to check again        index = pIndex;
      }
      else
      {
        point[index]['count']++;
        break;
      }
    }
  }
}