bluechip-utils
Version:
Utitity function package for javsacript and Typescript
158 lines (157 loc) • 7.01 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (_) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.shuffleArray = exports.splitArrayIntochunks = exports.convertWordToSentenceCase = exports.convertToNameCase = exports.camelizeCase = exports.getDateStringFromTime = exports.isValidPhoneNumber = exports.isValidEmail = exports.upperFirstCharacter = exports.adaptExpressRequest = exports.generateUUID = exports.readCsvFile = exports.generateUniqueCode = void 0;
var CamelCaseKeys = require("camelcase-keys");
var fs_1 = require("fs");
var neatCsv = require('neat-csv');
var uuid_1 = require("uuid");
var nanoid_1 = require("nanoid");
var nanoid_dictionary_1 = require("nanoid-dictionary");
// import generate from "nano";
/**
* Generates unique code
* @param length Length of unique code
* @param isUppercase - Whether the string returned should be uppercase
* @returns Generated string
*/
exports.generateUniqueCode = function (length, isUppercase) {
var nans = nanoid_1.customAlphabet(nanoid_dictionary_1.lowercase + nanoid_dictionary_1.uppercase + nanoid_dictionary_1.numbers, length);
return isUppercase ? nans().toUpperCase() : nans();
};
exports.readCsvFile = function (url) { return __awaiter(void 0, void 0, void 0, function () {
var fileData, parsed, error_1;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
_a.trys.push([0, 3, , 4]);
return [4 /*yield*/, fs_1.readFileSync(url).toString()];
case 1:
fileData = _a.sent();
if (fileData.charCodeAt(0) === 0xfeff) {
fileData = fileData.substr(1);
}
return [4 /*yield*/, neatCsv(fileData)];
case 2:
parsed = _a.sent();
return [2 /*return*/, parsed];
case 3:
error_1 = _a.sent();
throw new Error('Error parsing file');
case 4: return [2 /*return*/];
}
});
}); };
exports.generateUUID = function () {
return uuid_1.v4();
};
exports.adaptExpressRequest = function (req) {
var adaptRequest = {
path: req.path,
method: req.method,
pathParams: req.params,
queryParams: req.query,
body: req.body,
user: req.user || {},
};
return adaptRequest;
};
exports.upperFirstCharacter = function (word) {
if (word.length === 1) {
return word.toUpperCase();
}
return word.charAt(0).toUpperCase() + word.substring(1);
};
exports.isValidEmail = function (email) {
var valid = new RegExp(/^[^@\s]+@[^@\s]+\.[^@\s]+$/);
return valid.test(email);
};
exports.isValidPhoneNumber = function (phone) {
var valid = RegExp(/^\d{4}\d{3}\d{4}$/);
return valid.test(phone);
};
exports.getDateStringFromTime = function (time) {
var currentDate = new Date(time);
return currentDate.getDate() + '-' + (currentDate.getMonth() + 1) + '-' + currentDate.getFullYear();
};
exports.camelizeCase = function (item) {
return CamelCaseKeys(item);
};
var arrayConjunctions = ['for', 'and', 'the', 'a', 'so', 'nor', 'or'];
exports.convertToNameCase = function (text) {
text.replace(' ', ' ').toLowerCase();
text = text.trim();
var breakText = text.split(' ');
for (var index = 0; index < breakText.length; index++) {
if (!arrayConjunctions.includes(breakText[index + 1])) {
breakText[index] = exports.convertWordToSentenceCase(breakText[index]);
}
}
return breakText.join(' ');
};
exports.convertWordToSentenceCase = function (text) {
text = text.trim();
text.replace(' ', ' ').toLowerCase();
var breakText = text.split('');
for (var index = 0; index < breakText.length; index++) {
if (index === 0) {
breakText[index] = breakText[index].toUpperCase();
}
else {
breakText[index] = breakText[index].toLowerCase();
}
}
return breakText.join('');
};
// program to split array into smaller chunks
function splitArrayIntochunks(arr, chunk) {
var chunkArray = [];
for (var i = 0; i < arr.length; i += chunk) {
chunkArray.push(arr.slice(i, i + chunk));
}
return chunkArray;
}
exports.splitArrayIntochunks = splitArrayIntochunks;
exports.shuffleArray = function (array) {
var _a;
for (var i = array.length - 1; i > 0; i--) {
var j = Math.floor(Math.random() * (i + 1));
_a = [array[j], array[i]], array[i] = _a[0], array[j] = _a[1];
}
return array;
};