gcl_gather_compare.js 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480
  1. 'use strict';
  2. /**
  3. *
  4. * 清单汇总对比(需使用 decimal.min.js, zh_calc.js, path_tree.js, lodash.js)
  5. *
  6. * @author Mai
  7. * @date 2020/10/28
  8. * @version
  9. */
  10. const gclCompareModel = (function () {
  11. const leafXmjs = [], mergeChar = ';';
  12. let gclList, gclChapter, otherChapter, chapterfilter;
  13. let ledgerSetting, gsTree;
  14. function gatherfields(obj, src, fields, prefix = '') {
  15. if (obj && src) {
  16. for (const f of fields) {
  17. obj[prefix + f] = ZhCalc.add(obj[prefix + f], src[f]);
  18. }
  19. }
  20. }
  21. /**
  22. * 新建 清单汇总节点
  23. * @param node - 最底层 工程量清单节点
  24. * @returns {obj}
  25. */
  26. function newGclNode(node) {
  27. const gcl = {
  28. b_code: node.b_code,
  29. name: node.name,
  30. unit: node.unit,
  31. unit_price: node.unit_price,
  32. leafXmjs: [],
  33. };
  34. gclList.push(gcl);
  35. return gcl;
  36. }
  37. /**
  38. * 获取清单汇总节点
  39. *
  40. * @param node - 最底层清单节点
  41. * @returns {*}
  42. */
  43. function getGclNode(node) {
  44. const gcl = gclList.find(function (g) {
  45. return g.b_code === node.b_code &&
  46. (g.name || node.name ? g.name === node.name : true) &&
  47. (g.unit || node.unit ? g.unit === node.unit : true) &&
  48. checkZero(ZhCalc.sub(g.unit_price, node.unit_price));
  49. });
  50. if (gcl) {
  51. return gcl
  52. } else {
  53. return newGclNode(node);
  54. }
  55. }
  56. /**
  57. * 检查 text 是否是Peg
  58. * e.g. K123+000(true) Kab+123(false) K123.234+234(false) K12+324.234(true)
  59. *
  60. * @param text
  61. * @returns {*}
  62. * @constructor
  63. */
  64. function CheckPeg(text) {
  65. const pegReg = /[a-zA-Z]?[kK][0-9]+[++][0-9]{3}([.][0-9]+)?/;
  66. return pegReg.test(text);
  67. }
  68. /**
  69. * 获取 桩号节点
  70. * @param node - 检索起始节点
  71. * @returns {*}
  72. */
  73. function getPegNode (node) {
  74. if (node) {
  75. if (CheckPeg(node.name)) {
  76. return node;
  77. } else {
  78. const parent = gsTree.getParent(node);
  79. return parent ? getPegNode(parent) : null;
  80. }
  81. }
  82. }
  83. /**
  84. * 获取节点的第N层父节点
  85. *
  86. * @param node - 节点(检索起点)
  87. * @param level - 第N层
  88. * @returns {*}
  89. */
  90. function getNodeByLevel(node, level) {
  91. let cur = node;
  92. while (cur && cur.level > level) {
  93. cur = gsTree.getParent(cur);
  94. }
  95. return cur;
  96. }
  97. /**
  98. * 获取 单位工程
  99. *
  100. * @param xmj - 计量单元(最底层项目节)
  101. * @returns {string}
  102. */
  103. function getDwgc(peg, xmj) {
  104. if (peg) {
  105. return peg.name;
  106. } else {
  107. const node = getNodeByLevel(xmj, 2);
  108. return node ? node.name : '';
  109. }
  110. }
  111. /**
  112. * 获取 分部工程
  113. *
  114. * @param peg - 桩号节点
  115. * @param xmj - 计量单元(最底层项目节)
  116. * @returns {string}
  117. */
  118. function getFbgc(peg, xmj) {
  119. if (peg && peg.id !== xmj.id) {
  120. const node = getNodeByLevel(xmj, peg.level + 1);
  121. return node ? node.name : '';
  122. } else {
  123. const node = getNodeByLevel(xmj, 3);
  124. return node ? node.name : '';
  125. }
  126. }
  127. /**
  128. * 获取 分项工程
  129. *
  130. * @param peg - 桩号节点
  131. * @param xmj - 计量单元(最底层项目节)
  132. * @returns {string}
  133. */
  134. function getFxgc(peg, xmj) {
  135. if (!peg) {
  136. const node = getNodeByLevel(xmj, 4);
  137. return node ? node.name : '';
  138. } else if (peg.id === xmj.id) {
  139. if (xmj.level > 4) {
  140. let value = '';
  141. for (let level = 4; level < xmj.level; level++) {
  142. const node = getNodeByLevel(xmj, level);
  143. value = value === '' ? node.name : value + mergeChar + node.name;
  144. }
  145. return value;
  146. } else {
  147. return '';
  148. }
  149. } else {
  150. if (peg.level + 2 < xmj.level) {
  151. let value = '';
  152. for (let level = peg.level + 2; level < xmj.level; level++) {
  153. const node = getNodeByLevel(xmj, level);
  154. value = value === '' ? node.name : value + mergeChar + node.name;
  155. }
  156. return value;
  157. } else {
  158. return '';
  159. }
  160. }
  161. }
  162. /**
  163. * 新建 最底层项目节 缓存数据
  164. * @param leafXmj
  165. * @returns {{id, code: *|string[], jldy, fbgc: string, fxgc: string, dwgc: string, bwmx: string, drawing_code: string}}
  166. */
  167. function newCacheLeafXmj(leafXmj) {
  168. const peg = getPegNode(leafXmj);
  169. const cacheLX = {
  170. id: leafXmj.id,
  171. code: leafXmj.code,
  172. jldy: leafXmj.name,
  173. fbgc: getFbgc(peg, leafXmj),
  174. fxgc: getFxgc(peg, leafXmj),
  175. dwgc: getDwgc(peg, leafXmj),
  176. drawing_code: leafXmj.drawing_code,
  177. };
  178. leafXmjs.push(cacheLX);
  179. return cacheLX;
  180. }
  181. /**
  182. * 获取缓存的最底层项目节数据
  183. *
  184. * @param leafXmj - 最底层项目节
  185. * @returns {*}
  186. */
  187. function getCacheLeafXmj(leafXmj) {
  188. const cacheLX = leafXmjs.find(function (lx) {
  189. return lx.id === leafXmj.id;
  190. });
  191. if (!cacheLX) {
  192. return newCacheLeafXmj(leafXmj);
  193. } else {
  194. return cacheLX;
  195. }
  196. }
  197. /**
  198. * 汇总节点
  199. * @param node - 最底层 工程量清单 节点
  200. * @param leafXmj - 所属 最底层 项目节
  201. */
  202. function loadGatherGclNode(node, leafXmj, gsPos) {
  203. const gcl = getGclNode(node);
  204. gatherfields(gcl, node, ledgerSetting.billsFields, ledgerSetting.prefix);
  205. const cacheLeafXmj = getCacheLeafXmj(leafXmj);
  206. const posRange = gsPos.getLedgerPos(node.id);
  207. const detail = posRange && posRange.length > 0 ? posRange : [node];
  208. for (const d of detail) {
  209. const lx = gcl.leafXmjs.find(x => {return x.id === leafXmj.id && (x.mx_id === d.id || x.gcl_id === d.id)});
  210. if (lx) {
  211. gatherfields(lx, d, ledgerSetting.posFields, ledgerSetting.prefix);
  212. } else {
  213. const dx = _.assign({}, cacheLeafXmj);
  214. gatherfields(dx, d, ledgerSetting.posFields, ledgerSetting.prefix);
  215. dx.gcl_id = node.id;
  216. if (d.name !== node.name) {
  217. dx.bwmx = d.name;
  218. dx.mx_id = d.id;
  219. }
  220. if (d.drawing_code) {
  221. dx.drawing_code = d.drawing_code;
  222. }
  223. gcl.leafXmjs.push(dx);
  224. }
  225. }
  226. }
  227. /**
  228. * (递归)汇总树节点
  229. * @param nodes - 汇总节点列表
  230. * @param leafXmj - 汇总节点所属的底层项目节
  231. */
  232. function recursiveGatherGclData(nodes, leafXmj, gsPos) {
  233. for (const node of nodes) {
  234. if (node.b_code) {
  235. if (node.children.length > 0) {
  236. recursiveGatherGclData(node.children, leafXmj, gsPos);
  237. } else {
  238. loadGatherGclNode(node, leafXmj, gsPos);
  239. }
  240. } else if (node.children.length > 0) {
  241. recursiveGatherGclData(node.children, node, gsPos);
  242. }
  243. }
  244. }
  245. function _getCalcChapter(chapter) {
  246. const gclChapter = [], otherChapter = [];
  247. let serialNo = 1;
  248. for (const c of chapter) {
  249. const cc = { code: c.code, name: c.name, cType: 1 };
  250. cc.serialNo = serialNo++;
  251. cc.filter = '^[^0-9]*' + c.code.substr(0, c.code.length - 2) + '[0-9]{2}-';
  252. gclChapter.push(cc);
  253. }
  254. gclChapter.push({ name: '未计入章节清单合计', cType: 21, serialNo: serialNo++, });
  255. otherChapter.push({ name: '清单小计(A)', cType: 11, serialNo: serialNo++ });
  256. otherChapter.push({ name: '非清单项费用(B)', cType: 31, serialNo: serialNo++ });
  257. otherChapter.push({ name: '合计(C=A+B)', cType: 41, serialNo: serialNo });
  258. return [gclChapter, otherChapter];
  259. }
  260. function _gatherChapterFields(chapter, data, fields) {
  261. for (const f of fields) {
  262. chapter[f] = ZhCalc.add(chapter[f], data[f]);
  263. }
  264. }
  265. function _getGclChapter(chapter, data) {
  266. for (const c of chapter) {
  267. if (c.filter) {
  268. const reg = new RegExp(c.filter);
  269. if (reg.test(data.b_code)) {
  270. return c;
  271. }
  272. } else {
  273. return c;
  274. }
  275. }
  276. }
  277. function _checkFilter(d, filter) {
  278. for (const f of filter) {
  279. if (f.node_type && f.node_type === d.node_type) return true;
  280. if (f.field) {
  281. if (f.part && d[f.field] && d[f.field].indexOf(f.part) >= 0) return true;
  282. if (f.all && d[f.all] && d[f.all] === f.all) return true;
  283. }
  284. }
  285. return false;
  286. }
  287. function _gatherChapter() {
  288. const filterPath = [];
  289. const checkFilterPath = function (data) {
  290. for (const fp of filterPath) {
  291. if (data.full_path.indexOf(fp + '-') === 0 || data.full_path === fp) return true;
  292. }
  293. return false;
  294. };
  295. for (const d of gsTree.nodes) {
  296. if (_checkFilter(d, chapterfilter)) {
  297. filterPath.push(d.full_path);
  298. }
  299. if (d.children && d.children.length > 0) continue;
  300. for (const c of otherChapter) {
  301. if (c.cType === 41) {
  302. gatherfields(c, d, ledgerSetting.chapterFields, ledgerSetting.prefix);
  303. }
  304. if (c.cType === 11 && (d.b_code)) {
  305. gatherfields(c, d, ledgerSetting.chapterFields, ledgerSetting.prefix);
  306. }
  307. if (c.cType === 31 && (!d.b_code || d.b_code === '')) {
  308. gatherfields(c, d, ledgerSetting.chapterFields, ledgerSetting.prefix);
  309. }
  310. }
  311. for (const fp of filterPath) {
  312. if (d.full_path.indexOf(fp + '-') === 0 || d.full_path === fp) continue;
  313. }
  314. if (d.b_code) {
  315. const c = checkFilterPath(d)
  316. ? gclChapter.find(x => { return x.cType === 21})
  317. : _getGclChapter(gclChapter, d);
  318. gatherfields(c, d, ledgerSetting.chapterFields, ledgerSetting.prefix);
  319. }
  320. }
  321. }
  322. function init (gclData, chapter, filter) {
  323. gclList = gclData;
  324. [gclChapter, otherChapter] = _getCalcChapter(chapter);
  325. chapterfilter = filter || [];
  326. }
  327. /**
  328. *
  329. * @param bills - 项目节+清单数据
  330. * @param pos - 计量单元数据
  331. * @param setting 配置
  332. * e.g.
  333. * {
  334. * tree: {
  335. * id: 'ledger_id',
  336. * pid: 'ledger_pid',
  337. * order: 'order',
  338. * level: 'level',
  339. * rootId: -1,
  340. * keys: ['id', 'tender_id', 'ledger_id'],
  341. * stageId: 'id',
  342. * },
  343. * pos: { id: 'id', ledgerId: 'lid', },
  344. * billsFields: ['quantity', 'total_price', 'deal_qty', 'deal_tp'],
  345. * posFields: ['quantity'],
  346. * chapterFields: [new_total_price],
  347. * prefix: 'org' // 'new'
  348. * }
  349. */
  350. function gatherLedgerData(bills, pos, setting) {
  351. ledgerSetting = setting;
  352. try {
  353. if (leafXmjs.length > 0) leafXmjs.length = 0;
  354. gsTree = createNewPathTree('ledger', setting.tree);
  355. gsTree.loadDatas(bills);
  356. const gsPos = new PosData(setting.pos);
  357. gsPos.loadDatas(pos);
  358. recursiveGatherGclData(gsTree.children, null, gsPos);
  359. _gatherChapter();
  360. } catch(err) {
  361. console.log(err);
  362. }
  363. ledgerSetting = null;
  364. }
  365. function compareCode(str1, str2, symbol = '-') {
  366. if (!str1) {
  367. return 1;
  368. } else if (!str2) {
  369. return -1;
  370. }
  371. function compareSubCode(code1, code2) {
  372. if (numReg.test(code1)) {
  373. if (numReg.test(code2)) {
  374. return parseInt(code1) - parseInt(code2);
  375. } else {
  376. return -1
  377. }
  378. } else {
  379. if (numReg.test(code2)) {
  380. return 1;
  381. } else {
  382. return code1 === code2 ? 0 : (code1 < code2 ? -1 : 1); //code1.localeCompare(code2);
  383. }
  384. }
  385. }
  386. const numReg = /^[0-9]+$/;
  387. const aCodes = str1.split(symbol), bCodes = str2.split(symbol);
  388. for (let i = 0, iLength = Math.min(aCodes.length, bCodes.length); i < iLength; ++i) {
  389. const iCompare = compareSubCode(aCodes[i], bCodes[i]);
  390. if (iCompare !== 0) {
  391. return iCompare;
  392. }
  393. }
  394. return aCodes.length - bCodes.length;
  395. }
  396. /**
  397. *
  398. * @param data {Array} - 签约清单数据
  399. * @returns <void>
  400. */
  401. function gatherDealBills(data) {
  402. if (data instanceof Array && data.length > 0) {
  403. for (const node of data) {
  404. node.b_code = node.code;
  405. const gcl = getGclNode(node);
  406. if (!node.quantity || !node.unit_price) continue;
  407. gcl.deal_bills_qty = node.quantity || 0;
  408. gcl.deal_bills_tp = node.total_price || 0;
  409. for (const c of otherChapter) {
  410. if (c.cType === 41 || c.cType === 11) {
  411. c.deal_bills_tp = ZhCalc.add(c.deal_bills_tp, node.total_price);
  412. }
  413. }
  414. const c = _getGclChapter(gclChapter, node);
  415. c.deal_bills_tp = ZhCalc.add(c.deal_bills_tp, node.total_price);
  416. }
  417. }
  418. }
  419. /**
  420. * 检查汇总完的工程量清单中,同编号 & 不同名称/单位/单价 的清单并标记
  421. */
  422. function checkDiffer() {
  423. gclList.sort((a, b) => {
  424. return compareCode(a.b_code, b.b_code);
  425. });
  426. for (const gcl of gclList) {
  427. gcl.differ = false;
  428. }
  429. for (const [i, gcl] of gclList.entries()) {
  430. gcl.differ_qty = ZhCalc.sub(gcl.new_quantity, gcl.org_quantity, 6);
  431. gcl.deal_differ_qty = ZhCalc.sub(gcl.new_quantity, gcl.deal_bills_qty, 6);
  432. if (i === gclList.length - 1) continue;
  433. const next = gclList[i+1];
  434. if (gcl.b_code === next.b_code) {
  435. if (gcl.name !== next.name || gcl.unit !== next.unit || !checkZero(gcl.unit_price - next.unit_price)) {
  436. gcl.differ = true;
  437. next.differ = true;
  438. }
  439. }
  440. }
  441. }
  442. function chapterData () {
  443. return gclChapter.concat(otherChapter);
  444. }
  445. return {
  446. init,
  447. gatherLedgerData, gatherDealBills, checkDiffer,
  448. chapterData
  449. };
  450. })();