luhn-generator
Version:
A generator of numbers that passes the validation of Luhn algorithm or Luhn formula, also known as the 'modulus 10' or 'mod 10' algorithm
38 lines (32 loc) • 998 B
JavaScript
import { memoize } from '../../core/utils';
/**
* Converts a table to an Array of arrays, normalized for row and column spans
* @method toGrid
* @memberof axe.commons.table
* @instance
* @param {HTMLTableElement} node The table to convert
* @return {Array<HTMLTableCellElement>} Array of HTMLTableCellElements
*/
function toGrid(node) {
var table = [];
var rows = node.rows;
for (var i = 0, rowLength = rows.length; i < rowLength; i++) {
var cells = rows[i].cells;
table[i] = table[i] || [];
var columnIndex = 0;
for (var j = 0, cellLength = cells.length; j < cellLength; j++) {
for (var colSpan = 0; colSpan < cells[j].colSpan; colSpan++) {
for (var rowSpan = 0; rowSpan < cells[j].rowSpan; rowSpan++) {
table[i + rowSpan] = table[i + rowSpan] || [];
while (table[i + rowSpan][columnIndex]) {
columnIndex++;
}
table[i + rowSpan][columnIndex] = cells[j];
}
columnIndex++;
}
}
}
return table;
}
export default memoize(toGrid);