facades.js 43 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071
  1. 'use strict';
  2. /**
  3. *
  4. *
  5. * @author Zhong
  6. * @date 2018/6/1
  7. * @version
  8. */
  9. import mongoose from 'mongoose';
  10. import CompilationModel from "../../users/models/compilation_model";
  11. import moment from 'moment';
  12. const uuidV1 = require('uuid/v1');
  13. const billsLibModel = mongoose.model('std_bills_lib_list');
  14. const billsGuideLibModel = mongoose.model('std_billsGuidance_lib');
  15. const billsGuideItemsModel = mongoose.model('std_billsGuidance_items');
  16. const stdBillsLibModel = mongoose.model('std_bills_lib_list');
  17. const stdBillsModel = mongoose.model('std_bills_lib_bills');
  18. const stdBillsJobsModel = mongoose.model('std_bills_lib_jobContent');
  19. const stdRationModel = mongoose.model('std_ration_lib_ration_items');
  20. const engLibModel = mongoose.model('engineering_lib');
  21. const compilationModel = mongoose.model('compilation');
  22. const billMaterialModel = mongoose.model('std_billsGuidance_materials');
  23. const gljModel = mongoose.model('std_glj_lib_gljList');
  24. const gljLibModel = mongoose.model('std_glj_lib_map');
  25. const billClassModel = mongoose.model('billClass');
  26. const idTree = require('../../../public/id_tree').getTree();
  27. const _ = require('lodash');
  28. const zhLibID = 'cf851660-3534-11ec-9641-2da8021b8e4e';
  29. const cqLibID = '90c51220-a740-11e8-a354-ab5db7d42428';
  30. module.exports = {
  31. handleCopyItems,
  32. getComBillsLibInfo,
  33. getBillsGuideLibs,
  34. initBillsGuideLib,
  35. updateBillsGuideLib,
  36. getLibWithBills,
  37. getItemsBybills,
  38. updateItems,
  39. getBillMaterials,
  40. editBillMaterials,
  41. generateClassData,
  42. getClassExcelData,
  43. testItems
  44. };
  45. function setChildren(bill, parentMap) {
  46. let children = parentMap[bill.ID];
  47. if (children) {
  48. for (let c of children) {
  49. setChildren(c, parentMap);
  50. }
  51. bill.children = children;
  52. } else {
  53. bill.children = [];
  54. }
  55. }
  56. function sortChildren(lists) {
  57. let IDMap = {},
  58. nextMap = {},
  59. firstNode = null,
  60. newList = [];
  61. for (let l of lists) {
  62. if (l.children && l.children.length > 0) l.children = sortChildren(l.children); //递规排序
  63. IDMap[l.ID] = l;
  64. if (l.NextSiblingID != -1) nextMap[l.NextSiblingID] = l;
  65. }
  66. for (let t of lists) {
  67. if (!nextMap[t.ID]) { //如果在下一节点映射没找到,则是第一个节点
  68. firstNode = t;
  69. break;
  70. }
  71. }
  72. if (firstNode) {
  73. newList.push(firstNode);
  74. delete IDMap[firstNode.ID];
  75. setNext(firstNode, newList);
  76. }
  77. //容错处理,如果链断了的情况,直接添加到后面
  78. for (let key in IDMap) {
  79. if (IDMap[key]) newList.push(IDMap[key])
  80. }
  81. return newList;
  82. function setNext(node, array) {
  83. if (node.NextSiblingID != -1) {
  84. let next = IDMap[node.NextSiblingID];
  85. if (next) {
  86. array.push(next);
  87. delete IDMap[next.ID];
  88. setNext(next, array);
  89. }
  90. }
  91. }
  92. }
  93. function getItemFromChildren(children, allItems) {
  94. for (let i = 0; i < children.length; i++) {
  95. const cur = children[i];
  96. const next = children[i + 1];
  97. cur.NextSiblingID = next && next.ID || -1;
  98. allItems.push(cur);
  99. if (cur.children && cur.children.length) {
  100. getItemFromChildren(cur.children, allItems);
  101. }
  102. }
  103. }
  104. function resetTreeData(billsList) {
  105. const idMapping = {};
  106. idMapping['-1'] = -1;
  107. // 建立新ID-旧ID映射
  108. billsList.forEach(bills => idMapping[bills.ID] = uuidV1());
  109. billsList.forEach(function (bills) {
  110. bills.ID = idMapping[bills.ID] ? idMapping[bills.ID] : -1;
  111. bills.ParentID = idMapping[bills.ParentID] ? idMapping[bills.ParentID] : -1;
  112. bills.NextSiblingID = idMapping[bills.NextSiblingID] ? idMapping[bills.NextSiblingID] : -1;
  113. });
  114. }
  115. // 从某库中根据清单编号拷贝工艺
  116. async function handleCopyItems(sourceGuideLibID, sourceBillsLibID, targetGuideLibID, targetBillsLibID) {
  117. const sourceBills = await stdBillsModel.find({ billsLibId: sourceBillsLibID, deleted: false }, '-_id ID code').lean();
  118. const targetBills = await stdBillsModel.find({ billsLibId: targetBillsLibID, deleted: false }, '-_id ID code').lean();
  119. const sourceItems = await billsGuideItemsModel.find({ libID: sourceGuideLibID, type: 0, deleted: false }, '-_id').lean(); // 过滤掉定额项
  120. const targetCodeIDMap = {};
  121. targetBills.forEach(bills => targetCodeIDMap[bills.code] = bills.ID);
  122. const toDeleteIDList = [];
  123. const insertBulks = [];
  124. sourceBills.forEach(bills => {
  125. const matchedItems = sourceItems.filter(item => item.billsID === bills.ID);
  126. // 重新将断缺的树结构数据整理好
  127. if (matchedItems.length) {
  128. const parentMap = {};
  129. matchedItems.forEach(item => {
  130. (parentMap[item.ParentID] || (parentMap[item.ParentID] = [])).push(item);
  131. });
  132. const roots = parentMap['-1'];
  133. roots.forEach(root => setChildren(root, parentMap));
  134. const sorted = sortChildren(roots);
  135. const newItems = [];
  136. getItemFromChildren(sorted, newItems);
  137. resetTreeData(newItems);
  138. const targetBillsID = targetCodeIDMap[bills.code];
  139. if (targetBillsID) {
  140. toDeleteIDList.push(targetBillsID);
  141. newItems.forEach(newItem => {
  142. newItem.libID = targetGuideLibID;
  143. newItem.billsID = targetBillsID;
  144. insertBulks.push({
  145. insertOne: { document: newItem }
  146. });
  147. })
  148. }
  149. }
  150. });
  151. if (toDeleteIDList.length) {
  152. await billsGuideItemsModel.remove({ libID: targetGuideLibID, billsID: { $in: toDeleteIDList } });
  153. }
  154. if (insertBulks.length) {
  155. await billsGuideItemsModel.bulkWrite(insertBulks);
  156. }
  157. }
  158. async function getCompilationList() {
  159. let compilationModel = new CompilationModel();
  160. return await compilationModel.getCompilationList();
  161. }
  162. async function getComBillsLibInfo() {
  163. let rst = { compilationList: [], billsLibs: [] };
  164. let compilationList = await getCompilationList();
  165. if (compilationList.length <= 0) {
  166. throw '没有数据';
  167. }
  168. else {
  169. for (let compilation of compilationList) {
  170. rst.compilationList.push({ _id: compilation._id, name: compilation.name });
  171. }
  172. rst.billsLibs = await billsLibModel.find({ deleted: false }, '-_id billsLibId billsLibName');
  173. return rst;
  174. }
  175. }
  176. async function getBillsGuideLibs(findData, isTemporary) {
  177. if (isTemporary) {
  178. const libs = await billsGuideLibModel.find({ ID: { $in: [zhLibID, cqLibID] } }).lean();
  179. return libs;
  180. }
  181. return await billsGuideLibModel.find(findData);
  182. }
  183. // 如果是“重庆费用定额(2018)”,则默认叶子清单的项目指引窗口只有一条数据,取清单名称。
  184. async function genGuidanceItems_cq18(guidanceLibId, billsLibId) {
  185. let bills = await stdBillsModel.find({ billsLibId: billsLibId, deleted: false, 'jobs.0': { $exists: true } });
  186. let insertArr = [];
  187. for (let bill of bills) {
  188. let newItem = {
  189. libID: guidanceLibId,
  190. ID: uuidV1(), ParentID: -1,
  191. NextSiblingID: -1,
  192. name: bill.name,
  193. type: 0,
  194. billsID: bill.ID
  195. };
  196. insertArr.push({ insertOne: { document: newItem } });
  197. }
  198. await billsGuideItemsModel.bulkWrite(insertArr);
  199. }
  200. //拷贝工作内容并转化为树结构,形成项目指引数据
  201. async function genGuidanceItems(guidanceLibId, billsLibId) {
  202. let bills = await stdBillsModel.find({ billsLibId: billsLibId, deleted: false, 'jobs.0': { $exists: true } });
  203. //设置工作内容数据
  204. let jobIds = [];
  205. let totalJobs = [];
  206. for (let bill of bills) {
  207. for (let job of bill.jobs) {
  208. jobIds.push(job.id);
  209. }
  210. }
  211. jobIds = Array.from(new Set(jobIds));
  212. if (jobIds.length > 0) {
  213. totalJobs = await stdBillsJobsModel.find({ deleted: false, id: { $in: jobIds } });
  214. }
  215. if (totalJobs.length > 0) {
  216. let jobIdIndex = {};//id索引
  217. for (let job of totalJobs) {
  218. jobIdIndex[job.id] = job;
  219. }
  220. let insertArr = [];
  221. for (let bill of bills) {
  222. //排序后根据serialNo转换成NextSiblingID,倒序
  223. bill.jobs.sort(function (a, b) {
  224. let rst = 0;
  225. if (a.serialNo > b.serialNo) {
  226. rst = -1;
  227. }
  228. else if (a.serialNo < b.serialNo) {
  229. rst = 1;
  230. }
  231. return rst;
  232. });
  233. let jobNoIndex = {};//下标索引
  234. for (let i = 0; i < bill.jobs.length; i++) {
  235. let newItem = {
  236. libID: guidanceLibId, ID: uuidV1(), ParentID: -1, NextSiblingID: jobNoIndex[i - 1] ? jobNoIndex[i - 1]['ID'] : -1,
  237. name: jobIdIndex[bill.jobs[i]['id']]['content'], type: 0, billsID: bill.ID
  238. };
  239. jobNoIndex[i] = newItem;
  240. insertArr.push({ insertOne: { document: newItem } });
  241. }
  242. }
  243. await billsGuideItemsModel.bulkWrite(insertArr);
  244. }
  245. }
  246. async function initBillsGuideLib(updateData) {
  247. await billsGuideLibModel.create(updateData);
  248. let compilation = await compilationModel.findOne({ _id: mongoose.Types.ObjectId(updateData.compilationId) });
  249. if (compilation &&
  250. compilation.overWriteUrl &&
  251. compilation.overWriteUrl === '/web/over_write/js/chongqing_2018.js') {
  252. await genGuidanceItems_cq18(updateData.ID, updateData.billsLibId);
  253. } else {
  254. await genGuidanceItems(updateData.ID, updateData.billsLibId);
  255. }
  256. }
  257. async function updateBillsGuideLib(data) {
  258. if (data.updateType === 'delete') {
  259. //删除所有条目
  260. await billsGuideLibModel.remove(data.findData);
  261. await billsGuideItemsModel.remove({ libID: data.findData.ID });
  262. }
  263. else {
  264. await billsGuideLibModel.update(data.findData, { $set: data.updateData });
  265. await engLibModel.update({ 'billsGuidance_lib.id': data.findData.ID }, { $set: { 'billsGuidance_lib.$.name': data.updateData.name } }, { multi: true });
  266. }
  267. }
  268. async function getLibWithBills(libID) {
  269. let guidanceLib = await getBillsGuideLibs({ ID: libID });
  270. if (guidanceLib.length === 0) {
  271. throw '不存在此指引库!';
  272. }
  273. let billsLib = await stdBillsLibModel.findOne({ billsLibId: guidanceLib[0].billsLibId });
  274. if (!billsLib) {
  275. throw '引用的清单规则库不存在!';
  276. }
  277. let bills = await stdBillsModel.find({ billsLibId: billsLib.billsLibId }, '-_id code name ID NextSiblingID ParentID jobs items comment').lean();
  278. const guideItems = await billsGuideItemsModel.find({ libID: guidanceLib[0].ID }, '-_id billsID').lean();
  279. const billsMap = {};
  280. for (const item of guideItems) {
  281. billsMap[item.billsID] = true;
  282. }
  283. for (const item of bills) {
  284. if (billsMap[item.ID]) {
  285. item.hasGuide = true;
  286. }
  287. }
  288. return { guidanceLib: guidanceLib[0], bills };
  289. }
  290. function getAttrs(field, datas) {
  291. let rst = [];
  292. for (let data of datas) {
  293. if (data[field]) {
  294. rst.push(data[field]);
  295. }
  296. }
  297. return rst;
  298. }
  299. //定额项目指所引用定额是否被删除
  300. function rationAllExist(rationItems, stdRationIdx) {
  301. for (let item of rationItems) {
  302. if (!stdRationIdx[item.rationID]) {
  303. return false;
  304. }
  305. }
  306. return true;
  307. }
  308. //将同层树结构转为顺序数组
  309. function chainToArr(nodes) {
  310. let rst = [];
  311. let tempIdx = {};
  312. let nodeIdx = {};
  313. //建索引
  314. for (let node of nodes) {
  315. tempIdx[node.ID] = { ID: node.ID, NextSiblingID: node.NextSiblingID, preSibling: null, nextSibling: null };
  316. nodeIdx[node.ID] = node;
  317. }
  318. //建链
  319. for (let i in tempIdx) {
  320. let temp = tempIdx[i];
  321. if (temp.NextSiblingID != -1) {
  322. let next = tempIdx[temp.NextSiblingID];
  323. temp.nextSibling = next;
  324. next.preSibling = temp;
  325. }
  326. }
  327. let firstNode = null;
  328. for (let i in tempIdx) {
  329. if (!tempIdx[i].preSibling) {
  330. firstNode = tempIdx[i];
  331. break;
  332. }
  333. }
  334. //获得顺序队列
  335. while (firstNode) {
  336. rst.push(nodeIdx[firstNode.ID]);
  337. firstNode = firstNode.nextSibling;
  338. }
  339. return rst;
  340. }
  341. async function getItemsBybills(guidanceLibID, billsID) {
  342. const type = { job: 0, ration: 1 };
  343. let items = await billsGuideItemsModel.find({ libID: guidanceLibID, billsID: billsID, deleted: false });
  344. let rationItems = _.filter(items, { type: type.ration });
  345. let rationIds = getAttrs('rationID', rationItems);
  346. let stdRations = await stdRationModel.find({ ID: { $in: rationIds }, $or: [{ isDeleted: null }, { isDeleted: false }] });
  347. let stdRationIndex = {};
  348. for (let stdRation of stdRations) {
  349. stdRationIndex[stdRation.ID] = stdRation;
  350. }
  351. //判断定额完整性
  352. if (!rationAllExist(rationItems, stdRationIndex)) {
  353. //建定额链, 排序后再清除不存在的定额,保证顺序正确性
  354. rationItems = chainToArr(rationItems);
  355. //清除已被删除的定额
  356. let removeIds = [];
  357. _.remove(rationItems, function (item) {
  358. if (!stdRationIndex[item.rationID]) {
  359. removeIds.push(item.ID);
  360. return true;
  361. }
  362. return false;
  363. });
  364. _.remove(items, function (item) {
  365. return removeIds.includes(item.ID);
  366. });
  367. await billsGuideItemsModel.remove({ ID: { $in: removeIds } });
  368. //重组树结构
  369. let bulkArr = [];
  370. for (let i = 0, len = rationItems.length; i < len; i++) {
  371. rationItems[i].NextSiblingID = rationItems[i + 1] ? rationItems[i + 1].ID : -1;
  372. bulkArr.push({ updateOne: { filter: { ID: rationItems[i].ID }, update: { $set: { NextSiblingID: rationItems[i].NextSiblingID } } } });
  373. }
  374. await billsGuideItemsModel.bulkWrite(bulkArr);
  375. }
  376. return items;
  377. }
  378. async function updateItems(updateDatas) {
  379. let bulkArr = [];
  380. for (let updateData of updateDatas) {
  381. if (updateData.updateType === 'create') {
  382. bulkArr.push({ insertOne: { document: updateData.updateData } });
  383. }
  384. else if (updateData.updateType === 'update') {
  385. bulkArr.push({ updateOne: { filter: updateData.findData, update: { $set: updateData.updateData } } });
  386. }
  387. else {
  388. bulkArr.push({ deleteOne: { filter: updateData.findData } });
  389. }
  390. }
  391. if (bulkArr.length > 0) {
  392. await billsGuideItemsModel.bulkWrite(bulkArr);
  393. }
  394. }
  395. // 获取清单材料数据
  396. async function getBillMaterials(libID, billID) {
  397. // 指引下已有定额人材机(材料大类)
  398. let allGljList = [];
  399. const rationItems = await billsGuideItemsModel.find({ libID, billsID: billID, rationID: { $ne: null } }, '-_id rationID').lean();
  400. if (rationItems.length) {
  401. const rationIDs = rationItems.map(item => item.rationID);
  402. const rations = await stdRationModel.find({ ID: { $in: rationIDs } }, '-_id rationGljList');
  403. const gljIDs = [];
  404. rations.forEach(ration => {
  405. if (ration.rationGljList && ration.rationGljList.length) {
  406. gljIDs.push(...ration.rationGljList.map(rGlj => rGlj.gljId));
  407. }
  408. });
  409. if (gljIDs.length) {
  410. allGljList = await gljModel.find({ ID: { $in: [...new Set(gljIDs)] } }, '-_id ID code name specs gljType').lean();
  411. allGljList = allGljList.filter(glj => /^2/.test(glj.gljType) || [4, 5].includes(glj.gljType));
  412. }
  413. }
  414. // 清单材料
  415. let billMaterials = [];
  416. const billMaterial = await billMaterialModel.findOne({ libID, billID }).lean();
  417. if (!billMaterial || !billMaterial.materials) {
  418. return {
  419. billMaterials,
  420. allGljList
  421. };
  422. }
  423. const gljIDs = billMaterial.materials.map(m => m.gljID);
  424. const gljList = await gljModel.find({ ID: { $in: gljIDs } }, '-_id ID code name specs').lean();
  425. billMaterials = gljList.map(glj => ({ gljID: glj.ID, code: glj.code, name: glj.name, specs: glj.specs }));
  426. return {
  427. billMaterials,
  428. allGljList
  429. }
  430. }
  431. // 编辑清单材料数据,返回清单材料数据
  432. async function editBillMaterials(libID, billID, gljCodes, compilationID) {
  433. const gljLib = await gljLibModel.findOne({ compilationId: compilationID }, '-_id ID').lean();
  434. const gljList = await gljModel.find({ repositoryId: gljLib.ID, code: { $in: gljCodes }, }, '-_id ID code name specs').lean();
  435. const gljMap = {};
  436. const materials = [];
  437. gljList.forEach(glj => {
  438. materials.push({ gljID: glj.ID });
  439. gljMap[glj.code] = 1;
  440. });
  441. const missCodes = gljCodes.filter(code => !gljMap[code]);
  442. if (missCodes.length) {
  443. throw new Error(`没有找到人材机:<br/>${missCodes.join('<br/>')}`);
  444. }
  445. const billMaterial = await billMaterialModel.findOne({ libID, billID }, '-_id ID').lean();
  446. if (billMaterial) {
  447. await billMaterialModel.update({ ID: billMaterial.ID }, { $set: { materials } });
  448. } else {
  449. await billMaterialModel.create({ libID, billID, ID: uuidV1(), materials });
  450. }
  451. return gljList.map(glj => ({ gljID: glj.ID, code: glj.code, name: glj.name, specs: glj.specs }));
  452. }
  453. // 是否为工序行
  454. function isProcessNode(node) {
  455. return node && node.depth() % 2 === 0 && node.data.type === 0
  456. }
  457. // 是否是选项行
  458. function isOptionNode(node) {
  459. return node && node.depth() % 2 === 1 && node.data.type === 0
  460. }
  461. // 判断蓝色子项和孙子项是否打勾了必填
  462. function hasRequireData(node) {
  463. const requiredList = node.getPosterity().filter(subNode =>
  464. subNode.data.required === true
  465. );
  466. if (requiredList.length) { return true }
  467. return false;
  468. }
  469. // 这里判断有无无定额的情况,有的就返回true,没有就返回false
  470. function isAllRationData(node) {
  471. let isRequired = true;
  472. if (node.children && node.children.length) {
  473. node.children.forEach(subNode => {
  474. if (!subNode.children || !subNode.children.length) {
  475. isRequired = false;
  476. }
  477. })
  478. }
  479. //这里是兼容第一层直接是定额的白色节点
  480. if (node.children && node.children.length) {
  481. node.children.forEach(subNode => {
  482. if (subNode.data.rationID) {
  483. isRequired = true;
  484. }
  485. })
  486. }
  487. return isRequired;
  488. }
  489. // 获取选套定额
  490. function getOptionalData(node, list = []) {
  491. if (isProcessNode(node)) {
  492. node.children.forEach(element => {
  493. if (element.children && element.children.length) {
  494. element.children.forEach(item => {
  495. if (item.data.rationID) {
  496. list.push(item.data.rationID);
  497. } else if (isProcessNode(item)) {
  498. getOptionalData(item, list)
  499. }
  500. })
  501. }
  502. });
  503. } else {
  504. node.children.forEach(element => {
  505. if (element.data.rationID) {
  506. list.push(element.data.rationID);
  507. }
  508. });
  509. }
  510. return list;
  511. }
  512. // 获取必填项下的ID和name的键值对
  513. function getClassCodeStrData(nodes,data={}){
  514. nodes.forEach(node=>{
  515. if (isProcessNode(node)&&node.data.required) {
  516. node.children.forEach(subNode=>{
  517. data[subNode.data.ID]=subNode.data.name;
  518. })
  519. }
  520. getClassCodeStrData(node.children,data);
  521. })
  522. return data;
  523. }
  524. //获取定额数据
  525. // requireRationData必套定额对象
  526. // optionalRationData 选逃定额对象
  527. // classGroups classCode文字和id键值对
  528. // classCodeList 各个classCode的pID和ID的关系
  529. function getItemData(nodes, requireRationData = {}, optionalRationData = {}, classGroups = {}, prefixID = '', prefixSonID = '', IDData = {}) {
  530. const processNodes = nodes.filter(node => isProcessNode(node));
  531. // const classGroups = []; // 同层必填选项的数组(二维数组)
  532. processNodes.forEach(processNode => {
  533. // 蓝色节点,必填
  534. if (processNode.data.required) {
  535. // 白色节点
  536. const optionNodes = processNode.children.filter(node => isOptionNode(node));
  537. optionNodes.forEach(optionNode => {
  538. if (!requireRationData[optionNode.data.ID]) requireRationData[optionNode.data.ID] = [];
  539. if (!optionalRationData[optionNode.data.ID]) optionalRationData[optionNode.data.ID] = [];
  540. //白色节点下没有蓝色节点,就是到底了
  541. if (!optionNode.children.some(subOptionNode => isProcessNode(subOptionNode))) {
  542. // 是否必套定额
  543. if (isAllRationData(optionNode)) {
  544. optionNode.children.forEach(subOptionNode => {
  545. requireRationData[optionNode.data.ID].push([subOptionNode.data.rationID]);
  546. })
  547. } else {
  548. optionalRationData[optionNode.data.ID] = getOptionalData(optionNode);
  549. }
  550. const kV = {};
  551. kV[optionNode.data.ID] = optionNode.data.name;
  552. Object.assign(classGroups, kV);
  553. } else {
  554. const kV = {};
  555. kV[optionNode.data.ID] = optionNode.data.name;
  556. Object.assign(classGroups, kV);
  557. // 后代项是否有必填
  558. if (hasRequireData(optionNode)) {
  559. //后代项有必填
  560. prefixSonID = '';
  561. getItemData(optionNode.children, requireRationData, optionalRationData, classGroups, optionNode.data.ID, prefixSonID, IDData);
  562. } else {
  563. //后代项无必填
  564. optionNode.children.forEach(subOptionNode => {
  565. // 是否必套定额
  566. if (isAllRationData(optionNode)) {
  567. if (!requireRationData[subOptionNode.parent.data.ID]) requireRationData[subOptionNode.parent.data.ID] = [];
  568. requireRationData[subOptionNode.parent.data.ID].push(getOptionalData(subOptionNode));
  569. } else {
  570. if (!optionalRationData[subOptionNode.parent.data.ID]) optionalRationData[subOptionNode.parent.data.ID] = [];
  571. optionalRationData[subOptionNode.parent.data.ID].push(...getOptionalData(subOptionNode));
  572. }
  573. })
  574. }
  575. }
  576. })
  577. } else {
  578. // 蓝色节点,非必填
  579. if (hasRequireData(processNode)) {
  580. //后代项有必填
  581. if (isProcessNode(processNode)) {
  582. //蓝色
  583. // 是否必套定额
  584. if (isAllRationData(processNode)) {
  585. processNode.children.forEach((subProcessNode) => {
  586. subProcessNode.children.forEach((sSubProcessNode) => {
  587. //这里是特殊处理,因为原来的逻辑是直接把定额绑到必填白色选项中下面的,每个蓝色的一组,但是这样是不对的,需要绑定在必填白色选项下的蓝色节点,所以这里就需要传入蓝色节点的id
  588. const requireChildrenID = sSubProcessNode.parent.data.required ? prefixSonID : sSubProcessNode.data.ID;
  589. IDData[sSubProcessNode.data.ID] = prefixID;
  590. getItemData(
  591. [sSubProcessNode],
  592. requireRationData,
  593. optionalRationData,
  594. classGroups,
  595. prefixID,
  596. requireChildrenID,
  597. IDData
  598. )
  599. })
  600. })
  601. } else {
  602. // 全部选套就不用走循环了,直接按照选套执行
  603. let key = processNode.data.ID;
  604. if (prefixID) key = prefixID;
  605. if (prefixSonID) key = prefixSonID;
  606. if (!optionalRationData[key]) optionalRationData[key] = [];
  607. optionalRationData[key].push(...getOptionalData(processNode));
  608. // 因为这里没有按照走整个流程,所以文字和ID的关系需要获取补充
  609. if(hasRequireData(processNode)) Object.assign(classGroups,getClassCodeStrData(processNode.children)) ;
  610. }
  611. }
  612. } else {
  613. let key = processNode.data.ID;
  614. if (prefixID) key = prefixID;
  615. if (prefixSonID) key = prefixSonID;
  616. // 是否必套定额
  617. if (isAllRationData(processNode)) {
  618. if (!requireRationData[key]) requireRationData[key] = [];
  619. requireRationData[key].push(getOptionalData(processNode));
  620. } else {
  621. if (!optionalRationData[key]) optionalRationData[key] = [];
  622. optionalRationData[key].push(...getOptionalData(processNode));
  623. }
  624. }
  625. }
  626. })
  627. return { requireRationData, optionalRationData, classGroups, IDData }
  628. }
  629. // 从指引节点,获取分类特征、必套定额数据
  630. function getItemClassData(nodes, prefix,
  631. prefixID) {
  632. const processNodes = nodes.filter(node => isProcessNode(node));
  633. const classGroups = []; // 同层必填选项的数组(二维数组)
  634. processNodes.forEach(processNode => {
  635. const classItems = [];
  636. const optionNodes = processNode.children.filter(node => isOptionNode(node));
  637. optionNodes.forEach(optionNode => {
  638. // const name = prefix ? `${prefix}@${optionNode.data.name}` : optionNode.data.name;
  639. if (optionNode.parent && optionNode.parent.data.required && (!optionNode.children
  640. || !optionNode.children.length
  641. || (optionNode.children[0].data && optionNode.children[0].data.rationID)
  642. || !optionNode.children.some(node => isProcessNode(node)))) {
  643. // 必套定额
  644. classItems.push({ name: optionNode.data.name, ID: optionNode.data.ID });
  645. } else {
  646. // classItems.push(...getItemCharacterData(optionNode.children, optionNode.parent && optionNode.parent.data.required ? optionNode.data.name : ''));
  647. const childrenClassItem = getItemClassData(
  648. optionNode.children,
  649. optionNode.parent && optionNode.parent.data.required ? optionNode.data.name : '',
  650. optionNode.parent && optionNode.parent.data.required ? optionNode.data.ID : ''
  651. );
  652. //如果返回的子项为空,但是父项又勾选了必填,则要把本身存入数组
  653. if (optionNode.parent
  654. && optionNode.parent.data.required
  655. && childrenClassItem.length === 0
  656. ) {
  657. classItems.push({ name: optionNode.data.name, ID: optionNode.data.ID });
  658. } else {
  659. classItems.push(...childrenClassItem);
  660. }
  661. }
  662. });
  663. if (classItems.length) {
  664. classGroups.push(classItems);
  665. }
  666. });
  667. // 拼接上一文本
  668. if (classGroups[0] && classGroups[0].length) {
  669. // classGroups[0] = classGroups[0].map(name => prefix ? `${prefix}@${name}` : name);
  670. classGroups[0] = classGroups[0].map(item => {
  671. item.name = prefix ? `${prefix}@${item.name}` : item.name
  672. item.ID = prefixID ? `${prefixID}@${item.ID}` : item.ID
  673. return item;
  674. });
  675. }
  676. // 二维数组内容排列组合
  677. while (classGroups.length > 1) {
  678. const prevClassItems = classGroups[0];
  679. const nextClassItems = classGroups[1];
  680. const mergedClassItems = [];
  681. for (let i = 0; i < prevClassItems.length; i++) {
  682. for (let j = 0; j < nextClassItems.length; j++) {
  683. // 拼接文本
  684. const mergedName = `${prevClassItems[i].name}@${nextClassItems[j].name}`;
  685. const mergedID = `${prevClassItems[i].ID}@${nextClassItems[j].ID}`;
  686. mergedClassItems.push({ name: mergedName, ID: mergedID });
  687. }
  688. }
  689. classGroups.splice(0, 2, mergedClassItems);
  690. }
  691. // 去重(类别别名要唯一)
  692. const items = classGroups[0] || [];
  693. const nameMap = {};
  694. const rst = [];
  695. items.forEach(item => {
  696. if (!nameMap[item.name]) {
  697. rst.push(item);
  698. }
  699. nameMap[item.name] = true;
  700. });
  701. return rst;
  702. }
  703. // 获取选套定额:把所有分类数据的必套定额确定好了先。选套定额就是清单下所有定额除了必套的
  704. function getOptionalRationIDs(optionalRationData) {
  705. const optionalRationIDs = [];
  706. if(optionalRationData){
  707. Object.values(optionalRationData).forEach(optionalRation => {
  708. if (optionalRation.length) optionalRationIDs.push(...optionalRation);
  709. })
  710. }
  711. return [...new Set(optionalRationIDs)];
  712. }
  713. // 获取错套定额:清单下所有定额,除了分类对应的必套、选套定额
  714. function getErrorRationIDs(requiredRationIDList, optionalRationIDs, allRationIDs) {
  715. const finRequireData = [];
  716. requiredRationIDList.forEach(requiredRationIDs => {
  717. finRequireData.push(...requiredRationIDs);
  718. })
  719. const errorRationIDs = [];
  720. allRationIDs.forEach(rationID => {
  721. if (!finRequireData.includes(rationID) && !optionalRationIDs.includes(rationID)) {
  722. errorRationIDs.push(rationID);
  723. }
  724. });
  725. return [...new Set(errorRationIDs)];
  726. }
  727. //把classcode和必套选套定额结合在一起
  728. function combineData(codeData, requireRationData, optionalRationData, classGroups, IDData) {
  729. // 这里要记录下已经被绑定的选套定额,因为没有被用的定额需要绑定到各个classcode下
  730. const matchRationList = [];
  731. //这里需要把绑定在子节点的定额更新到必填的白色选项中(classcode的值)
  732. const requireCombineData = {};
  733. const optionCombineData = {};
  734. Object.keys(IDData).forEach(key => {
  735. if (!requireCombineData[IDData[key]]) requireCombineData[IDData[key]] = new Set();
  736. if (!optionCombineData[IDData[key]]) optionCombineData[IDData[key]] = new Set();
  737. if (requireRationData[key]) {
  738. requireRationData[key].forEach(subData => {
  739. subData.forEach(subItem => {
  740. requireCombineData[IDData[key]].add(subItem);
  741. })
  742. })
  743. }
  744. if (optionalRationData[key]) {
  745. optionalRationData[key].forEach(subData => {
  746. optionCombineData[IDData[key]].add(subData);
  747. })
  748. }
  749. })
  750. const finData = codeData.map(classCodeData => {
  751. const errorRationIDs = [];
  752. const optionalRationIDs = [];
  753. const requiredRationIDs = [];
  754. let name = '';
  755. const classCodeIDs = classCodeData.ID;
  756. if (/@/.test(classCodeIDs)) {
  757. classCodeIDs.split('@').forEach((classCodeID) => {
  758. if (name) {
  759. name = name + '@' + classGroups[classCodeID]
  760. } else {
  761. name = classGroups[classCodeID]
  762. };
  763. // 一组的必套定额,先去重
  764. const unitRation = [];
  765. // 这里是必填选项下绑定必套定额
  766. if (requireRationData[classCodeID] && requireRationData[classCodeID].length) {
  767. requireRationData[classCodeID].forEach(subItem => {
  768. unitRation.push(...new Set(subItem));
  769. })
  770. requiredRationIDs.push(unitRation);
  771. // 这里也要把用过的必套定额先存起来
  772. matchRationList.push(...unitRation);
  773. }
  774. //这里是必填选项下绑定在蓝色节点下的必套定额
  775. if (requireCombineData[classCodeID] && requireCombineData[classCodeID].size) {
  776. requiredRationIDs.push([...requireCombineData[classCodeID]]);
  777. // 这里也要把用过的必套定额先存起来
  778. matchRationList.push(...requireCombineData[classCodeID]);
  779. }
  780. // 这里是必填选项下绑定选套定额
  781. if (optionalRationData[classCodeID] && optionalRationData[classCodeID].length) {
  782. optionalRationIDs.push(...optionalRationData[classCodeID]);
  783. matchRationList.push(...optionalRationData[classCodeID]);
  784. }
  785. //这里是必填选项下绑定在蓝色节点下的选套定额,下同
  786. if (optionCombineData[classCodeID] && optionCombineData[classCodeID].size) {
  787. optionalRationIDs.push(...optionCombineData[classCodeID]);
  788. matchRationList.push(...optionCombineData[classCodeID]);
  789. }
  790. })
  791. return { name, requiredRationIDs, optionalRationIDs: [...new Set(optionalRationIDs)], errorRationIDs }
  792. } else {
  793. const unitRation = [];
  794. name = classGroups[classCodeIDs];
  795. if (requireRationData[classCodeIDs] && requireRationData[classCodeIDs].length){
  796. requireRationData[classCodeIDs].forEach(subItem => {
  797. unitRation.push(...new Set(subItem));
  798. })
  799. requiredRationIDs.push(unitRation);
  800. // 这里也要把用过的必套定额先存起来
  801. matchRationList.push(...unitRation);
  802. }
  803. if (requireCombineData[classCodeIDs] && requireCombineData[classCodeIDs].size) {
  804. requiredRationIDs.push([...requireCombineData[classCodeIDs]])
  805. // 这里也要把用过的必套定额先存起来
  806. matchRationList.push(...requireCombineData[classCodeIDs]);
  807. };
  808. if (optionalRationData[classCodeIDs] && optionalRationData[classCodeIDs].length) {
  809. optionalRationIDs.push(...optionalRationData[classCodeIDs]);
  810. matchRationList.push(...optionalRationData[classCodeIDs]);
  811. }
  812. if (optionCombineData[classCodeIDs] && optionCombineData[classCodeIDs].size) {
  813. optionalRationIDs.push(...optionCombineData[classCodeIDs]);
  814. matchRationList.push(...optionalRationData[classCodeIDs]);
  815. }
  816. return { name, requiredRationIDs, optionalRationIDs: [...new Set(optionalRationIDs)], errorRationIDs }
  817. }
  818. })
  819. const unMatchRation = [];
  820. Object.values(optionalRationData).forEach(data => {
  821. data.forEach((rationID) => {
  822. if (!matchRationList.includes(rationID)) {
  823. unMatchRation.push(rationID);
  824. }
  825. })
  826. })
  827. // 这里把没有使用过的必套定额也丢到了选套里面
  828. Object.values(requireRationData).forEach(data => {
  829. data.forEach((rationData) => {
  830. rationData.forEach(rationID=>{
  831. if (!matchRationList.includes(rationID)) {
  832. unMatchRation.push(rationID);
  833. }
  834. })
  835. })
  836. })
  837. return { itemClassData: finData, unMatchRation };
  838. }
  839. // 生成清单分类
  840. async function generateClassData(libID) {
  841. const lib = await billsGuideLibModel.findOne({ ID: libID }).lean();
  842. if (!lib) {
  843. throw new Error('无有效精灵库');
  844. }
  845. const guidanceItems = await billsGuideItemsModel.find({ libID }, '-_id').lean();
  846. // 清单ID - 指引数据映射
  847. const guidanceMap = {};
  848. guidanceItems.forEach(item => {
  849. (guidanceMap[item.billsID] || (guidanceMap[item.billsID] = [])).push(item);
  850. });
  851. const bills = await stdBillsModel.find({ billsLibId: lib.billsLibId }, '-_id ID ParentID NextSiblingID name code').lean();
  852. const billTree = idTree.createNew({ id: 'ID', pid: 'ParentID', nid: 'NextSiblingID', rootId: -1, autoUpdate: true });
  853. billTree.loadDatas(bills);
  854. // 叶子清单
  855. const leaves = billTree.items.filter(node => !node.children || !node.children.length);
  856. // 获取分类数据
  857. let classNum = 1;
  858. const billClassData = [];
  859. for (let billNode of leaves) {
  860. const guidanceItems = guidanceMap[billNode.data.ID];
  861. if (!guidanceItems || !guidanceItems.length) {
  862. continue;
  863. }
  864. if (billNode.data.code.startsWith('03')) continue;//先屏蔽掉03开头的清单
  865. const guidanceTree = idTree.createNew({ id: 'ID', pid: 'ParentID', nid: 'NextSiblingID', rootId: -1, autoUpdate: true });
  866. guidanceTree.loadDatas(guidanceItems);
  867. //console.log('getItemClassData start',billNode.data.name,billNode.data.code,billNode.data.ID);
  868. const classCodeData = getItemClassData(guidanceTree.roots); // 必套定额在这个方法内就获取了,避免重复执行递归方法
  869. const { requireRationData, optionalRationData, classGroups, IDData } = getItemData(guidanceTree.roots);
  870. const { itemClassData, unMatchRation } = combineData(classCodeData, requireRationData, optionalRationData, classGroups, IDData);
  871. const allRationIDs = guidanceTree.items.filter(node => !!node.data.rationID).map(node => node.data.rationID);
  872. // 选套定额ID
  873. const optionalRationIDs = getOptionalRationIDs(itemClassData, allRationIDs);
  874. //if(itemClassData.length > 1000) console.log('getItemClassData end',billNode.data.name,billNode.data.code,billNode.data.ID,itemClassData.length)
  875. itemClassData.forEach(item => {
  876. // 错套定额
  877. item.optionalRationIDs.push(...unMatchRation);
  878. const errorRationIDs = getErrorRationIDs(item.requiredRationIDs, item.optionalRationIDs, allRationIDs);
  879. if (billNode.data.ID == '1d32fa34-0a9b-11ea-a33d-5388f9783b09') console.log(item.name)
  880. billClassData.push({
  881. itemCharacter: item.name,
  882. class: classNum++,
  883. classCode: `${billNode.data.code}@${item.name}`,
  884. compilationID: lib.compilationId,
  885. name: billNode.data.name,
  886. code: billNode.data.code,
  887. requiredRationIDs: item.requiredRationIDs || [],
  888. optionalRationIDs: item.optionalRationIDs || [],
  889. errorRationIDs,
  890. });
  891. });
  892. //新增无必填时的情况
  893. if (itemClassData.length === 0) {
  894. Object.keys(requireRationData).forEach((key) => {
  895. requireRationData[key].forEach(data => {
  896. if (data.length) optionalRationIDs.push(...data);
  897. })
  898. })
  899. const errorRationIDs = getErrorRationIDs([], optionalRationIDs, allRationIDs);
  900. billClassData.push({
  901. itemCharacter: '',
  902. class: classNum++,
  903. classCode: `${billNode.data.code}`,
  904. compilationID: lib.compilationId,
  905. name: billNode.data.name,
  906. code: billNode.data.code,
  907. requiredRationIDs: [],
  908. optionalRationIDs: optionalRationIDs || [],
  909. errorRationIDs,
  910. });
  911. }
  912. }
  913. console.log(`billClassData.length`);
  914. console.log(billClassData.length);
  915. // 清空旧的分类数据
  916. await billClassModel.deleteMany({ compilationID: lib.compilationId });
  917. // 之前遇到一次性插入40w条数据的情况,会卡死,循环插入速度快很多
  918. while (billClassData.length > 10000) {
  919. const list = billClassData.splice(0, 10000);
  920. await billClassModel.insertMany(list);
  921. }
  922. await billClassModel.insertMany(billClassData);
  923. }
  924. // 获取分类excel数据
  925. async function getClassExcelData(libID) {
  926. const lib = await billsGuideLibModel.findOne({ ID: libID }, '-_id compilationId').lean();
  927. if (!lib) {
  928. throw new Error('无有效精灵库');
  929. }
  930. console.log('start');
  931. const date = Date.now();
  932. const classData = await billClassModel.find({ compilationID: lib.compilationId }).lean();
  933. console.log('end');
  934. console.log(Date.now() - date);
  935. const excelData = [['类别', '编码', '清单名称', '必填特征排列组合', '类别别名', '必套定额', '选套定额', '错套定额']];
  936. classData.forEach(item => {
  937. const excelItem = [
  938. item.class,
  939. item.code,
  940. item.name,
  941. item.itemCharacter,
  942. item.classCode,
  943. (item.requiredRationIDs || []).join('@'),
  944. (item.optionalRationIDs || []).join('@'),
  945. (item.errorRationIDs || []).join('@'),
  946. ];
  947. excelData.push(excelItem);
  948. });
  949. return excelData;
  950. }
  951. async function testItems(libID) {
  952. let items = await billsGuideItemsModel.find({ libID: libID });
  953. //删除垃圾数据
  954. let delBulk = [];
  955. let itemsMapping = {};
  956. for (let item of items) {
  957. itemsMapping[item.ID] = true;
  958. }
  959. for (let item of items) {
  960. if (item.ParentID != -1 && !itemsMapping[item.ParentID]) {
  961. delBulk.push({
  962. deleteOne: {
  963. filter: { ID: item.ID }
  964. }
  965. });
  966. }
  967. }
  968. if (delBulk.length > 0) {
  969. console.log(`delBulk.length`);
  970. console.log(delBulk.length);
  971. await billsGuideItemsModel.bulkWrite(delBulk);
  972. }
  973. /* //查找同层节点含有相同NextSiblingID的节点
  974. let rst = [];
  975. let billsGroup = {};
  976. for(let item of items){
  977. if(!billsGroup[item.billsID]){
  978. billsGroup[item.billsID] = [item];
  979. }
  980. else {
  981. billsGroup[item.billsID].push(item);
  982. }
  983. }
  984. for(let bGroup in billsGroup){
  985. let group = billsGroup[bGroup];
  986. let parentGroup = {};
  987. for(let gItem of group){
  988. if(!parentGroup[gItem.ParentID]){
  989. parentGroup[gItem.ParentID] = [gItem]
  990. }
  991. else {
  992. parentGroup[gItem.ParentID].push(gItem);
  993. }
  994. }
  995. for(let pGroup in parentGroup){
  996. let pGroupData = parentGroup[pGroup];
  997. let nextGroup = {};
  998. for(let nItem of pGroupData){
  999. let sameNext = _.filter(pGroupData, {NextSiblingID: nItem.NextSiblingID});
  1000. if(sameNext.length > 1){
  1001. console.log(`sameNext`);
  1002. console.log(sameNext);
  1003. if(!nextGroup[nItem.ParentID + nItem.NextSiblingID]){
  1004. rst.push({NextSiblingID: nItem.NextSiblingID, ParentID: nItem.ParentID});
  1005. nextGroup[nItem.ParentID + nItem.NextSiblingID] = 1;
  1006. }
  1007. }
  1008. }
  1009. }
  1010. }*/
  1011. return delBulk.length;
  1012. }