sum_load.js 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458
  1. 'use strict';
  2. /**
  3. *
  4. *
  5. * @author Mai
  6. * @date
  7. * @version
  8. */
  9. const Ledger = require('../lib/ledger');
  10. class loadGclBaseTree {
  11. /**
  12. * 构造函数
  13. * @param {Array} tempData - 清单模板数据
  14. */
  15. constructor (ctx, setting) {
  16. this.ctx = ctx;
  17. this.parent = setting.parent;
  18. this.defaultData = setting.defaultData;
  19. // 常量
  20. this.splitChar = '-';
  21. // 索引
  22. // 以code为索引
  23. this.items = [];
  24. // 缓存
  25. this.keyNodeId = setting.maxId ? setting.maxId + 1 : 1;
  26. }
  27. /**
  28. * 根据 编号 查找 父项项目节
  29. * @param {String} code - 子项编号
  30. * @returns {*}
  31. */
  32. findNode(node, parent, check) {
  33. parent = parent || this.parent;
  34. if (!parent.children) return null;
  35. for (const child of parent.children) {
  36. const checkLeaf = (child.is_leaf && node.is_leaf) || (!child.is_leaf && !node.is_leaf);
  37. if (child.b_code === node.b_code && child.name === node.name && child.unit === node.unit
  38. && checkLeaf && !child.hasPos && (!check || check(child, node))) {
  39. return child;
  40. }
  41. }
  42. return null;
  43. }
  44. /**
  45. * 添加 树节点 并完善该节点的树结构
  46. * @param {Object} node - 添加节点
  47. * @param {Object} parent - 父项
  48. * @returns {*}
  49. */
  50. addNode(source, parent, check) {
  51. parent = parent ? parent : this.parent;
  52. let node = this.findNode(source, parent, check);
  53. if (!node) {
  54. if (!parent.children) parent.children = [];
  55. node = {
  56. id: this.ctx.app.uuid.v4(),
  57. tender_id: this.ctx.tender.id,
  58. ledger_id: this.keyNodeId,
  59. ledger_pid: parent.ledger_id,
  60. level: parent.level +1,
  61. full_path: parent.full_path + '-' + this.keyNodeId,
  62. order: parent.children.length + 1,
  63. children: [],
  64. b_code: source.b_code,
  65. name: source.name,
  66. unit: source.unit,
  67. sgfh_qty: 0,
  68. qtcl_qty: 0,
  69. sjcl_qyt: 0,
  70. quantity: 0,
  71. is_leaf: source.is_leaf,
  72. hasPos: false,
  73. };
  74. this.keyNodeId += 1;
  75. parent.children.push(node);
  76. this.items.push(node);
  77. }
  78. return node;
  79. }
  80. gather(source, parent) {}
  81. getUpdateData() {}
  82. recursiveCalculate(dealBills, node) {
  83. if (node.children && node.children.length > 0) {
  84. for (const child of node.children) {
  85. this.recursiveCalculate(dealBills, child);
  86. }
  87. } else {
  88. const p = this.ctx.helper.findPrecision(this.ctx.tender.info.precision, node.unit);
  89. node.sgfh_qty = this.ctx.helper.round(node.sgfh_qty, p.value);
  90. node.sjcl_qty = this.ctx.helper.round(node.sjcl_qty, p.value);
  91. node.qtcl_qty = this.ctx.helper.round(node.qtcl_qty, p.value);
  92. node.quantity = this.ctx.helper.round(node.quantity, p.value);
  93. if (!node.unit_price) {
  94. const db = dealBills.find(x => { return x.code === node.b_code && x.name === node.name && x.unit === node.unit });
  95. if (!db) return;
  96. node.unit_price = db.unit_price;
  97. }
  98. node.sgfh_tp = this.ctx.helper.mul(node.sgfh_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  99. node.sjcl_tp = this.ctx.helper.mul(node.sjcl_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  100. node.qtcl_tp = this.ctx.helper.mul(node.qtcl_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  101. node.total_price = this.ctx.helper.mul(node.quantity, node.unit_price, this.ctx.tender.info.decimal.tp);
  102. }
  103. }
  104. calculateAll(dealBills) {
  105. this.recursiveCalculate(dealBills, this.parent);
  106. }
  107. }
  108. class loadLedgerGclTree extends loadGclBaseTree {
  109. gather(source, parent) {
  110. const node = this.addNode(source, parent);
  111. node.sgfh_qty = this.ctx.helper.add(node.sgfh_qty, source.sgfh_qty);
  112. node.qtcl_qty = this.ctx.helper.add(node.qtcl_qty, source.qtcl_qty);
  113. node.sjcl_qty = this.ctx.helper.add(node.sjcl_qty, source.sjcl_qty);
  114. node.quantity = this.ctx.helper.add(node.quantity, source.quantity);
  115. return node;
  116. }
  117. getUpdateData() {
  118. const update = [];
  119. if (this.items.length > 0) update.push({id: this.parent.id, ledger_id: this.parent.ledger_id, is_leaf: 0});
  120. const create = [];
  121. for (const i of this.items) {
  122. create.push({
  123. id: i.id, tender_id: i.tender_id, ledger_id: i.ledger_id, ledger_pid: i.ledger_pid,
  124. level: i.level, order: i.order, full_path: i.full_path, is_leaf: !i.children || i.children.length === 0,
  125. b_code: i.b_code, name: i.name, unit: i.unit, unit_price: i.unit_price || 0,
  126. sgfh_qty: i.sgfh_qty, sjcl_qty: i.sjcl_qty, qtcl_qty: i.qtcl_qty, quantity: i.quantity,
  127. sgfh_tp: i.sgfh_tp || 0, sjcl_tp: i.sjcl_tp || 0, qtcl_tp: i.qtcl_tp || 0, total_price: i.total_price || 0,
  128. });
  129. }
  130. return {update, create};
  131. }
  132. }
  133. class updateReviseGclTree extends loadGclBaseTree {
  134. constructor (ctx, setting) {
  135. super(ctx, setting);
  136. this.baseNodes = [];
  137. this.errors = [];
  138. }
  139. loadBase(datas, pos) {
  140. datas.sort((x, y) => { return x.level === y.level ? x.order - y.order : x.level - y.level; });
  141. const Index = {};
  142. for (const d of datas) {
  143. const parent = this.parent.ledger_id === d.ledger_pid ? this.parent : Index[d.ledger_pid];
  144. if (!parent) continue;
  145. if (!parent.children) parent.children = [];
  146. const relaPos = pos.filter(x => {return x.lid === d.id});
  147. const baseNode = {
  148. id: d.id,
  149. ledger_id: d.ledger_id,
  150. ledger_pid: d.ledger_pid,
  151. level: d.level,
  152. is_leaf: d.is_leaf,
  153. full_path: d.full_path,
  154. b_code: d.b_code,
  155. name: d.name,
  156. unit: d.unit,
  157. unit_price: d.unit_price,
  158. org_sgfh_qty: d.sgfh_qty || 0,
  159. org_sjcl_qty: d.sjcl_qty || 0,
  160. org_qtcl_qty: d.qtcl_qty || 0,
  161. org_qty: d.quantity || 0,
  162. org_order: d.order,
  163. sgfh_qty: 0,
  164. sjcl_qty: 0,
  165. qtcl_qty: 0,
  166. quantity: 0,
  167. hasPos: relaPos.length > 0,
  168. };
  169. parent.children.push(baseNode);
  170. Index[baseNode.ledger_id] = baseNode;
  171. this.baseNodes.push(baseNode);
  172. }
  173. }
  174. gather(source, parent) {
  175. const node = this.addNode(source, parent);
  176. node.sgfh_qty = this.ctx.helper.add(node.sgfh_qty, source.sgfh_qty);
  177. node.qtcl_qty = this.ctx.helper.add(node.qtcl_qty, source.qtcl_qty);
  178. node.sjcl_qty = this.ctx.helper.add(node.sjcl_qty, source.sjcl_qty);
  179. node.quantity = this.ctx.helper.add(node.quantity, source.quantity);
  180. return node;
  181. }
  182. getUpdateData() {
  183. const result = {update: [], errors: [], create: []};
  184. if (this.baseNodes.length === 0) {
  185. if (this.items.length > 0) result.update.push({id: this.parent.id, ledger_id: this.parent.ledger_id, is_leaf: 0});
  186. } else {
  187. for (const bn of this.baseNodes) {
  188. if (bn.children && bn.children.length > 0) continue;
  189. if (bn.sjcl_qty < bn.org_sjcl_qty || bn.qtcl_qty < bn.org_qtcl_qty || bn.sgfh_qty < bn.org_sgfh_qty) {
  190. result.errors.push({
  191. ledger_id: bn.ledger_id,
  192. b_code: bn.b_code, name: bn.name, unit: bn.unit,
  193. sgfh_qty: bn.sgfh_qty, sjcl_qty: bn.sjcl_qty, qtcl_qty: bn.qtcl_qty, qty: bn.quantity, type: 'less',
  194. });
  195. } else if (bn.sjcl_qty !== bn.org_sjcl_qty || bn.qtcl_qty !== bn.org_qtcl_qty || bn.sgfh_qty !== bn.org_sgfh_qty) {
  196. result.update.push({
  197. id: bn.id, ledger_id: bn.ledger_id, unit_price: bn.unit_price || 0,
  198. sgfh_qty: bn.sgfh_qty, sjcl_qty: bn.sjcl_qty, qtcl_qty: bn.qtcl_qty, quantity: bn.quantity,
  199. sgfh_tp: bn.sgfh_tp || 0, sjcl_tp: bn.sjcl_tp || 0, qtcl_tp: bn.qtcl_tp || 0, total_price: bn.total_price || 0,
  200. })
  201. }
  202. }
  203. }
  204. for (const i of this.items) {
  205. result.create.push({
  206. id: i.id, tender_id: i.tender_id, ledger_id: i.ledger_id, ledger_pid: i.ledger_pid,
  207. level: i.level, order: i.order, full_path: i.full_path, is_leaf: !i.children || i.children.length === 0,
  208. b_code: i.b_code, name: i.name, unit: i.unit, unit_price: i.unit_price || 0,
  209. sgfh_qty: i.sgfh_qty, sjcl_qty: i.sjcl_qty, qtcl_qty: i.qtcl_qty, quantity: i.quantity,
  210. sgfh_tp: i.sgfh_tp || 0, sjcl_tp: i.sjcl_tp || 0, qtcl_tp: i.qtcl_tp || 0, total_price: i.total_price || 0,
  211. })
  212. }
  213. return result;
  214. }
  215. }
  216. class gatherStageGclTree extends loadGclBaseTree {
  217. constructor (ctx, setting) {
  218. super(ctx, setting);
  219. this.baseNodes = [];
  220. }
  221. loadBase(datas, pos) {
  222. datas.sort((x, y) => { return x.level === y.level ? x.order - y.order : x.level - y.level; });
  223. const Index = {};
  224. for (const d of datas) {
  225. const parent = this.parent.ledger_id === d.ledger_pid ? this.parent : Index[d.ledger_pid];
  226. if (!parent) continue;
  227. if (!parent.children) parent.children = [];
  228. const relaPos = pos.filter(x => {return x.lid === d.id});
  229. const baseNode = {
  230. id: d.id,
  231. ledger_id: d.ledger_id,
  232. ledger_pid: d.ledger_pid,
  233. level: d.level,
  234. is_leaf: d.is_leaf,
  235. full_path: d.full_path,
  236. b_code: d.b_code,
  237. name: d.name,
  238. unit: d.unit,
  239. unit_price: d.unit_price,
  240. org_contract_qty: d.contract_qty || 0,
  241. org_contract_tp: d.contract_tp || 0,
  242. org_order: d.order,
  243. contract_qty: 0,
  244. contract_tp: 0,
  245. is_tp: d.is_tp,
  246. hasPos: relaPos.length > 0,
  247. };
  248. parent.children.push(baseNode);
  249. Index[baseNode.ledger_id] = baseNode;
  250. this.baseNodes.push(baseNode);
  251. }
  252. }
  253. _gatherChange(node, source) {
  254. if (!source.change_detail || source.change_detail.length === 0) return;
  255. if (!node.change_detail) node.change_detail = [];
  256. for (const cd of source.change_detail) {
  257. if (!cd.qty) continue;
  258. let ncd = node.change_detail.find(x => { return x.cid === cd.cid; });
  259. if (!ncd) {
  260. ncd = { cid: cd.cid, c_code: cd.c_code };
  261. node.change_detail.push(ncd);
  262. }
  263. ncd.qty = this.ctx.helper.add(ncd.qty, cd.qty);
  264. }
  265. }
  266. gather(source, parent) {
  267. parent = parent ? parent : this.parent;
  268. const node = this.addNode(source, parent, function (node, source) {
  269. return (source.is_tp && node.is_tp) || (!source.is_tp && !node.is_tp);
  270. });
  271. if (node.is_tp) {
  272. node.contract_tp = this.ctx.helper.add(node.contract_tp, source.contract_tp);
  273. } else {
  274. node.contract_qty = this.ctx.helper.add(node.contract_qty, source.contract_qty);
  275. node.contract_tp = this.ctx.helper.mul(node.unit_price, node.contract_qty, this.ctx.tender.info.decimal.tp);
  276. }
  277. this._gatherChange(node, source);
  278. return node;
  279. }
  280. getUpdateData() {
  281. const result = {update: [], errors: []};
  282. for (const bn of this.baseNodes) {
  283. if (bn.contract_qty !== bn.org_contract_qty || bn.contract_tp !== bn.org_contract_tp) {
  284. result.update.push({lid: bn.id, contract_qty: bn.contract_qty, contract_tp: bn.contract_tp });
  285. }
  286. if (bn.change_detail && bn.change_detail.length > 0) {
  287. for (const cd of bn.change_detail) {
  288. result.errors.push({
  289. ledger_id: bn.ledger_id,
  290. b_code: bn.b_code, name: bn.name, unit: bn.unit,
  291. c_code: cd.c_code, qty: cd.qty, type: 'qc',
  292. });
  293. }
  294. }
  295. }
  296. for (const i of this.items) {
  297. result.errors.push({ b_code: i.b_code, name: i.name, unit: i.unit, qty: i.contract_qty, type: 'miss' });
  298. if (i.change_detail && i.change_detail.length > 0) {
  299. for (const cd of i.change_detail) {
  300. result.errors.push({
  301. b_code: i.b_code, name: i.name, unit: i.unit,
  302. c_code: cd.c_code, qty: cd.qty, type: 'miss-qc',
  303. });
  304. }
  305. }
  306. }
  307. return result;
  308. }
  309. }
  310. class sumLoad {
  311. constructor (ctx) {
  312. this.ctx = ctx;
  313. }
  314. recusiveLoadGatherGcl(node, parent) {
  315. const cur = node.b_code ? this.loadTree.gather(node, parent) : parent;
  316. if (!node.children || node.children.length === 0) return;
  317. for (const child of node.children) {
  318. this.recusiveLoadGatherGcl(child, cur);
  319. }
  320. }
  321. async loadGatherGcl(select, maxId, tenders, defaultData) {
  322. this.loadTree = new loadLedgerGclTree(this.ctx, {
  323. parent: select, maxId, type: 'ledger', defaultData,
  324. });
  325. for (const tender of tenders) {
  326. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  327. const billsTree = new Ledger.billsTree(this.ctx, {
  328. id: 'ledger_id',
  329. pid: 'ledger_pid',
  330. order: 'order',
  331. level: 'level',
  332. rootId: -1,
  333. keys: ['id', 'tender_id', 'ledger_id'],
  334. stageId: 'id',
  335. });
  336. billsTree.loadDatas(billsData);
  337. for (const top of billsTree.children) {
  338. if ([1].indexOf(top.node_type) < 0) continue;
  339. this.recusiveLoadGatherGcl(top, null);
  340. }
  341. }
  342. const dealBills = await this.ctx.service.dealBills.getAllDataByCondition({ where: { tender_id: this.ctx.tender.id } });
  343. this.loadTree.calculateAll(dealBills);
  344. return this.loadTree;
  345. }
  346. async updateGatherGcl(select, maxId, tenders, defaultData) {
  347. this.loadTree = new updateReviseGclTree(this.ctx, {
  348. parent: select, maxId, type: 'ledger', defaultData,
  349. });
  350. const posterity = await this.ctx.service.reviseBills.getPosterityByParentId(this.ctx.tender.id, select.ledger_id);
  351. const pos = await this.ctx.service.revisePos.getData(this.ctx.tender.id);
  352. this.loadTree.loadBase(posterity, pos);
  353. for (const tender of tenders) {
  354. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  355. const billsTree = new Ledger.billsTree(this.ctx, {
  356. id: 'ledger_id',
  357. pid: 'ledger_pid',
  358. order: 'order',
  359. level: 'level',
  360. rootId: -1,
  361. keys: ['id', 'tender_id', 'ledger_id'],
  362. stageId: 'id',
  363. });
  364. billsTree.loadDatas(billsData);
  365. for (const top of billsTree.children) {
  366. if ([1].indexOf(top.node_type) < 0) continue;
  367. this.recusiveLoadGatherGcl(top, null);
  368. }
  369. }
  370. const dealBills = await this.ctx.service.dealBills.getAllDataByCondition({ where: { tender_id: this.ctx.tender.id } });
  371. this.loadTree.calculateAll(dealBills);
  372. return this.loadTree;
  373. }
  374. _loadCurStageAndChange(billsData, curStageBills, curStageChange) {
  375. const billsIndex = {};
  376. for (const b of billsData) {
  377. billsIndex[b.id] = b;
  378. }
  379. for (const csb of curStageBills) {
  380. const b = billsIndex[csb.lid];
  381. if (!b) continue;
  382. b.contract_qty = csb.contract_qty;
  383. b.contract_tp = csb.contract_tp;
  384. }
  385. for (const csc of curStageChange) {
  386. if (!csc.qty) continue;
  387. const b = billsIndex[csc.lid];
  388. if (!b) continue;
  389. if (!b.change_detail) b.change_detail = [];
  390. let c = b.change_detail.find(x => { return x.cid === csc.cid });
  391. if (!c) {
  392. c = { cid: csc.cid };
  393. b.change_detail.push(c);
  394. }
  395. c.qty = this.ctx.helper.add(c.qty, csc.qty);
  396. }
  397. }
  398. async stageGatherGcl(select, maxId, tenders, defaultData) {
  399. this.loadTree = new gatherStageGclTree(this.ctx, {
  400. parent: select, maxId, type: 'ledger', defaultData,
  401. });
  402. const posterity = await this.ctx.service.ledger.getPosterityByParentId(this.ctx.tender.id, select.ledger_id);
  403. const pos = await this.ctx.service.revisePos.getData(this.ctx.tender.id);
  404. this.loadTree.loadBase(posterity, pos);
  405. for (const tender of tenders) {
  406. if (!tender.stage) continue;
  407. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  408. const stage = await this.ctx.service.stage.getDataByCondition({tid: tender.tid, order: tender.stage});
  409. if (!stage) throw '选择的期不存在';
  410. const curStageData = await this.ctx.service.stageBills.getLastestStageData(tender.tid, stage.id);
  411. const curStageChange = await this.ctx.service.stageChangeFinal.getSumLoadFinalData(stage.id);
  412. this._loadCurStageAndChange(billsData, curStageData, curStageChange);
  413. const billsTree = new Ledger.billsTree(this.ctx, {
  414. id: 'ledger_id',
  415. pid: 'ledger_pid',
  416. order: 'order',
  417. level: 'level',
  418. rootId: -1,
  419. keys: ['id', 'tender_id', 'ledger_id'],
  420. stageId: 'id',
  421. });
  422. billsTree.loadDatas(billsData);
  423. for (const top of billsTree.children) {
  424. if ([1].indexOf(top.node_type) < 0) continue;
  425. this.recusiveLoadGatherGcl(top, null);
  426. }
  427. }
  428. return this.loadTree;
  429. }
  430. }
  431. module.exports = sumLoad;