@turnbuckle/aprs-calculator-services
Version:
Anchorpoint Risk Calculator Service.
118 lines (117 loc) • 7.22 kB
JavaScript
;
var __assign = (this && this.__assign) || function () {
__assign = Object.assign || function(t) {
for (var s, i = 1, n = arguments.length; i < n; i++) {
s = arguments[i];
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
t[p] = s[p];
}
return t;
};
return __assign.apply(this, arguments);
};
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.mergeFinancialTransactions = void 0;
var ts_stopwatch_1 = require("ts-stopwatch");
var assert_1 = require("../../../common/assert");
var transaction_item_type_enums_1 = require("../../../enums/transaction-item-type.enums");
var create_invoice_hashmap_1 = require("./create-invoice-hashmap");
var sort_module_1 = require("../../../common/sort.module");
var merge_arrays_with_spread_1 = require("./merge-arrays-with-spread");
/**
* @MergeFinancialTransactionsInputModelInterface input
* - invoices: array of invoices
* - creditNotes: optional array of credit notes
* - receipts: optional array of receipts
* > - invoices, creditNotes and receipts will be merged into a single array and returned in transactions
* > - creditNotes & receipts which do not have a matching invoice will be ignored
* > - creditNotes & receipts falling on the same day, with their sum total == 0, will be added to excluded;
* > - transactions with balance < 0 (sum of inv, crn & rct) will be added to excluded;
* @MergeFinancialTransactionsOutputModelInterface output
* - transactions: array of merged invoices, credit notes & receipts
* - excluded: array of credit notes and receipts that sum to 0 on a specific day
* - executeDuration: the length of time it took for this call to complete
*/
function mergeFinancialTransactions(input) {
var _a, _b, _c;
return __awaiter(this, void 0, void 0, function () {
var sw, invoiceItems, invoiceMap, transactions, invoices, i, j;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
sw = new ts_stopwatch_1.Stopwatch();
sw.start();
(0, assert_1.assert)(((_a = input === null || input === void 0 ? void 0 : input.invoices) === null || _a === void 0 ? void 0 : _a.length) > 0, assert_1.MISSING_PARAMETER_ERRORMSG.replace("{0}", "invoices"));
invoiceItems = [];
return [4 /*yield*/, (0, merge_arrays_with_spread_1.mergeArraysWithSpread)(invoiceItems, input.invoices, { type: transaction_item_type_enums_1.TransactionItemTypeEnums.invoice })];
case 1:
_d.sent();
return [4 /*yield*/, (0, merge_arrays_with_spread_1.mergeArraysWithSpread)(invoiceItems, (_b = input.creditNotes) !== null && _b !== void 0 ? _b : [], { type: transaction_item_type_enums_1.TransactionItemTypeEnums.creditNote })];
case 2:
_d.sent();
return [4 /*yield*/, (0, merge_arrays_with_spread_1.mergeArraysWithSpread)(invoiceItems, (_c = input.receipts) !== null && _c !== void 0 ? _c : [], { type: transaction_item_type_enums_1.TransactionItemTypeEnums.receipt })];
case 3:
_d.sent();
(0, sort_module_1.sortByTransactionNumberAndThenDate)(invoiceItems);
return [4 /*yield*/, (0, create_invoice_hashmap_1.createInvoiceHashmap)(invoiceItems)];
case 4:
invoiceMap = _d.sent();
transactions = [];
invoices = Object.values(invoiceMap);
for (i = 0; i < invoices.length; i++) {
// only merge invoices with positive amounts
if (invoices[i][0].type === transaction_item_type_enums_1.TransactionItemTypeEnums.invoice && invoices[i][0].amount > 0) {
transactions.push(__assign({}, invoices[i][0]));
for (j = 1; j < invoices[i].length; j++) {
if (invoices[i][j].amount !== 0) {
transactions.push(__assign({}, invoices[i][j]));
}
}
}
}
sw.stop();
return [2 /*return*/, {
executeDuration: sw.getTime(),
transactions: transactions,
}];
}
});
});
}
exports.mergeFinancialTransactions = mergeFinancialTransactions;