facades.js 38 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957
  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 = {libID: guidanceLibId, ID: uuidV1(), ParentID: -1, NextSiblingID: jobNoIndex[i - 1] ? jobNoIndex[i - 1]['ID'] : -1,
  236. name: jobIdIndex[bill.jobs[i]['id']]['content'], type: 0, billsID: bill.ID};
  237. jobNoIndex[i] = newItem;
  238. insertArr.push({insertOne: {document: newItem}});
  239. }
  240. }
  241. await billsGuideItemsModel.bulkWrite(insertArr);
  242. }
  243. }
  244. async function initBillsGuideLib(updateData){
  245. await billsGuideLibModel.create(updateData);
  246. let compilation = await compilationModel.findOne({_id: mongoose.Types.ObjectId(updateData.compilationId)});
  247. if (compilation &&
  248. compilation.overWriteUrl &&
  249. compilation.overWriteUrl === '/web/over_write/js/chongqing_2018.js') {
  250. await genGuidanceItems_cq18(updateData.ID, updateData.billsLibId);
  251. } else {
  252. await genGuidanceItems(updateData.ID, updateData.billsLibId);
  253. }
  254. }
  255. async function updateBillsGuideLib(data) {
  256. if(data.updateType === 'delete'){
  257. //删除所有条目
  258. await billsGuideLibModel.remove(data.findData);
  259. await billsGuideItemsModel.remove({libID: data.findData.ID});
  260. }
  261. else {
  262. await billsGuideLibModel.update(data.findData, {$set: data.updateData});
  263. await engLibModel.update({'billsGuidance_lib.id': data.findData.ID}, {$set: {'billsGuidance_lib.$.name': data.updateData.name}}, {multi: true});
  264. }
  265. }
  266. async function getLibWithBills(libID){
  267. let guidanceLib = await getBillsGuideLibs({ID: libID});
  268. if(guidanceLib.length === 0){
  269. throw '不存在此指引库!';
  270. }
  271. let billsLib = await stdBillsLibModel.findOne({billsLibId: guidanceLib[0].billsLibId});
  272. if(!billsLib){
  273. throw '引用的清单规则库不存在!';
  274. }
  275. let bills = await stdBillsModel.find({billsLibId: billsLib.billsLibId}, '-_id code name ID NextSiblingID ParentID jobs items comment').lean();
  276. const guideItems = await billsGuideItemsModel.find({ libID: guidanceLib[0].ID }, '-_id billsID').lean();
  277. const billsMap = {};
  278. for (const item of guideItems) {
  279. billsMap[item.billsID] = true;
  280. }
  281. for (const item of bills) {
  282. if (billsMap[item.ID]) {
  283. item.hasGuide = true;
  284. }
  285. }
  286. return {guidanceLib: guidanceLib[0], bills};
  287. }
  288. function getAttrs(field, datas){
  289. let rst = [];
  290. for(let data of datas){
  291. if(data[field]){
  292. rst.push(data[field]);
  293. }
  294. }
  295. return rst;
  296. }
  297. //定额项目指所引用定额是否被删除
  298. function rationAllExist(rationItems, stdRationIdx) {
  299. for(let item of rationItems){
  300. if(!stdRationIdx[item.rationID]){
  301. return false;
  302. }
  303. }
  304. return true;
  305. }
  306. //将同层树结构转为顺序数组
  307. function chainToArr(nodes){
  308. let rst = [];
  309. let tempIdx = {};
  310. let nodeIdx = {};
  311. //建索引
  312. for(let node of nodes){
  313. tempIdx[node.ID] = {ID: node.ID, NextSiblingID: node.NextSiblingID, preSibling: null, nextSibling: null};
  314. nodeIdx[node.ID] = node;
  315. }
  316. //建链
  317. for(let i in tempIdx){
  318. let temp = tempIdx[i];
  319. if(temp.NextSiblingID != -1){
  320. let next = tempIdx[temp.NextSiblingID];
  321. temp.nextSibling = next;
  322. next.preSibling = temp;
  323. }
  324. }
  325. let firstNode = null;
  326. for(let i in tempIdx){
  327. if(!tempIdx[i].preSibling){
  328. firstNode = tempIdx[i];
  329. break;
  330. }
  331. }
  332. //获得顺序队列
  333. while(firstNode){
  334. rst.push(nodeIdx[firstNode.ID]);
  335. firstNode = firstNode.nextSibling;
  336. }
  337. return rst;
  338. }
  339. async function getItemsBybills(guidanceLibID, billsID){
  340. const type = {job: 0, ration: 1};
  341. let items = await billsGuideItemsModel.find({libID: guidanceLibID, billsID: billsID, deleted: false});
  342. let rationItems = _.filter(items, {type: type.ration});
  343. let rationIds = getAttrs('rationID', rationItems);
  344. let stdRations = await stdRationModel.find({ID: {$in: rationIds}, $or: [{isDeleted: null}, {isDeleted: false}]});
  345. let stdRationIndex = {};
  346. for(let stdRation of stdRations){
  347. stdRationIndex[stdRation.ID] = stdRation;
  348. }
  349. //判断定额完整性
  350. if(!rationAllExist(rationItems, stdRationIndex)){
  351. //建定额链, 排序后再清除不存在的定额,保证顺序正确性
  352. rationItems = chainToArr(rationItems);
  353. //清除已被删除的定额
  354. let removeIds = [];
  355. _.remove(rationItems, function (item) {
  356. if(!stdRationIndex[item.rationID]){
  357. removeIds.push(item.ID);
  358. return true;
  359. }
  360. return false;
  361. });
  362. _.remove(items, function (item) {
  363. return removeIds.includes(item.ID);
  364. });
  365. await billsGuideItemsModel.remove({ID: {$in: removeIds}});
  366. //重组树结构
  367. let bulkArr = [];
  368. for(let i = 0, len = rationItems.length; i < len; i++){
  369. rationItems[i].NextSiblingID = rationItems[i + 1] ? rationItems[i + 1].ID : -1;
  370. bulkArr.push({updateOne: {filter: {ID: rationItems[i].ID}, update: {$set: {NextSiblingID: rationItems[i].NextSiblingID}}}});
  371. }
  372. await billsGuideItemsModel.bulkWrite(bulkArr);
  373. }
  374. return items;
  375. }
  376. async function updateItems(updateDatas) {
  377. let bulkArr = [];
  378. for(let updateData of updateDatas){
  379. if(updateData.updateType === 'create'){
  380. bulkArr.push({insertOne: {document: updateData.updateData}});
  381. }
  382. else if(updateData.updateType === 'update'){
  383. bulkArr.push({updateOne: {filter: updateData.findData, update: {$set: updateData.updateData}}});
  384. }
  385. else{
  386. bulkArr.push({deleteOne: {filter: updateData.findData}});
  387. }
  388. }
  389. if(bulkArr.length > 0){
  390. await billsGuideItemsModel.bulkWrite(bulkArr);
  391. }
  392. }
  393. // 获取清单材料数据
  394. async function getBillMaterials(libID, billID) {
  395. // 指引下已有定额人材机(材料大类)
  396. let allGljList = [];
  397. const rationItems = await billsGuideItemsModel.find({ libID, billsID: billID, rationID: { $ne: null } }, '-_id rationID').lean();
  398. if (rationItems.length) {
  399. const rationIDs = rationItems.map(item => item.rationID);
  400. const rations = await stdRationModel.find({ ID: { $in: rationIDs } }, '-_id rationGljList');
  401. const gljIDs = [];
  402. rations.forEach(ration => {
  403. if (ration.rationGljList && ration.rationGljList.length) {
  404. gljIDs.push(...ration.rationGljList.map(rGlj => rGlj.gljId));
  405. }
  406. });
  407. if (gljIDs.length) {
  408. allGljList = await gljModel.find({ ID: { $in: [...new Set(gljIDs)] } }, '-_id ID code name specs gljType').lean();
  409. allGljList = allGljList.filter(glj => /^2/.test(glj.gljType) || [4, 5].includes(glj.gljType));
  410. }
  411. }
  412. // 清单材料
  413. let billMaterials = [];
  414. const billMaterial = await billMaterialModel.findOne({ libID, billID }).lean();
  415. if (!billMaterial || !billMaterial.materials) {
  416. return {
  417. billMaterials,
  418. allGljList
  419. };
  420. }
  421. const gljIDs = billMaterial.materials.map(m => m.gljID);
  422. const gljList = await gljModel.find({ ID: { $in: gljIDs } }, '-_id ID code name specs').lean();
  423. billMaterials = gljList.map(glj => ({ gljID: glj.ID, code: glj.code, name: glj.name, specs: glj.specs }));
  424. return {
  425. billMaterials,
  426. allGljList
  427. }
  428. }
  429. // 编辑清单材料数据,返回清单材料数据
  430. async function editBillMaterials(libID, billID, gljCodes, compilationID) {
  431. const gljLib = await gljLibModel.findOne({ compilationId: compilationID }, '-_id ID').lean();
  432. const gljList = await gljModel.find({ repositoryId: gljLib.ID, code: { $in: gljCodes }, }, '-_id ID code name specs').lean();
  433. const gljMap = {};
  434. const materials = [];
  435. gljList.forEach(glj => {
  436. materials.push({ gljID: glj.ID });
  437. gljMap[glj.code] = 1;
  438. });
  439. const missCodes = gljCodes.filter(code => !gljMap[code]);
  440. if (missCodes.length) {
  441. throw new Error(`没有找到人材机:<br/>${missCodes.join('<br/>')}`);
  442. }
  443. const billMaterial = await billMaterialModel.findOne({ libID, billID }, '-_id ID').lean();
  444. if (billMaterial) {
  445. await billMaterialModel.update({ ID: billMaterial.ID }, { $set: { materials } });
  446. } else {
  447. await billMaterialModel.create({ libID, billID, ID: uuidV1(), materials });
  448. }
  449. return gljList.map(glj => ({ gljID: glj.ID, code: glj.code, name: glj.name, specs: glj.specs }));
  450. }
  451. // 是否为工序行
  452. function isProcessNode(node) {
  453. return node && node.depth() % 2 === 0 && node.data.type === 0
  454. }
  455. // 是否是选项行
  456. function isOptionNode(node) {
  457. return node && node.depth() % 2 === 1 && node.data.type === 0
  458. }
  459. // 判断蓝色子项和孙子项是否打勾了必填
  460. function hasRequireData(node) {
  461. const requiredList = node.getPosterity().filter(subNode =>
  462. subNode.data.required === true
  463. );
  464. if (requiredList.length) { return true }
  465. return false;
  466. }
  467. // 这里判断有无无定额的情况,有的就返回true,没有就返回false
  468. function isRequireData(node) {
  469. let isRequired = true;
  470. if (node.children && node.children.length) {
  471. node.children.forEach(subNode => {
  472. if (!subNode.children || !subNode.children.length) {
  473. isRequired = false;
  474. }
  475. })
  476. }
  477. //这里是兼容第一层直接是定额的白色节点
  478. if (node.children && node.children.length) {
  479. node.children.forEach(subNode => {
  480. if (subNode.data.rationID) {
  481. isRequired = true;
  482. }
  483. })
  484. }
  485. return isRequired;
  486. }
  487. // 获取选套定额
  488. function getOptionalData(node, list = []) {
  489. node.children.forEach(element => {
  490. if (element.children && element.children.length) {
  491. element.children.forEach(item => {
  492. if (item.data.rationID) {
  493. list.push(item.data.rationID);
  494. } else if (isProcessNode(item)) {
  495. getOptionalData(item, list)
  496. }
  497. })
  498. }
  499. });
  500. return list;
  501. }
  502. // 获取最底层的定额
  503. // 只判断必套的和最简单的情况,选套的还没加
  504. function getSubData(nodes, requireRation = [], optionalRation = []) {
  505. nodes.forEach(node => {
  506. if (node.children && node.children.length > 0) {
  507. // node为白色,儿子为蓝色
  508. if (isProcessNode(node.children[0])) {
  509. getSubData(node.children, requireRation, optionalRation);
  510. } else {
  511. // node为蓝色
  512. const nodeRation = [];
  513. // 判断当前蓝色节点有没有打勾必填,有就再走一次遍历,没有就下一步判断
  514. if (hasRequireData(node)) {
  515. // 获取必套的逻辑
  516. getSubData(node.children, requireRation, optionalRation);
  517. } else {
  518. // 判断当前蓝色节点下有没有无定额的情况,存在无定额的就下面全是选套,无无定额的情况就下面全是必套
  519. if (isRequireData(node)) {
  520. node.children.forEach((subNode) => {
  521. if (subNode.children && subNode.children[0] && subNode.children[0].data.rationID) {
  522. nodeRation.push(subNode.children[0].data.rationID);
  523. } else {
  524. getSubData(subNode.children, requireRation, optionalRation);
  525. }
  526. })
  527. } else {
  528. // 这里是选套的逻辑
  529. optionalRation.push(...getOptionalData(node));
  530. }
  531. }
  532. if (nodeRation.length) requireRation.push(nodeRation);
  533. }
  534. }
  535. })
  536. return { requireRation, optionalRation };
  537. }
  538. //获取定额数据
  539. // requireRationData必套定额对象
  540. // optionalRationData 选逃定额对象
  541. // classGroups classCode文字和id键值对
  542. // classCodeList 各个classCode的pID和ID的关系
  543. // prefixID为上一个必填项的选项ID
  544. function getItemData(nodes, requireRationData={}, optionalRationData={}, classGroups={}, prefixID = '') {
  545. const processNodes = nodes.filter(node => isProcessNode(node));
  546. // const classGroups = []; // 同层必填选项的数组(二维数组)
  547. processNodes.forEach(processNode => {
  548. // 蓝色节点,必填
  549. if (processNode.data.required) {
  550. // 白色节点
  551. const optionNodes = processNode.children.filter(node => isOptionNode(node));
  552. optionNodes.forEach(optionNode => {
  553. if (!requireRationData[optionNode.data.ID]) requireRationData[optionNode.data.ID] = [];
  554. if (!optionalRationData[optionNode.data.ID]) optionalRationData[optionNode.data.ID] = [];
  555. //白色节点下没有蓝色节点,就是到底了
  556. if (!optionNode.children.some(subOptionNode => isProcessNode(subOptionNode))) {
  557. // 是否必套定额
  558. if (isRequireData(optionNode)) {
  559. optionNode.children.forEach(subOptionNode => {
  560. requireRationData[optionNode.data.ID].push([subOptionNode.data.rationID])
  561. })
  562. } else {
  563. optionalRationData[optionNode.data.ID] = getOptionalData(optionNode);
  564. }
  565. const kV = {};
  566. kV[optionNode.data.ID] = optionNode.data.name;
  567. Object.assign(classGroups, kV);
  568. } else {
  569. const kV = {};
  570. kV[optionNode.data.ID] = optionNode.data.name;
  571. Object.assign(classGroups, kV);
  572. // 后代项是否有必填
  573. if (hasRequireData(optionNode)) {
  574. //后代项有必填
  575. getItemData(optionNode.children, requireRationData, optionalRationData, classGroups, optionNode.data.ID)
  576. } else {
  577. //后代项无必填
  578. optionNode.children.forEach(subOptionNode => {
  579. // 是否必套定额
  580. if (isRequireData(optionNode)) {
  581. if (!requireRationData[subOptionNode.parent.data.ID]) requireRationData[subOptionNode.parent.data.ID] = [];
  582. requireRationData[subOptionNode.parent.data.ID].push(getOptionalData(subOptionNode));
  583. } else {
  584. if (!optionalRationData[subOptionNode.parent.data.ID]) optionalRationData[subOptionNode.data.ID] = [];
  585. optionalRationData[subOptionNode.parent.data.ID].push(...getOptionalData(subOptionNode));
  586. }
  587. })
  588. }
  589. }
  590. })
  591. } else {
  592. // 蓝色节点,非必填
  593. if (hasRequireData(processNode)) {
  594. // debugger
  595. //后代项有必填
  596. if(isProcessNode(processNode)){
  597. //蓝色
  598. processNode.children.forEach((subProcessNode)=>{
  599. subProcessNode.children.forEach((sSubProcessNode)=>{
  600. getItemData([sSubProcessNode], requireRationData, optionalRationData, classGroups,prefixID)
  601. })
  602. })
  603. }
  604. } else {
  605. let key = processNode.data.ID;
  606. if (prefixID) key = prefixID;
  607. // 是否必套定额
  608. if (isRequireData(processNode)) {
  609. if (!requireRationData[key]) requireRationData[processNode.data.ID] = [];
  610. requireRationData[key].push(getOptionalData(processNode));
  611. } else {
  612. if (!optionalRationData[key]) optionalRationData[processNode.data.ID] = [];
  613. optionalRationData[key].push(...getOptionalData(processNode));
  614. }
  615. }
  616. }
  617. })
  618. return { requireRationData, optionalRationData, classGroups}
  619. }
  620. // 从指引节点,获取分类特征、必套定额数据
  621. function getItemClassData(nodes, prefix,
  622. prefixID) {
  623. const processNodes = nodes.filter(node => isProcessNode(node));
  624. const classGroups = []; // 同层必填选项的数组(二维数组)
  625. processNodes.forEach(processNode => {
  626. const classItems = [];
  627. const optionNodes = processNode.children.filter(node => isOptionNode(node));
  628. optionNodes.forEach(optionNode => {
  629. // const name = prefix ? `${prefix}@${optionNode.data.name}` : optionNode.data.name;
  630. if (optionNode.parent && optionNode.parent.data.required && (!optionNode.children
  631. || !optionNode.children.length
  632. || (optionNode.children[0].data && optionNode.children[0].data.rationID)
  633. || !optionNode.children.some(node => isProcessNode(node)))) {
  634. // 必套定额
  635. classItems.push({ name: optionNode.data.name, ID: optionNode.data.ID });
  636. } else {
  637. // classItems.push(...getItemCharacterData(optionNode.children, optionNode.parent && optionNode.parent.data.required ? optionNode.data.name : ''));
  638. const childrenClassItem = getItemClassData(
  639. optionNode.children,
  640. optionNode.parent && optionNode.parent.data.required ? optionNode.data.name : '' ,
  641. optionNode.parent && optionNode.parent.data.required ? optionNode.data.ID : ''
  642. );
  643. //如果返回的子项为空,但是父项又勾选了必填,则要把本身存入数组
  644. if (optionNode.parent
  645. && optionNode.parent.data.required
  646. && childrenClassItem.length === 0
  647. ) {
  648. classItems.push({ name: optionNode.data.name,ID: optionNode.data.ID });
  649. } else {
  650. classItems.push(...childrenClassItem);
  651. }
  652. }
  653. });
  654. if (classItems.length) {
  655. classGroups.push(classItems);
  656. }
  657. });
  658. // 拼接上一文本
  659. if (classGroups[0] && classGroups[0].length) {
  660. // classGroups[0] = classGroups[0].map(name => prefix ? `${prefix}@${name}` : name);
  661. classGroups[0] = classGroups[0].map(item => {
  662. item.name = prefix ? `${prefix}@${item.name}` : item.name
  663. item.ID = prefixID ? `${prefixID}@${item.ID}` : item.ID
  664. return item;
  665. });
  666. }
  667. // 二维数组内容排列组合
  668. while (classGroups.length > 1) {
  669. const prevClassItems = classGroups[0];
  670. const nextClassItems = classGroups[1];
  671. const mergedClassItems = [];
  672. for (let i = 0; i < prevClassItems.length; i++) {
  673. for (let j = 0; j < nextClassItems.length; j++) {
  674. // 拼接文本
  675. const mergedName = `${prevClassItems[i].name}@${nextClassItems[j].name}`;
  676. const mergedID = `${prevClassItems[i].ID}@${nextClassItems[j].ID}`;
  677. mergedClassItems.push({ name: mergedName,ID:mergedID});
  678. }
  679. }
  680. classGroups.splice(0, 2, mergedClassItems);
  681. }
  682. // 去重(类别别名要唯一)
  683. const items = classGroups[0] || [];
  684. const nameMap = {};
  685. const rst = [];
  686. items.forEach(item => {
  687. if (!nameMap[item.name]) {
  688. rst.push(item);
  689. }
  690. nameMap[item.name] = true;
  691. });
  692. return rst;
  693. }
  694. // 获取选套定额:把所有分类数据的必套定额确定好了先。选套定额就是清单下所有定额除了必套的
  695. function getOptionalRationIDs(itemClassData, allRationIDs) {
  696. // 所有必套定额
  697. let requiredRationIDs = [];
  698. itemClassData.forEach(item => {
  699. if (item.requiredRationIDs) {
  700. requiredRationIDs.push(...item.requiredRationIDs);
  701. }
  702. });
  703. requiredRationIDs = [...new Set(requiredRationIDs)];
  704. // 选套定额就是清单下所有定额除了必套的
  705. const optionalRationIDs = [];
  706. allRationIDs.forEach(rationID => {
  707. if (!requiredRationIDs.includes(rationID)) {
  708. optionalRationIDs.push(rationID);
  709. }
  710. });
  711. return [...new Set(optionalRationIDs)];
  712. }
  713. // 获取错套定额:清单下所有定额,除了分类对应的必套、选套定额
  714. function getErrorRationIDs(requiredRationIDList, optionalRationIDs, allRationIDs) {
  715. const errorRationIDs = [];
  716. allRationIDs.forEach(rationID => {
  717. requiredRationIDList.forEach(requiredRationIDs=>{
  718. if (!requiredRationIDs.includes(rationID) && !optionalRationIDs.includes(rationID)) {
  719. errorRationIDs.push(rationID);
  720. }
  721. })
  722. });
  723. return [...new Set(errorRationIDs)];
  724. }
  725. //把classcode和必套选套定额结合在一起
  726. function combineData(classCodeData,requireRationData,optionalRationData,classGroups){
  727. return classCodeData.map(classCodeData=>{
  728. const errorRationIDs=[];
  729. const optionalRationIDs=[];
  730. const requiredRationIDs=[];
  731. let name='';
  732. const classCodeIDs=classCodeData.ID;
  733. if(/@/.test(classCodeIDs)){
  734. classCodeIDs.split('@').forEach((classCodeID)=>{
  735. if(name){
  736. name=name+'@'+classGroups[classCodeID]
  737. }else{
  738. name=classGroups[classCodeID]
  739. };
  740. if(requireRationData[classCodeID]&&requireRationData[classCodeID].length) requiredRationIDs.push(...requireRationData[classCodeID]);
  741. if(optionalRationData[classCodeID]&&optionalRationData[classCodeID].length) optionalRationIDs.push(...optionalRationData[classCodeID]);
  742. })
  743. return {name,requiredRationIDs,optionalRationIDs,errorRationIDs}
  744. }else{
  745. name=classGroups[classCodeIDs];
  746. if(requireRationData[classCodeIDs]&&requireRationData[classCodeIDs].length) requiredRationIDs.push(...requireRationData[classCodeIDs]);
  747. if(optionalRationData[classCodeIDs]&&optionalRationData[classCodeIDs].length) optionalRationIDs.push(...optionalRationData[classCodeIDs]);
  748. return {name,requiredRationIDs,optionalRationIDs,errorRationIDs}
  749. }
  750. })
  751. }
  752. // 生成清单分类
  753. async function generateClassData(libID) {
  754. const lib = await billsGuideLibModel.findOne({ ID: libID }).lean();
  755. if (!lib) {
  756. throw new Error('无有效精灵库');
  757. }
  758. const guidanceItems = await billsGuideItemsModel.find({ libID }, '-_id').lean();
  759. // 清单ID - 指引数据映射
  760. const guidanceMap = {};
  761. guidanceItems.forEach(item => {
  762. (guidanceMap[item.billsID] || (guidanceMap[item.billsID] = [])).push(item);
  763. });
  764. const bills = await stdBillsModel.find({ billsLibId: lib.billsLibId }, '-_id ID ParentID NextSiblingID name code').lean();
  765. const billTree = idTree.createNew({id: 'ID', pid: 'ParentID', nid: 'NextSiblingID', rootId: -1, autoUpdate: true});
  766. billTree.loadDatas(bills);
  767. // 叶子清单
  768. const leaves = billTree.items.filter(node => !node.children || !node.children.length);
  769. // 获取分类数据
  770. let classNum = 1;
  771. const billClassData = [];
  772. for(let billNode of leaves){
  773. const guidanceItems = guidanceMap[billNode.data.ID];
  774. if (!guidanceItems || !guidanceItems.length) {
  775. continue;
  776. }
  777. if(billNode.data.code.startsWith('03')) continue;//先屏蔽掉03开头的清单
  778. const guidanceTree = idTree.createNew({id: 'ID', pid: 'ParentID', nid: 'NextSiblingID', rootId: -1, autoUpdate: true});
  779. guidanceTree.loadDatas(guidanceItems);
  780. //console.log('getItemClassData start',billNode.data.name,billNode.data.code,billNode.data.ID);
  781. const classData = getItemClassData(guidanceTree.roots); // 必套定额在这个方法内就获取了,避免重复执行递归方法
  782. const {requireRationData,optionalRationData,classGroups} = getItemData(guidanceTree.roots);
  783. const itemClassData= combineData(classData,requireRationData,optionalRationData,classGroups);
  784. const allRationIDs = guidanceTree.items.filter(node => !!node.data.rationID).map(node => node.data.rationID);
  785. // 选套定额ID
  786. // const optionalRationIDs = getOptionalRationIDs(itemClassData, allRationIDs);
  787. //if(itemClassData.length > 1000) console.log('getItemClassData end',billNode.data.name,billNode.data.code,billNode.data.ID,itemClassData.length)
  788. itemClassData.forEach(item => {
  789. // 错套定额
  790. const errorRationIDs = getErrorRationIDs(item.requiredRationIDs, item.optionalRationIDs, allRationIDs);
  791. if(billNode.data.ID == '1d32fa34-0a9b-11ea-a33d-5388f9783b09') console.log(item.name)
  792. billClassData.push({
  793. itemCharacter: item.name,
  794. class: classNum++,
  795. classCode: `${billNode.data.code}@${item.name}`,
  796. compilationID: lib.compilationId,
  797. name: billNode.data.name,
  798. code: billNode.data.code,
  799. requiredRationIDs: item.requiredRationIDs || [],
  800. optionalRationIDs:item.optionalRationIDs || [],
  801. errorRationIDs,
  802. });
  803. });
  804. }
  805. console.log(`billClassData.length`);
  806. console.log(billClassData.length);
  807. // 清空旧的分类数据
  808. await billClassModel.deleteMany({ compilationID: lib.compilationId });
  809. // 之前遇到一次性插入40w条数据的情况,会卡死,循环插入速度快很多
  810. while (billClassData.length > 10000){
  811. const list = billClassData.splice(0,10000);
  812. await billClassModel.insertMany(list);
  813. }
  814. await billClassModel.insertMany(billClassData);
  815. }
  816. // 获取分类excel数据
  817. async function getClassExcelData(libID) {
  818. const lib = await billsGuideLibModel.findOne({ ID: libID }, '-_id compilationId').lean();
  819. if (!lib) {
  820. throw new Error('无有效精灵库');
  821. }
  822. console.log('start');
  823. const date = Date.now();
  824. const classData = await billClassModel.find({ compilationID: lib.compilationId }).lean();
  825. console.log('end');
  826. console.log(Date.now() -date);
  827. const excelData = [['类别', '编码', '清单名称', '必填特征排列组合', '类别别名', '必套定额', '选套定额', '错套定额']];
  828. classData.forEach(item => {
  829. const excelItem = [
  830. item.class,
  831. item.code,
  832. item.name,
  833. item.itemCharacter,
  834. item.classCode,
  835. (item.requiredRationIDs || []).join('@'),
  836. (item.optionalRationIDs || []).join('@'),
  837. (item.errorRationIDs || []).join('@'),
  838. ];
  839. excelData.push(excelItem);
  840. });
  841. return excelData;
  842. }
  843. async function testItems(libID) {
  844. let items = await billsGuideItemsModel.find({libID: libID});
  845. //删除垃圾数据
  846. let delBulk = [];
  847. let itemsMapping = {};
  848. for(let item of items){
  849. itemsMapping[item.ID] = true;
  850. }
  851. for(let item of items){
  852. if(item.ParentID != -1 && !itemsMapping[item.ParentID]){
  853. delBulk.push({
  854. deleteOne: {
  855. filter: {ID: item.ID}
  856. }
  857. });
  858. }
  859. }
  860. if(delBulk.length > 0){
  861. console.log(`delBulk.length`);
  862. console.log(delBulk.length);
  863. await billsGuideItemsModel.bulkWrite(delBulk);
  864. }
  865. /* //查找同层节点含有相同NextSiblingID的节点
  866. let rst = [];
  867. let billsGroup = {};
  868. for(let item of items){
  869. if(!billsGroup[item.billsID]){
  870. billsGroup[item.billsID] = [item];
  871. }
  872. else {
  873. billsGroup[item.billsID].push(item);
  874. }
  875. }
  876. for(let bGroup in billsGroup){
  877. let group = billsGroup[bGroup];
  878. let parentGroup = {};
  879. for(let gItem of group){
  880. if(!parentGroup[gItem.ParentID]){
  881. parentGroup[gItem.ParentID] = [gItem]
  882. }
  883. else {
  884. parentGroup[gItem.ParentID].push(gItem);
  885. }
  886. }
  887. for(let pGroup in parentGroup){
  888. let pGroupData = parentGroup[pGroup];
  889. let nextGroup = {};
  890. for(let nItem of pGroupData){
  891. let sameNext = _.filter(pGroupData, {NextSiblingID: nItem.NextSiblingID});
  892. if(sameNext.length > 1){
  893. console.log(`sameNext`);
  894. console.log(sameNext);
  895. if(!nextGroup[nItem.ParentID + nItem.NextSiblingID]){
  896. rst.push({NextSiblingID: nItem.NextSiblingID, ParentID: nItem.ParentID});
  897. nextGroup[nItem.ParentID + nItem.NextSiblingID] = 1;
  898. }
  899. }
  900. }
  901. }
  902. }*/
  903. return delBulk.length;
  904. }