UNPKG

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

60 lines (54 loc) 1.43 kB
var test = require('tape'); var stringify = require('../'); test('space parameter', function (t) { t.plan(1); var obj = { one: 1, two: 2 }; t.equal(stringify(obj, {space: ' '}), '' + '{\n' + ' "one": 1,\n' + ' "two": 2\n' + '}' ); }); test('space parameter (with tabs)', function (t) { t.plan(1); var obj = { one: 1, two: 2 }; t.equal(stringify(obj, {space: '\t'}), '' + '{\n' + '\t"one": 1,\n' + '\t"two": 2\n' + '}' ); }); test('space parameter (with a number)', function (t) { t.plan(1); var obj = { one: 1, two: 2 }; t.equal(stringify(obj, {space: 3}), '' + '{\n' + ' "one": 1,\n' + ' "two": 2\n' + '}' ); }); test('space parameter (nested objects)', function (t) { t.plan(1); var obj = { one: 1, two: { b: 4, a: [2,3] } }; t.equal(stringify(obj, {space: ' '}), '' + '{\n' + ' "one": 1,\n' + ' "two": {\n' + ' "a": [\n' + ' 2,\n' + ' 3\n' + ' ],\n' + ' "b": 4\n' + ' }\n' + '}' ); }); test('space parameter (same as native)', function (t) { t.plan(1); // for this test, properties need to be in alphabetical order var obj = { one: 1, two: { a: [2,3], b: 4 } }; t.equal(stringify(obj, {space: ' '}), JSON.stringify(obj, null, ' ')); });