sum_load.js 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646
  1. 'use strict';
  2. /**
  3. *
  4. *
  5. * @author Mai
  6. * @date
  7. * @version
  8. */
  9. const Ledger = require('../lib/ledger');
  10. const auditConst = require('../const/audit');
  11. class loadGclBaseTree {
  12. /**
  13. * 构造函数
  14. * @param {Array} tempData - 清单模板数据
  15. */
  16. constructor (ctx, setting) {
  17. this.ctx = ctx;
  18. this.parent = setting.parent;
  19. this.parent.children = [];
  20. this.defaultData = setting.defaultData;
  21. // 常量
  22. this.splitChar = '-';
  23. // 索引
  24. // 仅通过addNode或addNodeWithoutParent添加节点
  25. this.items = [];
  26. // this.parent下原来的节点
  27. this.baseNodes = [];
  28. this.ignoreParent = setting.ignoreParent;
  29. this.ignoreNotFind = setting.ignoreNotFind;
  30. this.loadChange = setting.loadChange;
  31. this.useSubUp = setting.useSubUp;
  32. // 缓存
  33. this.keyNodeId = setting.maxId ? setting.maxId + 1 : 1;
  34. }
  35. /**
  36. * 根据 编号 查找 父项项目节
  37. * @param {String} code - 子项编号
  38. * @returns {*}
  39. */
  40. findNode(node, parent, check) {
  41. parent = parent || this.parent;
  42. if (!parent.children) return null;
  43. for (const child of parent.children) {
  44. const checkLeaf = (child.is_leaf && node.is_leaf) || (!child.is_leaf && !node.is_leaf);
  45. if (child.b_code === node.b_code && child.name === node.name && child.unit === node.unit
  46. && checkLeaf && !child.hasPos && (!check || check(child, node))) {
  47. return child;
  48. }
  49. }
  50. return null;
  51. }
  52. findBCodeNode(b_code, mustParent) {
  53. for (const bn of this.baseNodes) {
  54. if (bn.b_code === b_code && (!mustParent || !bn.is_leaf)) return bn;
  55. }
  56. for (const i of this.items) {
  57. if (i.b_code === b_code && (!mustParent || !i.is_leaf)) return i;
  58. }
  59. return null;
  60. }
  61. findBCodeParent(b_code) {
  62. const codeArr = b_code.split('-');
  63. if (codeArr.length === 1) return null;
  64. codeArr.length = codeArr.length - 1;
  65. const parentCode = codeArr.join('-');
  66. const result = this.findBCodeNode(parentCode, true);
  67. return result || this.findBCodeParent(parentCode);
  68. }
  69. /**
  70. * 添加 树节点 并完善该节点的树结构
  71. * @param {Object} node - 添加节点
  72. * @param {Object} parent - 父项
  73. * @returns {*}
  74. */
  75. addNode(source, parent, check) {
  76. parent = parent ? parent : this.parent;
  77. let node = this.findNode(source, parent, check);
  78. if (!node) {
  79. if (!parent.children) parent.children = [];
  80. node = {
  81. id: this.ctx.app.uuid.v4(),
  82. tender_id: this.ctx.tender.id,
  83. ledger_id: this.keyNodeId,
  84. ledger_pid: parent.ledger_id,
  85. level: parent.level +1,
  86. full_path: parent.full_path + '-' + this.keyNodeId,
  87. order: parent.children.length + 1,
  88. children: [],
  89. b_code: source.b_code,
  90. name: source.name,
  91. unit: source.unit,
  92. deal_qty: 0,
  93. sgfh_qty: 0,
  94. qtcl_qty: 0,
  95. sjcl_qyt: 0,
  96. quantity: 0,
  97. is_leaf: source.is_leaf,
  98. hasPos: false,
  99. };
  100. this.keyNodeId += 1;
  101. parent.children.push(node);
  102. this.items.push(node);
  103. }
  104. return node;
  105. }
  106. findLeaf(node, check) {
  107. for (const bn of this.baseNodes) {
  108. if (bn.b_code === node.b_code && bn.name === node.name && bn.unit === node.unit
  109. && bn.is_leaf && !bn.hasPos && (!check || check(bn, node))) return bn;
  110. }
  111. for (const i of this.items) {
  112. if (i.b_code === node.b_code && i.name === node.name && i.unit === node.unit
  113. && i.is_leaf && !i.hasPos && (!check || check(i, node))) return i;
  114. }
  115. return null;
  116. }
  117. addNodeWithoutParent(source, check) {
  118. let node = this.findLeaf(source, check);
  119. if (!node) {
  120. const parent = this.findBCodeParent(source.b_code) || this.parent;
  121. node = {
  122. id: this.ctx.app.uuid.v4(),
  123. tender_id: this.ctx.tender.id,
  124. ledger_id: this.keyNodeId,
  125. ledger_pid: parent.ledger_id,
  126. level: parent.level + 1,
  127. full_path: parent.full_path + '-' + this.keyNodeId,
  128. order: parent.children.length + 1,
  129. b_code: source.b_code,
  130. name: source.name,
  131. unit: source.unit,
  132. deal_qty: 0,
  133. sgfh_qty: 0,
  134. qtcl_qty: 0,
  135. sjcl_qty: 0,
  136. quantity: 0,
  137. is_leaf: source.is_leaf,
  138. hasPos: false,
  139. sub_up: source.unit_price || 0,
  140. };
  141. this.keyNodeId += 1;
  142. parent.children.push(node);
  143. this.items.push(node);
  144. }
  145. return node;
  146. }
  147. gather(source, parent) {}
  148. getUpdateData() {}
  149. resortChildrenByCode(node) {
  150. const helper = this.ctx.helper;
  151. if (!node.children || node.children.length === 0) return;
  152. node.children.sort((x, y) => {
  153. return helper.compareCode(x.b_code, y.b_code);
  154. });
  155. for (const [i, c] of node.children.entries()) {
  156. this.resortChildrenByCode(c);
  157. c.order = i + 1;
  158. }
  159. }
  160. resortByCode() {
  161. this.resortChildrenByCode(this.parent);
  162. }
  163. recursiveCalculate(dealBills, node) {
  164. if (node.children && node.children.length > 0) {
  165. for (const child of node.children) {
  166. this.recursiveCalculate(dealBills, child);
  167. }
  168. } else {
  169. const p = this.ctx.helper.findPrecision(this.ctx.tender.info.precision, node.unit);
  170. node.deal_qty = this.ctx.helper.round(node.deal_qty, p.value);
  171. node.sgfh_qty = this.ctx.helper.round(node.sgfh_qty, p.value);
  172. node.sjcl_qty = this.ctx.helper.round(node.sjcl_qty, p.value);
  173. node.qtcl_qty = this.ctx.helper.round(node.qtcl_qty, p.value);
  174. node.quantity = this.ctx.helper.round(node.quantity, p.value);
  175. if (!node.unit_price) {
  176. const db = dealBills.find(x => { return x.code === node.b_code && x.name === node.name && x.unit === node.unit });
  177. if (db) {
  178. node.unit_price = db.unit_price;
  179. } else if (this.useSubUp) {
  180. node.unit_price = this.ctx.helper.round(node.sub_up, this.ctx.tender.info.decimal.up);
  181. }
  182. }
  183. node.deal_tp = this.ctx.helper.mul(node.deal_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  184. node.sgfh_tp = this.ctx.helper.mul(node.sgfh_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  185. node.sjcl_tp = this.ctx.helper.mul(node.sjcl_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  186. node.qtcl_tp = this.ctx.helper.mul(node.qtcl_qty, node.unit_price, this.ctx.tender.info.decimal.tp);
  187. node.total_price = this.ctx.helper.mul(node.quantity, node.unit_price, this.ctx.tender.info.decimal.tp);
  188. }
  189. }
  190. calculateAll(dealBills) {
  191. this.recursiveCalculate(dealBills, this.parent);
  192. }
  193. }
  194. class loadLedgerGclTree extends loadGclBaseTree {
  195. gather(source, parent) {
  196. const node = this.addNode(source, parent);
  197. node.deal_qty = this.ctx.helper.add(node.deal_qty, source.deal_qty);
  198. node.sgfh_qty = this.ctx.helper.add(node.sgfh_qty, source.sgfh_qty);
  199. node.qtcl_qty = this.ctx.helper.add(node.qtcl_qty, source.qtcl_qty);
  200. node.sjcl_qty = this.ctx.helper.add(node.sjcl_qty, source.sjcl_qty);
  201. node.quantity = this.ctx.helper.add(node.quantity, source.quantity);
  202. return node;
  203. }
  204. getUpdateData() {
  205. const update = [];
  206. if (this.items.length > 0) update.push({id: this.parent.id, ledger_id: this.parent.ledger_id, is_leaf: 0});
  207. const create = [];
  208. for (const i of this.items) {
  209. create.push({
  210. id: i.id, tender_id: i.tender_id, ledger_id: i.ledger_id, ledger_pid: i.ledger_pid,
  211. level: i.level, order: i.order, full_path: i.full_path, is_leaf: !i.children || i.children.length === 0,
  212. b_code: i.b_code, name: i.name, unit: i.unit, unit_price: i.unit_price || 0,
  213. deal_qty: i.deal_qty, deal_tp: i.deal_tp || 0,
  214. sgfh_qty: i.sgfh_qty, sjcl_qty: i.sjcl_qty, qtcl_qty: i.qtcl_qty, quantity: i.quantity,
  215. sgfh_tp: i.sgfh_tp || 0, sjcl_tp: i.sjcl_tp || 0, qtcl_tp: i.qtcl_tp || 0, total_price: i.total_price || 0,
  216. });
  217. }
  218. return {update, create};
  219. }
  220. }
  221. class updateReviseGclTree extends loadGclBaseTree {
  222. constructor(ctx, setting) {
  223. super(ctx, setting);
  224. this.errors = [];
  225. }
  226. loadBase(datas, pos) {
  227. datas.sort((x, y) => { return x.level === y.level ? x.order - y.order : x.level - y.level; });
  228. const Index = {};
  229. for (const d of datas) {
  230. const parent = this.parent.ledger_id === d.ledger_pid ? this.parent : Index[d.ledger_pid];
  231. if (!parent) continue;
  232. if (!parent.children) parent.children = [];
  233. const relaPos = pos.filter(x => {return x.lid === d.id});
  234. const baseNode = {
  235. id: d.id,
  236. ledger_id: d.ledger_id,
  237. ledger_pid: d.ledger_pid,
  238. level: d.level,
  239. is_leaf: d.is_leaf,
  240. full_path: d.full_path,
  241. b_code: d.b_code,
  242. name: d.name,
  243. unit: d.unit,
  244. unit_price: d.unit_price,
  245. org_deal_qty: d.deal_qty || 0,
  246. org_sgfh_qty: d.sgfh_qty || 0,
  247. org_sjcl_qty: d.sjcl_qty || 0,
  248. org_qtcl_qty: d.qtcl_qty || 0,
  249. org_qty: d.quantity || 0,
  250. org_order: d.order,
  251. sgfh_qty: 0,
  252. sjcl_qty: 0,
  253. qtcl_qty: 0,
  254. quantity: 0,
  255. hasPos: relaPos.length > 0,
  256. };
  257. parent.children.push(baseNode);
  258. Index[baseNode.ledger_id] = baseNode;
  259. this.baseNodes.push(baseNode);
  260. }
  261. }
  262. gather(source, parent) {
  263. const node = this.ignoreParent ? this.addNodeWithoutParent(source) : this.addNode(source, parent);
  264. node.deal_qty = this.ctx.helper.add(node.deal_qty, source.deal_qty);
  265. node.sgfh_qty = this.ctx.helper.add(node.sgfh_qty, source.sgfh_qty);
  266. node.qtcl_qty = this.ctx.helper.add(node.qtcl_qty, source.qtcl_qty);
  267. node.sjcl_qty = this.ctx.helper.add(node.sjcl_qty, source.sjcl_qty);
  268. node.quantity = this.ctx.helper.add(node.quantity, source.quantity);
  269. return node;
  270. }
  271. getUpdateData() {
  272. const result = {update: [], errors: [], create: []};
  273. if (this.baseNodes.length === 0) {
  274. if (this.items.length > 0) result.update.push({id: this.parent.id, ledger_id: this.parent.ledger_id, is_leaf: 0});
  275. } else {
  276. for (const bn of this.baseNodes) {
  277. if (bn.children && bn.children.length > 0) {
  278. if (bn.order !== bn.org_order) {
  279. result.update.push({
  280. id: bn.id, ledger_id: bn.ledger_id, order: bn.order,
  281. });
  282. }
  283. continue;
  284. }
  285. if (bn.deal_qty < bn.org_deal_qty || bn.sjcl_qty < bn.org_sjcl_qty || bn.qtcl_qty < bn.org_qtcl_qty || bn.sgfh_qty < bn.org_sgfh_qty) {
  286. result.errors.push({
  287. ledger_id: bn.ledger_id,
  288. b_code: bn.b_code, name: bn.name, unit: bn.unit,
  289. deal_qty: bn.deal_qty, sgfh_qty: bn.sgfh_qty, sjcl_qty: bn.sjcl_qty, qtcl_qty: bn.qtcl_qty, qty: bn.quantity, type: 'less',
  290. });
  291. if (bn.order !== bn.org_order) {
  292. result.update.push({
  293. id: bn.id, ledger_id: bn.ledger_id, order: bn.order,
  294. });
  295. }
  296. } else if (bn.sjcl_qty !== bn.org_sjcl_qty || bn.qtcl_qty !== bn.org_qtcl_qty || bn.sgfh_qty !== bn.org_sgfh_qty) {
  297. result.update.push({
  298. id: bn.id, ledger_id: bn.ledger_id, unit_price: bn.unit_price || 0, order: bn.order,
  299. deal_qty: bn.deal_qty, deal_tp: bn.deal_tp || 0,
  300. sgfh_qty: bn.sgfh_qty, sjcl_qty: bn.sjcl_qty, qtcl_qty: bn.qtcl_qty, quantity: bn.quantity,
  301. sgfh_tp: bn.sgfh_tp || 0, sjcl_tp: bn.sjcl_tp || 0, qtcl_tp: bn.qtcl_tp || 0, total_price: bn.total_price || 0,
  302. });
  303. } else if (bn.order !== bn.org_order) {
  304. result.update.push({
  305. id: bn.id, ledger_id: bn.ledger_id, order: bn.order,
  306. });
  307. }
  308. }
  309. }
  310. for (const i of this.items) {
  311. result.create.push({
  312. id: i.id, tender_id: i.tender_id, ledger_id: i.ledger_id, ledger_pid: i.ledger_pid,
  313. level: i.level, order: i.order, full_path: i.full_path, is_leaf: !i.children || i.children.length === 0,
  314. b_code: i.b_code, name: i.name, unit: i.unit, unit_price: i.unit_price || 0,
  315. deal_qty: i.deal_qty, deal_tp: i.deal_tp || 0,
  316. sgfh_qty: i.sgfh_qty, sjcl_qty: i.sjcl_qty, qtcl_qty: i.qtcl_qty, quantity: i.quantity,
  317. sgfh_tp: i.sgfh_tp || 0, sjcl_tp: i.sjcl_tp || 0, qtcl_tp: i.qtcl_tp || 0, total_price: i.total_price || 0,
  318. });
  319. }
  320. return result;
  321. }
  322. }
  323. class gatherStageGclTree extends loadGclBaseTree {
  324. constructor(ctx, setting) {
  325. super(ctx, setting);
  326. this.cover = setting.cover;
  327. this.settleStatus = this.ctx.service.settle.settleStatus;
  328. }
  329. loadBase(datas, pos) {
  330. datas.sort((x, y) => { return x.level === y.level ? x.order - y.order : x.level - y.level; });
  331. const Index = {};
  332. for (const d of datas) {
  333. const parent = this.parent.ledger_id === d.ledger_pid ? this.parent : Index[d.ledger_pid];
  334. if (!parent) continue;
  335. if (!parent.children) parent.children = [];
  336. const relaPos = pos.filter(x => {return x.lid === d.id});
  337. const baseNode = {
  338. id: d.id,
  339. is_import: d.is_import,
  340. ledger_id: d.ledger_id,
  341. ledger_pid: d.ledger_pid,
  342. level: d.level,
  343. is_leaf: d.is_leaf,
  344. full_path: d.full_path,
  345. b_code: d.b_code,
  346. name: d.name,
  347. unit: d.unit,
  348. unit_price: d.unit_price,
  349. org_contract_qty: d.contract_qty || 0,
  350. org_contract_tp: d.contract_tp || 0,
  351. org_qc_qty: d.qc_qty || 0,
  352. org_qc_tp: d.qc_tp || 0,
  353. org_qc_minus_qty: d.qc_minus_qty || 0,
  354. org_positive_qc_qty: d.positive_qc_qty || 0,
  355. org_positive_qc_tp: d.positive_qc_tp || 0,
  356. org_negative_qc_qty: d.negative_qc_qty || 0,
  357. org_negative_qc_tp: d.negative_qc_tp || 0,
  358. org_order: d.order,
  359. contract_qty: 0,
  360. contract_tp: 0,
  361. qc_qty: 0,
  362. qc_tp: 0,
  363. is_tp: d.is_tp,
  364. hasPos: relaPos.length > 0,
  365. };
  366. parent.children.push(baseNode);
  367. Index[baseNode.ledger_id] = baseNode;
  368. this.baseNodes.push(baseNode);
  369. }
  370. }
  371. _gatherChange(node, source) {
  372. if (!source.change_detail || source.change_detail.length === 0) return;
  373. if (!node.change_detail) node.change_detail = [];
  374. for (const cd of source.change_detail) {
  375. if (!cd.qty) continue;
  376. node.change_detail.push(cd);
  377. }
  378. }
  379. gather(source, parent) {
  380. parent = parent ? parent : this.parent;
  381. const checkFun = function (node, source) {
  382. return (source.is_tp && node.is_tp) || (!source.is_tp && !node.is_tp);
  383. };
  384. const node = this.ignoreParent ? this.addNodeWithoutParent(source, checkFun) : this.addNode(source, parent, checkFun);
  385. if (node.settle_status === this.settleStatus.finish) return node;
  386. if (node.is_tp) {
  387. node.contract_tp = this.ctx.helper.add(node.contract_tp, source.contract_tp);
  388. } else {
  389. node.contract_qty = this.ctx.helper.add(node.contract_qty, source.contract_qty);
  390. node.contract_tp = this.ctx.helper.mul(node.unit_price, node.contract_qty, this.ctx.tender.info.decimal.tp);
  391. if (this.loadChange) {
  392. node.qc_qty = this.ctx.helper.add(node.qc_qty, source.qc_qty);
  393. node.qc_tp = this.ctx.helper.mul(node.unit_price, node.qc_qty, this.ctx.tender.info.decimal.tp);
  394. node.qc_minus_qty = this.ctx.helper.add(node.qc_minus_qty, source.qc_minus_qty);
  395. node.positive_qc_qty = this.ctx.helper.add(node.positive_qc_qty, source.positive_qc_qty);
  396. node.positive_qc_tp = this.ctx.helper.mul(node.unit_price, node.positive_qc_qty, this.ctx.tender.info.decimal.tp);
  397. node.negative_qc_qty = this.ctx.helper.add(node.negative_qc_qty, source.negative_qc_qty);
  398. node.negative_qc_tp = this.ctx.helper.mul(node.unit_price, node.negative_qc_qty, this.ctx.tender.info.decimal.tp);
  399. }
  400. }
  401. if (this.loadChange) this._gatherChange(node, source);
  402. return node;
  403. }
  404. getUpdateData() {
  405. const result = { update: [], errors: [], qc_detail: [] };
  406. for (const bn of this.baseNodes) {
  407. if (!this.cover && !bn.is_import && !bn.contract_qty && !bn.qc_qty && !bn.contract_tp && !bn.qc_minus_qty) continue;
  408. if (!bn.is_import && bn.org_qc_qty !== 0 && bn.qc_qty !== 0) {
  409. result.errors.push({ b_code: bn.b_code, name: bn.name, unit: bn.unit, qc_qty: bn.qc_qty, qc_minus_qty: bn.qc_minus_qty, ledger_id: bn.ledger_id, type: 'qc-conflict'});
  410. continue;
  411. }
  412. if (bn.is_import || this.cover || bn.contract_qty !== bn.org_contract_qty || bn.contract_tp !== bn.org_contract_tp || bn.qc_qty !== bn.org_qc_qty || bn.qc_minus_qty !== bn.org_qc_minus_qty) {
  413. let data = { lid: bn.id, contract_qty: bn.contract_qty, contract_tp: bn.contract_tp };
  414. if (!this.loadChange || (!bn.is_import && bn.org_qc_qty)) {
  415. data.qc_qty = bn.org_qc_qty;
  416. data.qc_tp = bn.org_qc_tp;
  417. data.qc_minus_qty = bn.org_qc_minus_qty || 0;
  418. data.positive_qc_qty = bn.org_positive_qc_qty || 0;
  419. data.positive_qc_tp = bn.org_positive_qc_tp || 0;
  420. data.negative_qc_qty = bn.org_negative_qc_qty || 0;
  421. data.negative_qc_tp = bn.org_negative_qc_tp || 0;
  422. } else {
  423. data.qc_qty = bn.qc_qty;
  424. data.qc_tp = bn.qc_tp;
  425. data.qc_minus_qty = bn.qc_minus_qty || 0;
  426. data.positive_qc_qty = bn.positive_qc_qty || 0;
  427. data.positive_qc_tp = bn.positive_qc_tp || 0;
  428. data.negative_qc_qty = bn.negative_qc_qty || 0;
  429. data.negative_qc_tp = bn.negative_qc_tp || 0;
  430. }
  431. result.update.push(data);
  432. }
  433. if (this.loadChange && bn.change_detail && bn.change_detail.length > 0) {
  434. for (const cd of bn.change_detail) {
  435. result.qc_detail.push({
  436. lid: bn.id, rela_tid: cd.tid, rela_sid: cd.sid, rela_lid: cd.lid, rela_cid: cd.cid, rela_cbid: cd.cbid, rela_qty: cd.qty, rela_minus: cd.minus, rela_no_value: cd.no_value, unit_price: bn.unit_price,
  437. });
  438. }
  439. }
  440. }
  441. if (!this.ignoreNotFind) {
  442. for (const i of this.items) {
  443. result.errors.push({ b_code: i.b_code, name: i.name, unit: i.unit, qty: i.contract_qty, qc_qty: i.qc_qty, qc_minus_qty: i.qc_minus_qty, type: 'miss' });
  444. }
  445. }
  446. return result;
  447. }
  448. }
  449. class sumLoad {
  450. constructor(ctx) {
  451. this.ctx = ctx;
  452. }
  453. recusiveLoadGatherGcl(node, parent, ignoreParent = false, match = false) {
  454. const loadMatch = match || node.match || (parent && parent.match);
  455. const isLeaf = !node.children || node.children.length === 0;
  456. const cur = loadMatch && (!ignoreParent || isLeaf) && node.b_code ? this.loadTree.gather(node, parent) : parent;
  457. if (isLeaf) return;
  458. for (const child of node.children) {
  459. this.recusiveLoadGatherGcl(child, cur, ignoreParent, loadMatch);
  460. }
  461. }
  462. async loadGatherGcl(select, maxId, tenders, defaultData, subUp) {
  463. this.loadTree = new loadLedgerGclTree(this.ctx, {
  464. parent: select, maxId, type: 'ledger', defaultData, subUp,
  465. });
  466. for (const tender of tenders) {
  467. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  468. const billsTree = new Ledger.billsTree(this.ctx, {
  469. id: 'ledger_id',
  470. pid: 'ledger_pid',
  471. order: 'order',
  472. level: 'level',
  473. rootId: -1,
  474. keys: ['id', 'tender_id', 'ledger_id'],
  475. stageId: 'id',
  476. });
  477. billsTree.loadDatas(billsData);
  478. billsTree.nodes.forEach(x => {
  479. x.match = tender.match_code ? x.code === tender.match_code : true;
  480. });
  481. for (const top of billsTree.children) {
  482. if ([1].indexOf(top.node_type) < 0) continue;
  483. this.recusiveLoadGatherGcl(top, null);
  484. }
  485. }
  486. this.loadTree.resortByCode();
  487. const dealBills = await this.ctx.service.dealBills.getAllDataByCondition({ where: { tender_id: this.ctx.tender.id } });
  488. this.loadTree.calculateAll(dealBills);
  489. return this.loadTree;
  490. }
  491. async updateGatherGcl(select, maxId, tenders, defaultData) {
  492. const ignoreParent = this.ctx.tender.info.fun_rela.sum_load.ignoreParent;
  493. this.loadTree = new updateReviseGclTree(this.ctx, {
  494. parent: select, maxId, type: 'ledger', defaultData, ignoreParent,
  495. });
  496. const posterity = await this.ctx.service.reviseBills.getPosterityByParentId(this.ctx.tender.id, select.ledger_id);
  497. const pos = await this.ctx.service.revisePos.getData(this.ctx.tender.id);
  498. this.loadTree.loadBase(posterity, pos);
  499. for (const tender of tenders) {
  500. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  501. const billsTree = new Ledger.billsTree(this.ctx, {
  502. id: 'ledger_id',
  503. pid: 'ledger_pid',
  504. order: 'order',
  505. level: 'level',
  506. rootId: -1,
  507. keys: ['id', 'tender_id', 'ledger_id'],
  508. stageId: 'id',
  509. });
  510. billsTree.loadDatas(billsData);
  511. billsTree.nodes.forEach(x => {
  512. x.match = tender.match_code ? x.code === tender.match_code : true;
  513. });
  514. for (const top of billsTree.children) {
  515. if ([1].indexOf(top.node_type) < 0) continue;
  516. this.recusiveLoadGatherGcl(top, null, ignoreParent);
  517. }
  518. }
  519. this.loadTree.resortByCode();
  520. const dealBills = await this.ctx.service.dealBills.getAllDataByCondition({ where: { tender_id: this.ctx.tender.id } });
  521. this.loadTree.calculateAll(dealBills);
  522. return this.loadTree;
  523. }
  524. _loadCurStageAndChange(billsData, curStageBills, curStageChange) {
  525. const billsIndex = {};
  526. for (const b of billsData) {
  527. billsIndex[b.id] = b;
  528. }
  529. for (const csb of curStageBills) {
  530. const b = billsIndex[csb.lid];
  531. if (!b) continue;
  532. b.contract_qty = csb.contract_qty;
  533. b.contract_tp = csb.contract_tp;
  534. b.qc_qty = csb.qc_qty;
  535. b.qc_minus_qty = csb.qc_minus_qty;
  536. b.positive_qc_qty = csb.positive_qc_qty;
  537. b.negative_qc_qty = csb.negative_qc_qty;
  538. }
  539. for (const csc of curStageChange) {
  540. if (!csc.qty) continue;
  541. const b = billsIndex[csc.lid];
  542. if (!b) continue;
  543. if (!b.change_detail) b.change_detail = [];
  544. let c = b.change_detail.find(x => { return x.cbid === csc.cbid });
  545. if (!c) {
  546. c = { tid: csc.tid, sid: csc.sid, cid: csc.cid, cbid: csc.cbid, lid: csc.lid, c_code: csc.c_code, minus: csc.minus, no_value: csc.no_value };
  547. b.change_detail.push(c);
  548. }
  549. c.qty = this.ctx.helper.add(c.qty, csc.qty);
  550. }
  551. }
  552. async stageGatherGcl(select, maxId, tenders, defaultData, cover, ignore, loadChange) {
  553. const ignoreParent = this.ctx.tender.info.fun_rela.sum_load.ignoreParent;
  554. this.loadTree = new gatherStageGclTree(this.ctx, {
  555. parent: select, maxId, type: 'ledger', defaultData, ignoreParent, cover, ignoreNotFind: ignore, loadChange
  556. });
  557. const posterity = await this.ctx.service.ledger.getPosterityByParentId(this.ctx.tender.id, select.ledger_id);
  558. const extraData = await this.ctx.service.ledgerExtra.getData(this.ctx.tender.id, ['is_tp']);
  559. const stageBills = await this.ctx.service.stageBills.getLastestStageData2(this.ctx.tender.id, this.ctx.stage.id);
  560. const importLid = await this.ctx.service.stageImportChange.getLeafXmjImportLid(this.ctx.stage.id, select.id);
  561. const settleStatusBills = this.ctx.stage.readySettle ? await this.ctx.service.settleBills.getAllDataByCondition({ where: { settle_id: this.ctx.stage.readySettle.id }}) : [];
  562. this.ctx.helper.assignRelaData(posterity, [
  563. { data: extraData, fields: ['is_tp'], prefix: '', relaId: 'id' },
  564. { data: importLid, fields: ['is_import'], prefix: '', relaId: 'lid' },
  565. { data: stageBills, fields: ['contract_qty', 'contract_tp', 'qc_qty', 'qc_tp', 'qc_minus_qty', 'positive_qc_qty', 'positive_qc_tp', 'negative_qc_qty', 'negative_qc_tp'], prefix: '', relaId: 'lid' },
  566. { data: settleStatusBills, fields: ['settle_status'], prefix: '', relaId: 'lid' },
  567. ]);
  568. const pos = await this.ctx.service.pos.getAllDataByCondition({ where: { tid: this.ctx.tender.id } });
  569. const settleStatusPos = this.ctx.stage.readySettle ? await this.ctx.service.settlePos.getAllDataByCondition({ where: { settle_id: this.ctx.stage.readySettle.id }}) : [];
  570. this.ctx.helper.assignRelaData(pos, [
  571. { data: settleStatusPos, fields: ['settle_status'], prefix: '', relaId: 'pid' },
  572. ]);
  573. this.loadTree.loadBase(posterity, pos);
  574. for (const tender of tenders) {
  575. if (!tender.stage) continue;
  576. const billsData = await this.ctx.service.ledger.getData(tender.tid);
  577. const billsExtraData = await this.ctx.service.ledgerExtra.getData(tender.tid, ['is_tp']);
  578. this.ctx.helper.assignRelaData(billsData, [
  579. { data: billsExtraData, fields: ['is_tp'], prefix: '', relaId: 'id' },
  580. ]);
  581. const stage = await this.ctx.service.stage.getDataByCondition({tid: tender.tid, order: tender.stage});
  582. if (!stage) throw '选择的期不存在';
  583. const curStageData = await this.ctx.service.stageBills.getLastestStageData2(tender.tid, stage.id);
  584. const curStageChange = stage.status === auditConst.stage.status.checked
  585. ? await this.ctx.service.stageChangeFinal.getSumLoadFinalData(stage.id)
  586. : await this.ctx.service.stageChange.getSumLoadFinalData(stage.id);
  587. this._loadCurStageAndChange(billsData, curStageData, curStageChange);
  588. const billsTree = new Ledger.billsTree(this.ctx, {
  589. id: 'ledger_id',
  590. pid: 'ledger_pid',
  591. order: 'order',
  592. level: 'level',
  593. rootId: -1,
  594. keys: ['id', 'tender_id', 'ledger_id'],
  595. stageId: 'id',
  596. });
  597. billsTree.loadDatas(billsData);
  598. billsTree.nodes.forEach(x => {
  599. x.match = tender.match_code ? x.code === tender.match_code : true;
  600. });
  601. for (const top of billsTree.children) {
  602. if ([1].indexOf(top.node_type) < 0) continue;
  603. this.recusiveLoadGatherGcl(top, null, ignoreParent);
  604. }
  605. }
  606. return this.loadTree;
  607. }
  608. }
  609. module.exports = sumLoad;