gcl_gather.js 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341
  1. 'use strict';
  2. /**
  3. *
  4. * 清单汇总
  5. *
  6. * @author Mai
  7. * @date
  8. * @version
  9. */
  10. const mergeChar = ';';
  11. const Ledger = require('./ledger');
  12. const gclGatherModel = class {
  13. /**
  14. * 构造函数
  15. *
  16. * @param {Object} ctx - egg 全局变量
  17. */
  18. constructor(ctx) {
  19. this.ctx = ctx;
  20. this._ = ctx.helper._;
  21. // mainData
  22. this.billsTree = new Ledger.billsTree(this.ctx, {
  23. id: 'ledger_id',
  24. pid: 'ledger_pid',
  25. order: 'order',
  26. level: 'level',
  27. rootId: -1,
  28. keys: ['id', 'tender_id', 'ledger_id']
  29. });
  30. this.pos = new Ledger.pos({
  31. id: 'id', ledgerId: 'lid', order: 'order'
  32. });
  33. }
  34. /**
  35. * 根据node新增工程量清单
  36. *
  37. * @param {Object}} node
  38. * @returns {Object}
  39. */
  40. newGclNode(node) {
  41. const gcl = {
  42. id: this.gclList.length + 1,
  43. b_code: node.b_code,
  44. name: node.name,
  45. unit: node.unit,
  46. unit_price: node.unit_price,
  47. leafXmjs: [],
  48. };
  49. this.gclList.push(gcl);
  50. return gcl;
  51. }
  52. /**
  53. * 获取node对应的工程量清单
  54. *
  55. * @param {Object} node
  56. * @returns {Object}
  57. */
  58. getGclNode(node) {
  59. const helper = this.ctx.helper;
  60. const gcl = this.gclList.find(function (g) {
  61. return g.b_code === node.b_code &&
  62. (g.name || node.name ? g.name === node.name : true) &&
  63. (g.unit || node.unit ? g.unit === node.unit : true) &&
  64. helper.checkZero(helper.sub(g.unit_price, node.unit_price));
  65. });
  66. if (gcl) {
  67. return gcl;
  68. } else {
  69. return this.newGclNode(node);
  70. }
  71. }
  72. /**
  73. * 检查 text 是否是Peg
  74. * e.g. K123+000(true) Kab+123(false) K123.234+234(false) K12+324.234(true)
  75. *
  76. * @param text
  77. * @returns {*}
  78. * @constructor
  79. */
  80. CheckPeg(text) {
  81. const pegReg = /[a-zA-Z]?[kK][0-9]+[++][0-9]{3}([.][0-9]+)?/;
  82. return pegReg.test(text);
  83. }
  84. /**
  85. * 基于node向上查找桩号节点(特别的,对于路基工程等,桩号节点应该在计量单元中)
  86. *
  87. * @param {Object} node - 清单树节点
  88. */
  89. getPegNode(node) {
  90. if (node) {
  91. if (this.CheckPeg(node.name)) {
  92. return node;
  93. } else {
  94. const parent = this.billsTree.getParent(node);
  95. return parent ? this.getPegNode(parent) : null;
  96. }
  97. }
  98. }
  99. /**
  100. * 获取节点的第N层父节点
  101. *
  102. * @param node - 节点(检索起点)
  103. * @param level - 第N层
  104. * @returns {*}
  105. */
  106. getNodeByLevel(node, level) {
  107. let cur = node;
  108. while (cur && cur.level > level) {
  109. cur = this.billsTree.getParent(cur);
  110. }
  111. return cur;
  112. }
  113. /**
  114. * 获取 单位工程
  115. *
  116. * @param xmj - 计量单元(最底层项目节)
  117. * @returns {string}
  118. */
  119. getDwgc(peg, xmj) {
  120. if (peg) {
  121. return peg.name;
  122. } else {
  123. const node = this.getNodeByLevel(xmj, 2);
  124. return node ? node.name : '';
  125. }
  126. }
  127. /**
  128. * 获取 分部工程
  129. *
  130. * @param peg - 桩号节点
  131. * @param xmj - 计量单元(最底层项目节)
  132. * @returns {string}
  133. */
  134. getFbgc(peg, xmj) {
  135. if (peg && peg.id !== xmj.id) {
  136. const node = this.getNodeByLevel(xmj, peg.level + 1);
  137. return node ? node.name : '';
  138. } else {
  139. const node = this.getNodeByLevel(xmj, 3);
  140. return node ? node.name : '';
  141. }
  142. }
  143. /**
  144. * 获取 分项工程
  145. *
  146. * @param peg - 桩号节点
  147. * @param xmj - 计量单元(最底层项目节)
  148. * @returns {string}
  149. */
  150. getFxgc (peg, xmj) {
  151. if (!peg) {
  152. const node = this.getNodeByLevel(xmj, 4);
  153. return node ? node.name : '';
  154. } else if (peg.id === xmj.id) {
  155. if (xmj.level > 4) {
  156. let value = '';
  157. for (let level = 4; level < xmj.level; level++) {
  158. const node = this.getNodeByLevel(xmj, level);
  159. value = value === '' ? node.name : value + mergeChar + node.name;
  160. }
  161. return value;
  162. } else {
  163. return '';
  164. }
  165. } else {
  166. if (peg.level + 2 < xmj.level) {
  167. let value = '';
  168. for (let level = peg.level + 2; level < xmj.level; level++) {
  169. const node = this.getNodeByLevel(xmj, level);
  170. value = value === '' ? node.name : value + mergeChar + node.name;
  171. }
  172. return value;
  173. } else {
  174. return '';
  175. }
  176. }
  177. }
  178. /**
  179. * 生成缓存数据(缓存仅为了不用每次都运算分部工程等)
  180. *
  181. * @param {Object}} leafXmj - 清单树节点
  182. * @returns {Object} 最底层项目节缓存数据
  183. */
  184. newCacheLeafXmj(leafXmj) {
  185. const peg = this.getPegNode(leafXmj);
  186. const cacheLX = {
  187. id: leafXmj.id,
  188. code: leafXmj.code,
  189. jldy: leafXmj.name,
  190. fbgc: this.getFbgc(peg, leafXmj),
  191. fxgc: this.getFxgc(peg, leafXmj),
  192. dwgc: this.getDwgc(peg, leafXmj),
  193. drawing_code: leafXmj.drawing_code,
  194. };
  195. this.leafXmjs.push(cacheLX);
  196. return cacheLX;
  197. }
  198. /**
  199. * 获取缓存数据(有缓存则直接读取,无则生成缓存)
  200. *
  201. * @param {Object} leafXmj - 最底层项目节
  202. * @returns {Object} 最底层项目缓存数据
  203. */
  204. getCacheLeafXmj(leafXmj) {
  205. const cacheLX = this.leafXmjs.find(lx => { return lx.id === leafXmj.id; });
  206. if (!cacheLX) {
  207. return this.newCacheLeafXmj(leafXmj);
  208. } else {
  209. return cacheLX;
  210. }
  211. }
  212. /**
  213. * 汇总工程量清单数据
  214. *
  215. * @param {Object} node 最底层工程量清单树节点
  216. * @param {*} leafXmj node所属的最底层项目节
  217. */
  218. loadGatherGclNode(node, leafXmj) {
  219. const helper = this.ctx.helper;
  220. const gcl = this.getGclNode(node);
  221. for (const prop in node) {
  222. if (prop === 'quantity' || prop === 'total_price' || prop.indexOf('qty') >= 0 || prop.indexOf('tp') >= 0) {
  223. gcl[prop] = this.ctx.helper.add(gcl[prop], node[prop]);
  224. }
  225. }
  226. const cacheLeafXmj = this.getCacheLeafXmj(leafXmj);
  227. const posRange = this.pos.getLedgerPos(node.id);
  228. const loadLeafXmj = function (detail, calcSource) {
  229. const dx = helper._.assign({}, cacheLeafXmj);
  230. dx.gcl_id = gcl.id;
  231. dx.org_gcl_id = node.id;
  232. // dx.org_gcl_id = gcl.id;
  233. // dx.gcl_id = node.id;
  234. if (detail.name !== node.name) {
  235. dx.bwmx = detail.name;
  236. dx.mx_id = detail.id;
  237. }
  238. if (detail.drawing_code) {
  239. dx.drawing_code = detail.drawing_code;
  240. }
  241. for (const prop in calcSource) {
  242. if (prop === 'quantity' || prop.indexOf('qty') > 0) dx[prop] = calcSource[prop];
  243. }
  244. gcl.leafXmjs.push(dx);
  245. };
  246. if (posRange && posRange.length > 0) {
  247. for (const pr of posRange) {
  248. loadLeafXmj(pr, pr);
  249. }
  250. } else {
  251. loadLeafXmj(leafXmj, node);
  252. }
  253. }
  254. /**
  255. * 递归生成工程量清单汇总数据
  256. *
  257. * @param {Array<Object>} nodes 清单子节点
  258. * @param {Object} leafXmj 最底层项目节
  259. */
  260. recursiveGatherGclData(nodes, leafXmj) {
  261. for (const node of nodes) {
  262. if (node.b_code) {
  263. if (node.children.length > 0) {
  264. this.recursiveGatherGclData(node.children, leafXmj);
  265. } else {
  266. this.loadGatherGclNode(node, leafXmj);
  267. }
  268. } else if (node.children.length > 0) {
  269. this.recursiveGatherGclData(node.children, node);
  270. }
  271. }
  272. }
  273. gatherDealBillsData(deal) {
  274. if (deal && deal.length > 0) {
  275. for (const node of deal) {
  276. node.b_code = node.code;
  277. const gcl = this.getGclNode(node);
  278. if (!node.quantity || !node.unit_price) continue;
  279. gcl.deal_bills_qty = node.quantity;
  280. gcl.deal_bills_tp = node.total_price;
  281. }
  282. }
  283. }
  284. convertResultData() {
  285. this.leafXmjs = [];
  286. for (const gcl of this.gclList) {
  287. if (gcl.leafXmjs.length === 0) return;
  288. for (const lx of gcl.leafXmjs) {
  289. this.leafXmjs.push(lx);
  290. }
  291. }
  292. }
  293. /**
  294. * 汇总
  295. *
  296. * @param {Array<Object>} bills 清单数据
  297. * @param {Array<Object>} pos 计量单元数据
  298. */
  299. gather(bills, pos, deal) {
  300. const helper = this.ctx.helper;
  301. this.billsTree.loadDatas(bills);
  302. this.pos.loadDatas(pos);
  303. this.gclList = [];
  304. this.leafXmjs = [];
  305. this.recursiveGatherGclData(this.billsTree.children, null);
  306. this.gatherDealBillsData(deal);
  307. this.gclList.sort(function (a, b) {
  308. return helper.compareCode(a.b_code, b.b_code);
  309. });
  310. this.convertResultData();
  311. return [this.gclList, this.leafXmjs];
  312. }
  313. };
  314. module.exports = {
  315. gclGather: gclGatherModel,
  316. };