gcl_gather.js 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355
  1. 'use strict';
  2. /**
  3. * 清单汇总(需使用path_tree.js, lodash.js)
  4. *
  5. * @author Mai
  6. * @date
  7. * @version
  8. */
  9. const gclGatherModel = (function () {
  10. // 需要汇总计算的字段
  11. const ledgerGatherFields = ['quantity', 'total_price', 'deal_qty', 'deal_tp',
  12. 'contract_qty', 'contract_tp', 'qc_qty', 'qc_tp', 'gather_qty', 'gather_tp',
  13. 'end_contract_qty', 'end_contract_tp', 'end_qc_qty', 'end_qc_tp', 'end_gather_qty', 'end_gather_tp'];
  14. const posGatherFields = ['quantity', 'contract_qty', 'qc_qty', 'gather_qty', 'end_contract_qty', 'end_qc_qty', 'end_gather_qty'];
  15. // 初始化 清单树
  16. const gsTreeSetting = {
  17. id: 'ledger_id',
  18. pid: 'ledger_pid',
  19. order: 'order',
  20. level: 'level',
  21. rootId: -1,
  22. keys: ['id', 'tender_id', 'ledger_id'],
  23. stageId: 'id',
  24. };
  25. gsTreeSetting.updateFields = ['contract_qty', 'contract_tp', 'qc_qty', 'qc_tp'];
  26. gsTreeSetting.calcFields = ['deal_tp', 'total_price', 'contract_tp', 'qc_tp', 'gather_tp', 'end_contract_tp', 'end_qc_tp', 'end_gather_tp'];
  27. gsTreeSetting.calcFun = function (node) {
  28. if (node.children && node.children.length === 0) {
  29. node.gather_qty = ZhCalc.plus(node.contract_qty, node.qc_qty);
  30. node.end_contract_qty = ZhCalc.plus(node.pre_contract_qty, node.contract_qty);
  31. node.end_qc_qty = ZhCalc.plus(node.pre_qc_qty, node.qc_qty);
  32. node.end_gather_qty = ZhCalc.plus(node.pre_gather_qty, node.gather_qty);
  33. }
  34. node.gather_tp = ZhCalc.plus(node.contract_tp, node.qc_tp);
  35. node.end_contract_tp = ZhCalc.plus(node.pre_contract_tp, node.contract_tp);
  36. node.end_qc_tp = ZhCalc.plus(node.pre_qc_tp, node.qc_tp);
  37. node.end_gather_tp = ZhCalc.plus(node.pre_gather_tp, node.gather_tp);
  38. node.dgn_price = ZhCalc.round(ZhCalc.divide(node.total_price, node.dgn_qty1), 2);
  39. };
  40. const gsTree = createNewPathTree('stage', gsTreeSetting);
  41. // 初始化 部位明细
  42. const posSetting = {
  43. id: 'id', ledgerId: 'lid',
  44. updateFields: ['contract_qty', 'qc_qty'],
  45. };
  46. posSetting.calcFun = function (pos) {
  47. pos.gather_qty = ZhCalc.plus(pos.contract_qty, pos.qc_qty);
  48. };
  49. const gsPos = new StagePosData(posSetting);
  50. const gclList = [], leafXmjs = [];
  51. /**
  52. * 将所有数据加载至树结构
  53. *
  54. * @param ledger - 台账数据
  55. * @param curStage - 当期计量数据
  56. * @param preStage - 截止上期计量数据
  57. * @param bgl - 变更令数据
  58. */
  59. function loadLedgerData (ledger, curStage, preStage, bgl) {
  60. // 加载树结构数据
  61. gsTree.loadDatas(ledger);
  62. // 加载本期计量数据
  63. if (curStage) {
  64. gsTree.loadCurStageData(curStage);
  65. }
  66. // todo 加载截止上期计量数据
  67. // todo 加载变更令数据
  68. // 根据设置 计算 台账树结构
  69. treeCalc.calculateAll(gsTree);
  70. }
  71. function loadPosData(pos, curPos, prePos) {
  72. gsPos.loadDatas(pos);
  73. gsPos.loadCurStageData(curPos);
  74. gsPos.loadPreStageData(prePos);
  75. }
  76. function gatherfields(obj, src, fields) {
  77. if (obj && src) {
  78. for (const f of fields) {
  79. obj[f] = ZhCalc.plus(obj[f], src[f]);
  80. }
  81. }
  82. }
  83. /**
  84. * 新建 清单汇总节点
  85. * @param node - 最底层 工程量清单节点
  86. * @returns {{b_code: *|string[], name, unit, unit_price: *|string[], leafXmjs: Array}}
  87. */
  88. function newGclNode(node) {
  89. const gcl = {
  90. b_code: node.b_code,
  91. name: node.name,
  92. unit: node.unit,
  93. unit_price: node.unit_price,
  94. leafXmjs: [],
  95. };
  96. gclList.push(gcl);
  97. return gcl;
  98. }
  99. /**
  100. * 获取清单汇总节点
  101. *
  102. * @param node - 最底层清单节点
  103. * @returns {*}
  104. */
  105. function getGclNode(node) {
  106. const gcl = gclList.find(function (g) {
  107. return g.b_code === node.b_code && g.name === node.name && g.unit === node.unit && checkZero(g.unit_price - node.unit_price);
  108. });
  109. if (gcl) {
  110. return gcl
  111. } else {
  112. return newGclNode(node);
  113. }
  114. }
  115. /**
  116. * 检查 text 是否是Peg
  117. * e.g. K123+000(true) Kab+123(false) K123.234+234(false) K12+324.234(true)
  118. *
  119. * @param text
  120. * @returns {*}
  121. * @constructor
  122. */
  123. function CheckPeg(text) {
  124. const pegReg = /[kK][0-9][++][0-9]{3}/;
  125. return pegReg.test(text);
  126. }
  127. /**
  128. * 获取 桩号节点
  129. * @param node - 检索起始节点
  130. * @returns {*}
  131. */
  132. function getPegNode (node) {
  133. if (node) {
  134. if (CheckPeg(node.name)) {
  135. return node;
  136. } else {
  137. const parent = gsTree.getParent(node);
  138. return parent ? getPegNode(parent) : null;
  139. }
  140. }
  141. }
  142. /**
  143. * 获取节点的第N层父节点
  144. *
  145. * @param node - 节点(检索起点)
  146. * @param level - 第N层
  147. * @returns {*}
  148. */
  149. function getNodeByLevel(node, level) {
  150. let cur = node;
  151. while (cur && cur.level > level) {
  152. cur = gsTree.getParent(cur);
  153. }
  154. return cur;
  155. }
  156. /**
  157. * 获取 单位工程
  158. *
  159. * @param xmj - 计量单元(最底层项目节)
  160. * @returns {string}
  161. */
  162. function getDwgc(xmj) {
  163. const node = getNodeByLevel(xmj, 2);
  164. return node ? node.name : '';
  165. }
  166. /**
  167. * 获取 分部工程
  168. *
  169. * @param peg - 桩号节点
  170. * @param xmj - 计量单元(最底层项目节)
  171. * @returns {string}
  172. */
  173. function getFbgc(peg, xmj) {
  174. if (peg && peg.id !== xmj.id) {
  175. const node = getNodeByLevel(xmj, peg.level + 1);
  176. return node ? node.name : '';
  177. } else {
  178. const node = getNodeByLevel(xmj, 3);
  179. return node ? node.name : '';
  180. }
  181. }
  182. /**
  183. * 获取 分项工程
  184. *
  185. * @param peg - 桩号节点
  186. * @param xmj - 计量单元(最底层项目节)
  187. * @returns {string}
  188. */
  189. function getFxgc(peg, xmj) {
  190. if (!peg) {
  191. const node = getNodeByLevel(xmj, 4);
  192. return node ? node.name : '';
  193. } else if (peg.id === xmj.id) {
  194. if (xmj.level > 4) {
  195. let value = '';
  196. for (let level = 4; level < xmj.level; level++) {
  197. const node = getNodeByLevel(xmj, level);
  198. value = value === '' ? node.name : node.name + '-' + value;
  199. }
  200. return value;
  201. } else {
  202. return '';
  203. }
  204. } else {
  205. if (peg.level - 2 > xmj.level) {
  206. let value = '';
  207. for (let level = peg.level + 2; level < xmj.level; level++) {
  208. const node = getNodeByLevel(xmj, level);
  209. value = value === '' ? node.name : node.name + '-' + value;
  210. }
  211. return value;
  212. } else {
  213. return '';
  214. }
  215. }
  216. }
  217. /**
  218. * 新建 最底层项目节 缓存数据
  219. * @param leafXmj
  220. * @returns {{id, code: *|string[], jldy, fbgc: string, fxgc: string, dwgc: string, bwmx: string, drawing_code: string}}
  221. */
  222. function newCacheLeafXmj(leafXmj) {
  223. const peg = getPegNode(leafXmj);
  224. const cacheLX = {
  225. id: leafXmj.id,
  226. code: leafXmj.code,
  227. jldy: leafXmj.name,
  228. fbgc: getFbgc(peg, leafXmj),
  229. fxgc: getFxgc(peg, leafXmj),
  230. dwgc: getDwgc(leafXmj),
  231. drawing_code: leafXmj.drawing_code,
  232. };
  233. leafXmjs.push(cacheLX);
  234. return cacheLX;
  235. }
  236. /**
  237. * 获取缓存的最底层项目节数据
  238. *
  239. * @param leafXmj - 最底层项目节
  240. * @returns {*}
  241. */
  242. function getCacheLeafXmj(leafXmj) {
  243. const cacheLX = leafXmjs.find(function (lx) {
  244. return lx.id === leafXmj.id;
  245. });
  246. if (!cacheLX) {
  247. return newCacheLeafXmj(leafXmj);
  248. } else {
  249. return cacheLX;
  250. }
  251. }
  252. /**
  253. * 汇总节点
  254. * @param node - 最底层 工程量清单 节点
  255. * @param leafXmj - 所属 最底层 项目节
  256. */
  257. function loadGatherGclNode(node, leafXmj) {
  258. const gcl = getGclNode(node);
  259. gatherfields(gcl, node, ledgerGatherFields);
  260. const cacheLeafXmj = getCacheLeafXmj(leafXmj);
  261. const posRange = gsPos.getLedgerPos(node.id);
  262. const detail = posRange && posRange.length > 0 ? posRange : [node];
  263. for (const d of detail) {
  264. const dx = _.assign({}, cacheLeafXmj);
  265. gatherfields(dx, d, posGatherFields);
  266. dx.gcl_id = node.id;
  267. if (d.name !== node.name) {
  268. dx.bwmx = d.name;
  269. }
  270. if (d.drawing_code) {
  271. dx.drawaing_code = d.drawing_code;
  272. }
  273. gcl.leafXmjs.push(dx);
  274. }
  275. }
  276. /**
  277. * (递归)汇总树节点
  278. * @param nodes - 汇总节点列表
  279. * @param leafXmj - 汇总节点所属的底层项目节
  280. */
  281. function recursiveGatherGclData(nodes, leafXmj) {
  282. for (const node of nodes) {
  283. if (node.b_code) {
  284. if (node.children.length > 0) {
  285. recursiveGatherGclData(node.children, leafXmj);
  286. } else {
  287. loadGatherGclNode(node, leafXmj);
  288. }
  289. } else if (node.children.length > 0) {
  290. recursiveGatherGclData(node.children, node);
  291. }
  292. }
  293. }
  294. /**
  295. * 根据树结构 清单汇总
  296. */
  297. function gatherGclData() {
  298. // 清空旧数据
  299. if (gclList.length > 0) {
  300. gclList.splice(0, gclList.length - 1);
  301. }
  302. recursiveGatherGclData(gsTree.children, null);
  303. gclList.sort(function (a, b) {
  304. function compareCode(code1, code2) {
  305. if (numReg.test(code1)) {
  306. if (numReg.test(code2)) {
  307. return _.toNumber(code1) - _.toNumber(code2);
  308. } else {
  309. return -1
  310. }
  311. } else {
  312. if (numReg.test(code2)) {
  313. return 1;
  314. } else {
  315. return code1 === code2 ? 0 : (code1 < code2 ? -1 : 1);
  316. }
  317. }
  318. }
  319. const numReg = /^[0-9]+$/;
  320. const aCodes = a.b_code.split('-'), bCodes = b.b_code.split('-');
  321. for (let i = 0, iLength = Math.min(aCodes.length, bCodes.length); i < iLength; ++i) {
  322. const iCompare = compareCode(aCodes[i], bCodes[i]);
  323. if (iCompare !== 0) {
  324. return iCompare;
  325. }
  326. }
  327. });
  328. return gclList;
  329. }
  330. return {
  331. loadLedgerData,
  332. loadPosData,
  333. gatherGclData,
  334. };
  335. })();