123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079 |
- /**
- * (需使用 decimal.min.js, zh_calc.js)
- *
- * 构建pathTree
- * 可动态加载子节点,要求子节点获取接口按/xxx/get-children定义
- *
- * 所台账结构数据均用到该文件,请勿随意修改。
- * @param {Object} setting - 设置
- * @returns {PathTree}
- */
- 'use strict';
- const itemsPre = 'id_';
- class PosData {
- /**
- * 构造函数
- * @param {id|Number, masterId|Number} setting
- */
- constructor(setting) {
- // 无索引
- this.datas = [];
- // 以key为索引
- this.items = {};
- // 以分类id为索引的有序
- this.ledgerPos = {};
- // pos设置
- this.setting = setting;
- }
- /**
- * 加载部位明细数据
- * @param datas
- */
- loadDatas(datas) {
- this.datas = datas;
- this.items = {};
- this.ledgerPos = {};
- for (const data of this.datas) {
- const key = itemsPre + data[this.setting.id];
- this.items[key] = data;
- const masterKey = itemsPre + data[this.setting.ledgerId];
- if (!this.ledgerPos[masterKey]) {
- this.ledgerPos[masterKey] = [];
- }
- this.ledgerPos[masterKey].push(data);
- }
- for (const prop in this.ledgerPos) {
- this.resortLedgerPos(this.ledgerPos[prop]);
- }
- }
- /**
- * 更新数据
- * @param datas
- */
- updateDatas(data) {
- const datas = data instanceof Array ? data : [data];
- const result = { create: [], update: [] }, resort = [];
- for (const d of datas) {
- const key = itemsPre + d[this.setting.id];
- if (!this.items[key]) {
- this.datas.push(d);
- this.items[key] = d;
- const masterKey = itemsPre + d[this.setting.ledgerId];
- if (!this.ledgerPos[masterKey]) {
- this.ledgerPos[masterKey] = [];
- }
- this.ledgerPos[masterKey].push(d);
- result.create.push(d);
- } else {
- const pos = this.items[key];
- for (const prop in d) {
- pos[prop] = d[prop];
- }
- result.update.push(pos);
- }
- const masterKey = itemsPre + d[this.setting.ledgerId];
- if (resort.indexOf(masterKey) === -1) {
- resort.push(masterKey);
- }
- }
- if (this.setting.calcFun) {
- for (const u of result.update) {
- this.setting.calcFun(u);
- }
- for (const c of result.create) {
- this.setting.calcFun(c);
- }
- }
- for (const s of resort) {
- this.resortLedgerPos(this.ledgerPos[s]);
- }
- return result;
- }
- /**
- * 移除数据
- * @param datas
- */
- removeDatas(data) {
- if (!data) { return; }
- const datas = data instanceof Array ? data : [data];
- for (let i = datas.length - 1; i >= 0; i--) {
- const id = datas[i];
- const d = this.getPos(id);
- this.datas.splice(this.datas.indexOf(d), 1);
- const key = itemsPre + d[this.setting.id];
- delete this.items[key];
- const masterKey = itemsPre + d[this.setting.ledgerId];
- const range = this.ledgerPos[masterKey];
- range.splice(range.indexOf(d), 1);
- if (range.length === 0) {
- delete this.ledgerPos[masterKey];
- }
- }
- }
- /**
- * 移除数据 - 根据分类id
- * @param mid
- */
- removeDatasByMasterId(mid) {
- const masterKey = itemsPre + mid;
- const range = this.ledgerPos[masterKey];
- if (range) {
- delete this.ledgerPos[masterKey];
- for (const r of range) {
- this.datas.splice(this.datas.indexOf(r), 1);
- const key = itemsPre + r[this.setting.id];
- delete this.items[key];
- }
- }
- }
- getPos(id) {
- return this.items[itemsPre + id];
- }
- getLedgerPos(mid) {
- return this.ledgerPos[itemsPre + mid];
- }
- resortLedgerPos(ledgerPos) {
- const sortRule = this.setting.sort || [['porder', 'asc']];
- if (ledgerPos instanceof Array) {
- ledgerPos.sort(function (a, b) {
- for (const sr of sortRule) {
- const iSort = sr[1] === 'asc' ? a[sr[0]] - b[sr[0]] : b[sr[0]] - a[sr[0]];
- if (iSort) return iSort;
- }
- })
- }
- }
- /**
- * 计算全部
- */
- calculateAll() {
- if (!this.setting.calcFun) { return; }
- for (const pos of this.datas) {
- this.setting.calcFun(pos);
- }
- }
- set sort(sort) {
- this.setting.sort = sort;
- for (const key in this.ledgerPos) {
- this.resortLedgerPos(this.ledgerPos[key]);
- }
- }
- }
- class StagePosData extends PosData {
- loadStageData(datas, fieldPre, fields) {
- if (!datas) { return; }
- datas = datas instanceof Array ? datas : [datas];
- const loadedData = [];
- for (const data of datas) {
- let node = this.getPos(data.pid);
- if (node) {
- for (const prop of fields) {
- if (data[prop] !== undefined) {
- node[fieldPre + prop] = data[prop];
- }
- }
- if (this.setting.calcFun) {
- this.setting.calcFun(node);
- }
- loadedData.push(node);
- }
- }
- }
- loadPreStageData(datas) {
- this.loadStageData(datas, 'pre_', this.setting.updateFields);
- }
- loadCurStageData(datas) {
- this.loadStageData(datas, '', this.setting.updateFields);
- }
- }
- class MasterPosData extends PosData {
- /**
- * 构造函数
- * @param {id|Number, masterId|Number} setting
- */
- constructor(setting) {
- super(setting);
- // 关联索引
- this.masterItems = {};
- }
- /**
- * 加载主数据
- * @param datas
- */
- loadDatas(datas) {
- super.loadDatas(datas);
- // 清空旧数据
- this.masterItems = {};
- // minor数据缓存
- this.minorData = {};
- // 加载全部数据
- for (const data of this.datas) {
- const keyName = itemsPre + data[this.setting.masterId];
- this.masterItems[keyName] = data;
- }
- }
- /**
- * 根据关联id,查找节点
- * @param id
- * @returns {*}
- */
- getMasterItems(id) {
- return this.masterItems[itemsPre + id];
- }
- /**
- * 加载关联数据
- *
- * @param {Array|Object}datas - 需要关联的数据
- * @param {String} fieldPre - 关联字段前缀(关联结果)
- * @param {Array} fields - 关联字段
- * @returns {Array}
- */
- loadMinorData(datas, fieldSuf, fields) {
- if (!datas) return;
- datas = datas instanceof Array ? datas : [datas];
- this.minorData[fieldSuf] = datas;
- const loadedData = [];
- for (const data of datas) {
- let node = this.getMasterItems(data[this.setting.minorId]);
- if (node) {
- for (const prop of fields) {
- if (data[prop] !== undefined) {
- node[prop + fieldSuf] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- return loadedData;
- }
- }
- const createNewPathTree = function (type, setting) {
- class BaseTree {
- /**
- * 构造函数
- */
- constructor(setting) {
- const self = this;
- // 无索引
- this.datas = [];
- // 以key为索引indexedDB
- this.items = {};
- // 以排序为索引
- this.nodes = [];
- // 根节点
- this.children = [];
- // 树设置
- this.setting = setting;
- if (!this.setting.isLeaf) this.setting.isLeaf = 'is_leaf';
- if (!this.setting.fullPath) this.setting.fullPath = 'full_path';
- this.hasMark = false;
- if (this.setting.markExpandKey) {
- const markStr = getLocalCache(this.setting.markExpandKey);
- const markData = markStr ? markStr.split('|') : ['', ''];
- this.hasMark = markData[0] === this.setting.markExpandSubKey;
- this.markExpand = this.hasMark && markData[1] ? _.map(markData[1].split(','), _.toInteger) : [];
- } else if (this.setting.markFoldKey) {
- const markStr = getLocalCache(this.setting.markFoldKey);
- const markData = markStr ? markStr.split('|') : ['', ''];
- this.hasMark = markData[0] === this.setting.markFoldSubKey;
- this.markFold = this.hasMark && markData[1] ? _.map(markData[1].split(','), _.toInteger) : [];
- }
- // if (this.setting.treeCacheKey) {
- // localforage.getItem(this.setting.treeCacheKey).then(function (v) {
- // self.markFold = v && v.markFold ? v.markFold : [];
- // });
- // }
- }
- /**
- * 树结构根据显示排序
- */
- sortTreeNode(isResort) {
- const self = this;
- const addSortNodes = function (nodes) {
- if (!nodes) { return }
- for (let i = 0; i < nodes.length; i++) {
- self.nodes.push(nodes[i]);
- nodes[i].index = self.nodes.length - 1;
- if (!isResort) {
- nodes[i].children = self.getChildren(nodes[i]);
- } else {
- self.sortByOrder(nodes[i].children);
- }
- addSortNodes(nodes[i].children);
- }
- };
- this.nodes = [];
- if (!isResort) {
- this.children = this.getChildren();
- } else {
- this.sortByOrder(this.children);
- }
- addSortNodes(this.children);
- }
- sortByOrder(datas) {
- const setting = this.setting;
- datas.sort((a, b) => { return a[setting.order] - b[setting.order]; });
- }
- sortByLevel(datas) {
- const setting = this.setting;
- datas.sort((a, b) => { return a[setting.level] - b[setting.level]; });
- }
- sortByLevelConverse(datas) {
- const setting = this.setting;
- datas.sort((a, b) => { return b[setting.level] - a[setting.level]; });
- }
- /**
- * 加载数据(初始化), 并给数据添加部分树结构必须数据
- * @param datas
- */
- loadDatas(datas) {
- const self = this;
- // 清空旧数据
- this.items = {};
- this.nodes = [];
- this.datas = [];
- this.children = [];
- // 加载全部数据
- this.sortByLevel(datas);
- const setting = this.setting;
- for (const data of datas) {
- const keyName = itemsPre + data[this.setting.id];
- if (this.items[keyName]) continue;
- const item = JSON.parse(JSON.stringify(data));
- item.children = [];
- item.expanded = true;
- item.visible = true;
- if (item[setting.pid] === setting.rootId) {
- this.children.push(item);
- } else {
- const parent = this.getParent(item);
- if (!parent) continue;
- parent.children.push(item);
- }
- this.items[keyName] = item;
- this.datas.push(item);
- }
- this.sortByOrder(this.children);
- this.sortTreeNode(true);
- if (this.hasMark) {
- if (this.setting.markExpandKey) {
- this.expandByCustom(node => {
- return self.markExpand.indexOf(node[self.setting.id]) >= 0;
- });
- } else if (this.setting.markFoldKey) {
- this.expandByCustom(function (node) {
- return self.markFold.indexOf(node[self.setting.id]) === -1;
- });
- }
- } else {
- if (this.setting.autoExpand >= 0) {
- this.expandByLevel(this.setting.autoExpand);
- for (const node of this.nodes) {
- this._markExpandFold(node);
- }
- this._saveMarkExpandFold();
- }
- }
- }
- loadFilter(select, filterType = 'access') {
- const defaultValue = filterType === 'access' ? true : false;
- this.select = select ? select.split(',') : [];
- for (const d of this.datas) {
- d.filter = defaultValue;
- }
- const parents = [];
- for (const s of this.select) {
- const node = this.getItems(s);
- if (!node) continue;
- node.filter = !defaultValue;
- const posterity = this.getPosterity(node);
- for (const p of posterity) {
- p.filter = !defaultValue;
- }
- parents.push(...this.getAllParents(node));
- }
- this.sortByLevel(parents)
- for (const parent of parents) {
- if (!parent.children || parent.children.length === 0) continue;
- parent.filter = !parent.children.find(x => { return !x.filter });
- }
- for (const node of this.nodes) {
- const parent = this.getParent(node);
- node.visible = parent ? (parent.expanded && parent.visible && !node.filter) : !node.filter;
- }
- }
- getItemsByIndex(index) {
- return this.nodes[index];
- }
- /**
- * 根据id获取树结构节点数据
- * @param {Number} id
- * @returns {Object}
- */
- getItems(id) {
- return this.items[itemsPre + id];
- };
- getNodeIndex(node) {
- return this.nodes.indexOf(node);
- }
- /**
- * 查找node的parent
- * @param {Object} node
- * @returns {Object}
- */
- getParent(node) {
- return this.getItems(node[this.setting.pid]);
- };
- getTopParent(node) {
- const parents = this.getAllParents(node);
- this.sortByLevel(parents);
- return parents[0];
- };
- getAllParents(node) {
- const parents = [];
- if (!node) return parents;
- if (node.full_path && node.full_path !== '') {
- const parentIds = node.full_path.split('-');
- parentIds.length = parentIds.length - 1;
- for (const id of parentIds) {
- if (id !== node[this.setting.id]) {
- parents.push(this.getItems(id));
- }
- }
- } else {
- let vP = this.getParent(node);
- while (vP) {
- parents.push(vP);
- vP = this.getParent(vP);
- }
- }
- return parents;
- }
- /**
- * 查找node的前兄弟节点
- * @param node
- * @returns {*}
- */
- getPreSiblingNode(node) {
- if (!node) return null;
- const parent = this.getParent(node);
- const siblings = parent ? parent.children : this.children;
- const index = siblings.indexOf(node);
- return (index > 0) ? siblings[index - 1] : null;
- }
- /**
- * 查找node的后兄弟节点
- * @param node
- * @returns {*}
- */
- getNextSiblingNode(node) {
- const parent = this.getParent(node);
- const siblings = parent ? parent.children : this.children;
- const index = siblings.indexOf(node);
- if (index >= 0 && index < siblings.length - 1) {
- return siblings[index + 1];
- } else {
- return null;
- }
- }
- /**
- * 根据path查找完整节点
- * @param {Number} path
- */
- getFullPathNodes(path) {
- const self = this, ids = path.split('-');
- if (ids.length > 0) {
- return this.nodes.filter((x) => {
- return ids.indexOf('' + x[self.setting.id]) >= 0;
- });
- } else {
- return [];
- }
- };
- /**
- * 查询node的已下载子节点
- * @param {Object} node
- * @returns {Array}
- */
- getChildren(node) {
- const setting = this.setting;
- const pid = node ? node[setting.id] : setting.rootId;
- const children = this.datas.filter(function (x) {
- return x[setting.pid] === pid;
- });
- this.sortByOrder(children);
- return children;
- };
- /**
- * 递归方式 查询node的已下载的全部后代 (兼容full_path不存在的情况)
- * @param node
- * @returns {*}
- * @private
- */
- _recursiveGetPosterity(node) {
- let posterity = node.children;
- for (const c of node.children) {
- posterity = posterity.concat(this._recursiveGetPosterity(c));
- }
- return posterity;
- };
- /**
- * 查询node的已下载的全部后代
- * @param {Object} node
- * @returns {Array}
- */
- getPosterity(node) {
- const self = this;
- let posterity;
- if (node.full_path !== '') {
- const reg = new RegExp('^' + node.full_path + '-');
- posterity = this.datas.filter(function (x) {
- return reg.test(x.full_path);
- });
- } else {
- posterity = this._recursiveGetPosterity(node);
- }
- posterity.sort(function (x, y) {
- return self.getNodeIndex(x) - self.getNodeIndex(y);
- });
- return posterity;
- };
- /**
- * 查询node是否是父节点的最后一个子节点
- * @param {Object} node
- * @returns {boolean}
- */
- isLastSibling(node) {
- const siblings = this.getChildren(this.getParent(node));
- return (siblings && siblings.length > 0) ? node[this.setting.order] === siblings[siblings.length - 1][this.setting.order] : false;
- };
- /**
- * 查询node是否是父节点的最后一个可见子节点
- * @param {Object} node
- * @returns {boolean}
- */
- isLastViewSibling(node) {
- const siblings = (this.getChildren(this.getParent(node))).filter(x => { return !x.filter });
- return (siblings && siblings.length > 0) ? node[this.setting.order] === siblings[siblings.length - 1][this.setting.order] : false;
- };
- /**
- * 提取节点key和索引数据
- * @param {Object} node - 节点
- * @returns {key}
- */
- getNodeKeyData(node) {
- const data = {};
- for (const key of this.setting.keys) {
- data[key] = node[key];
- }
- return data;
- };
- /**
- * 得到树结构构成id
- * @param node
- * @returns {*}
- */
- getNodeKey(node) {
- return node[this.setting.id];
- };
- _markExpandFold(node) {
- if (this.setting.markExpandKey && this.setting.markExpandSubKey) {
- if (node.expanded) {
- if (this.markExpand.indexOf(node[this.setting.id]) === -1)
- this.markExpand.push(node[this.setting.id]);
- } else {
- if (this.markExpand.indexOf(node[this.setting.id]) >= 0)
- this.markExpand.splice(this.markExpand.indexOf(node[this.setting.id]), 1);
- }
- } else if (this.setting.markFoldKey && this.setting.markFoldSubKey) {
- if (!node.expanded) {
- if (this.markFold.indexOf(node[this.setting.id]) === -1)
- this.markFold.push(node[this.setting.id]);
- } else {
- if (this.markFold.indexOf(node[this.setting.id]) >= 0)
- this.markFold.splice(this.markFold.indexOf(node[this.setting.id]), 1);
- }
- }
- }
- _saveMarkExpandFold() {
- if (this.setting.markExpandKey && this.setting.markExpandSubKey) {
- setLocalCache(this.setting.markExpandKey, this.setting.markExpandSubKey + '|' + this.markExpand.join(','));
- } else if (this.setting.markFoldKey && this.setting.markFoldSubKey) {
- setLocalCache(this.setting.markFoldKey, this.setting.markFoldSubKey + '|' + this.markFold.join(','));
- }
- // if (this.setting.treeCacheKey) {
- // localforage.setItem(this.setting.treeCacheKey, {
- // markFold: this.markFold,
- // time: new Date(),
- // });
- // }
- }
- /**
- * 刷新子节点是否可见
- * @param {Object} node
- * @private
- */
- _refreshChildrenVisible(node) {
- if (!node.children) {
- node.children = this.getChildren(node);
- }
- if (node.children && node.children.length > 0) {
- for (const child of node.children) {
- child.visible = node.expanded && node.visible && !child.filter;
- this._refreshChildrenVisible(child);
- }
- }
- };
- /**
- * 设置节点是否展开, 并控制子节点可见
- * @param {Object} node
- * @param {Boolean} expanded
- */
- setExpanded(node, expanded) {
- node.expanded = expanded;
- this._markExpandFold(node);
- this._refreshChildrenVisible(node);
- this._saveMarkExpandFold();
- };
- /**
- * 递归 设置节点展开状态
- * @param {Array} nodes - 需要设置状态的节点
- * @param {Object} parent - nodes的父节点
- * @param {Function} checkFun - 判断节点展开状态的方法
- * @private
- */
- _recursiveExpand(nodes, parent, checkFun) {
- for (const node of nodes) {
- const expanded = checkFun(node);
- if (node.expanded !== expanded) {
- node.expanded = expanded;
- this._markExpandFold(node);
- }
- node.visible = parent ? (parent.expanded && parent.visible && !node.filter) : !node.filter;
- this._recursiveExpand(node.children, node, checkFun);
- }
- }
- /**
- * 自定义展开规则
- * @param checkFun
- */
- expandByCustom(checkFun) {
- this._recursiveExpand(this.children, null, checkFun);
- this._saveMarkExpandFold();
- }
- /**
- * 展开到第几层
- * @param {Number} level - 展开层数
- */
- expandByLevel(level) {
- const field = this.setting.level;
- this.expandByCustom(function (n) {
- return n[field] < level;
- });
- }
- /**
- * 自动展开节点node
- * @param node
- * @returns {*}
- */
- autoExpandNode(node) {
- const parents = this.getAllParents(node);
- const reload = [];
- for (const p of parents) {
- if (!p.expanded) {
- reload.push(p);
- this.setExpanded(p, true);
- }
- }
- return reload;
- }
- /**
- * 加载数据(动态),只加载不同部分
- * @param {Array} datas
- * @return {Array} 加载到树的数据
- * @privateA
- */
- _updateData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- let loadedData = [];
- for (const data of datas) {
- let node = this.getItems(data[this.setting.id]);
- if (node) {
- for (const prop in data) {
- if (data[prop] !== undefined && data[prop] !== node[prop]) {
- if (prop === this.setting.pid) {
- loadedData.push(this.getItems(node[this.setting.pid]));
- loadedData.push(this.getItems(data[this.setting.pid]));
- }
- if (prop === this.setting.order) {
- loadedData = loadedData.concat(this.getPosterity(node));
- }
- node[prop] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- loadedData = _.uniq(loadedData);
- for (const node of loadedData) {
- if (node) {
- node.children = this.getChildren(node);
- node.expanded = node.children.length === 0 ? true : node.children[0].visible;
- } else {
- this.children = this.getChildren(null);
- }
- }
- this.sortTreeNode(true);
- return loadedData;
- };
- /**
- * 加载数据(动态),只加载不同部分
- * @param {Array} datas
- * @return {Array} 加载到树的数据
- * @privateA
- */
- _loadData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- const loadedData = [], resortData = [];
- for (const data of datas) {
- let node = this.getItems(data[this.setting.id]);
- if (node) {
- const parent = this.getItems(node[this.setting.pid]);
- for (const prop in data) {
- if (data[prop] !== undefined && data[prop] !== node[prop]) {
- node[prop] = data[prop];
- if (parent && resortData.indexOf(parent) === -1) {
- resortData.push(parent);
- }
- }
- }
- loadedData.push(node);
- } else {
- const keyName = itemsPre + data[this.setting.id];
- const node = JSON.parse(JSON.stringify(data));
- this.items[keyName] = node;
- this.datas.push(node);
- node.expanded = true;
- node.visible = true;
- loadedData.push(node);
- if (resortData.indexOf(node) === -1) {
- resortData.push(node);
- }
- const parent = this.getItems(node[this.setting.pid]);
- if (parent && resortData.indexOf(parent) === -1) {
- resortData.push(parent);
- } else {
- resortData.push(this.setting.rootId);
- }
- }
- }
- for (const node of resortData) {
- if (node && node !== this.setting.rootId) {
- node.children = this.getChildren(node);
- } else {
- this.children = this.getChildren(null);
- }
- }
- this.sortTreeNode(true);
- for (const node of loadedData) {
- if (!node.expanded) {
- this.setExpanded(node, true);
- }
- }
- return loadedData;
- };
- /**
- * 清理数据(动态)
- * @param datas
- * @private
- */
- _freeData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- const freeDatas = [];
- const removeArrayData = function (array, data) {
- const index = array.indexOf(data);
- array.splice(index, 1);
- };
- for (const data of datas) {
- const node = this.getItems(data[this.setting.id]);
- if (node) {
- freeDatas.push(node);
- node.deleteIndex = this.nodes.indexOf(node);
- delete this.items[itemsPre + node[this.setting.id]];
- if (node[this.setting.pid] !== this.setting.rootId) {
- const parent = this.getItems(node[this.setting.pid]);
- if (parent) {
- removeArrayData(parent.children, node);
- }
- } else {
- removeArrayData(this.children, node);
- }
- removeArrayData(this.datas, node);
- }
- }
- for (const node of freeDatas) {
- removeArrayData(this.nodes, node);
- }
- return freeDatas;
- };
- /**
- * 加载需展开的数据
- * @param {Array} datas
- * @returns {Array}
- * @private
- */
- _loadExpandData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- const loadedData = [], existData = [], expandData = [], resortData = [];
- for (const data of datas) {
- let node = this.getItems(data[this.setting.id]);
- if (node) {
- existData.push(node);
- } else {
- const keyName = itemsPre + data[this.setting.id];
- const node = JSON.parse(JSON.stringify(data));
- this.items[keyName] = node;
- this.datas.push(node);
- node.expanded = false;
- node.visible = true;
- loadedData.push(node);
- if (resortData.indexOf(node) === -1) {
- resortData.push(node);
- }
- const parent = this.getItems(node[this.setting.pid]);
- if (parent && resortData.indexOf(parent) === -1) {
- resortData.push(parent);
- }
- }
- }
- for (const node of resortData) {
- node.children = this.getChildren(node);
- }
- this.sortTreeNode(true);
- for (const node of loadedData) {
- if (!node.expanded) {
- this.setExpanded(node, true);
- }
- }
- for (const node of existData) {
- const parent = this.getItems(node[this.setting.pid]);
- if (expandData.indexOf(parent) === -1) {
- expandData.push(parent);
- if (!parent.expanded) {
- this.setExpanded(parent, true);
- }
- }
- if (!node.expanded) {
- this.setExpanded(node, true);
- }
- }
- return [loadedData, expandData];
- };
- /**
- * 因为提交其他数据,引起的树结构数据更新,调用该方法
- *
- * @param data - 更新的数据 {update, create, delete}
- * @returns {{}}
- */
- loadPostData(data) {
- const result = {};
- if (data.delete) {
- result.delete = this._freeData(data.delete);
- }
- if (data.create) {
- result.create = this._loadData(data.create);
- }
- if (data.update) {
- result.update = this._updateData(data.update);
- }
- return result;
- }
- /**
- * 加载子节点
- * @param {Object} node
- * @param {function} callback
- */
- loadChildren(node, callback) {
- if (this.setting.url !== '') {
- const self = this;
- postData(this.setting.url, { postType: 'load-child', id: this.getNodeKeyData(node) }, function (data) {
- self._loadData(data);
- callback();
- });
- }
- };
- _getDefaultNodeData(node) {
- const result = {};
- for (const prop in node) {
- if (['children', 'visible', 'expanded'].indexOf(prop) >= 0) continue;
- result[prop] = node[prop];
- }
- return result;
- }
- getDefaultData(node) {
- if (node instanceof Array) {
- const arr = [];
- for (const n of node) {
- arr.push(this._getDefaultNodeData(n));
- }
- return arr;
- } else {
- this._getDefaultNodeData(node);
- }
- }
- checkParent(node, field = 'check') {
- const parent = this.getParent(node);
- return parent
- ? (parent[field] ? parent[field] : this.checkParent(parent, field))
- : false;
- }
- checkChildren(node, field = 'check') {
- for (const child of node.children) {
- if (child[field]) {
- return true;
- } else if (this.checkChildren(child, field)) {
- return true;
- }
- }
- return false;
- }
- }
- class MeasureTree extends BaseTree {
- addData(datas) {
- const loadedData = [];
- for (const data of datas) {
- let node = this.getItems(data[this.setting.id]);
- if (node) {
- for (const prop in data) {
- if (data[prop] !== undefined) {
- node[prop] = data[prop];
- }
- }
- loadedData.push(node);
- } else {
- const keyName = itemsPre + data[this.setting.id];
- const node = JSON.parse(JSON.stringify(data));
- this.items[keyName] = node;
- this.datas.push(node);
- node.expanded = false;
- node.visible = true;
- loadedData.push(node);
- }
- }
- this.sortTreeNode();
- for (const node of loadedData) {
- const children = node.children;
- if (!node.expanded && children.length > 0) {
- node.expanded = true;
- this._refreshChildrenVisible(node);
- }
- }
- return loadedData;
- }
- removeData(datas) {
- this.sortByLevel(datas);
- const removeArrayData = function (array, data) {
- const index = array.indexOf(data);
- array.splice(index, 1);
- };
- for (const data of datas) {
- const node = this.getItems(data[this.setting.id]);
- if (node && this.getChildren(node).length === 0) {
- delete this.items[itemsPre + node[this.setting.id]];
- if (node[this.setting.pid] !== this.setting.rootId) {
- const parent = this.items[itemsPre + node[this.setting.pid]];
- removeArrayData(parent.children, node);
- }
- removeArrayData(this.datas, node);
- removeArrayData(this.nodes, node);
- }
- }
- };
- loadLeafData(data) {
- const datas = data instanceof Array ? data : [data];
- for (const d of datas) {
- let node = this.getItems(d[this.setting.id]);
- if (node && node[this.setting.isLeaf]) {
- for (const prop in d) {
- if (data[prop] !== undefined) {
- node[prop] = d[prop];
- }
- }
- }
- }
- };
- }
- class FxTree extends BaseTree {
- /**
- * 检查节点是否是最底层项目节
- * @param node
- * @returns {boolean}
- */
- isLeafXmj(node) {
- if (node.b_code && node.b_code !== '') {
- return false;
- }
- for (const child of node.children) {
- if (!child.b_code || child.b_code === '') {
- return false;
- }
- }
- return true;
- }
- /**
- * 查询最底层项目节(本身或父项)
- * @param {Object} node - 查询节点
- * @returns {Object}
- */
- getLeafXmjParent(node) {
- let parent = node;
- while (parent) {
- if (this.isLeafXmj(parent)) {
- return parent;
- } else {
- parent = this.getParent(parent);
- }
- }
- return null;
- }
- /**
- * 展开至最底层项目节
- */
- expandToLeafXmj() {
- const self = this;
- this.expandByCustom(function (node) {
- if (node.b_code && node.b_code !== '') {
- return false;
- } else {
- return !self.isLeafXmj(node);
- }
- })
- }
- /**
- * 展开至计算项
- */
- expandByCalcFields() {
- const self = this;
- this.expandByCustom(function (node) {
- for (const field of self.setting.calcFields) {
- if (node[field]) {
- return true;
- }
- }
- return false;
- })
- }
- checkCodeType() {
- for (const node of this.nodes) {
- if (!node.code) continue;
- if (node.code.indexOf('-') >= 0) {
- return '07';
- } else if (node.code.length >= 5) {
- const num = _.toNumber(node.code);
- if (num && num > 10000) return '18';
- }
- }
- return '18';
- }
- getCodeSplit() {
- return this.checkCodeType() === '07' ? '-' : '0';
- }
- }
- class LedgerTree extends FxTree {
- /**
- *
- * @param parent
- * @param node
- * @private
- */
- _getNodesParents(parents, nodes) {
- for (const node of nodes) {
- const parent = this.getParent(node);
- if (parent) {
- const paths = this.getFullPathNodes(parent[this.setting.fullPath]);
- for (const p of paths) {
- if (parents.indexOf(p) === -1) {
- parents.push(p);
- }
- }
- }
- if (this.getItems(node.ledger_id) && node.children.length > 0) {
- parents.push(node);
- }
- }
- }
- _getReCalcNodes(reCalcNodes, nodes) {
- for (const node of nodes) {
- const parent = this.getParent(node);
- if (parent) {
- const paths = this.getFullPathNodes(parent[this.setting.fullPath]);
- for (const p of paths) {
- if (reCalcNodes.indexOf(p) === -1) {
- reCalcNodes.push(p);
- }
- }
- }
- // 最底层项目节,也需要计算
- //if (this.getItems(node.ledger_id) && node.children.length > 0) {
- reCalcNodes.push(node);
- //}
- }
- }
- /**
- * 因为提交其他数据,引起的树结构数据更新,调用该方法
- *
- * @param data - 更新的数据 {update, create, delete}
- * @returns {{}}
- */
- loadPostData(data) {
- const result = {}, reCalcNodes = [];
- if (!data) return result;
- if (data.delete) {
- result.delete = this._freeData(data.delete);
- this._getReCalcNodes(reCalcNodes, result.delete);
- }
- if (data.create) {
- result.create = this._loadData(data.create);
- this._getReCalcNodes(reCalcNodes, result.create);
- }
- if (data.update) {
- result.update = this._updateData(data.update);
- this._getReCalcNodes(reCalcNodes, result.update);
- }
- this.sortByLevelConverse(reCalcNodes);
- for (const node of reCalcNodes) {
- treeCalc.calculateNode(this, node, this.setting.calcFields, this.setting.calcFun);
- }
- result.update = result.update ? result.update.concat(reCalcNodes) : reCalcNodes;
- return result;
- }
- }
- class ReviseTree extends LedgerTree {
- constructor (setting) {
- super(setting);
- this.price = [];
- }
- checkNodeUsed(node, pos) {
- if (node.children && node.children.length > 0) {
- for (const child of node.children) {
- const used = this.checkNodeUsed(child, pos);
- if (used) return used;
- }
- } else {
- if (node.used) return node.used;
- const posRange = pos.getLedgerPos(node.id);
- if (posRange && posRange.length > 0) {
- for (const p of posRange) {
- if (p.used) return p.used;
- }
- }
- }
- return false;
- }
- loadRevisePrice(price, decimal) {
- this.decimal = decimal;
- this.price = price || [];
- this.rela_price = [];
- this.common_price = [];
- this.price.forEach(x => {
- if (x.rela_lid) {
- x.rela_lid = x.rela_lid.split(',');
- this.rela_price.push(x);
- } else {
- this.common_price.push(x);
- }
- });
- }
- checkRevisePrice(d) {
- if (!this.price || this.price.length === 0) return false;
- const setting = this.setting;
- const pid = this.getAllParents(d).map(x => { return x[setting.id] + ''; });
- const checkRela = function(rela_lid) {
- if (!rela_lid || rela_lid.length === 0) return false;
- for (const lid of rela_lid) {
- if (pid.indexOf(lid) >= 0) return true;
- }
- return false;
- };
- let p = this.rela_price.find(x => {
- return x.b_code === d.b_code &&
- ((!x.name && !d.name) || x.name === d.name) &&
- ((!x.unit && !d.unit) || x.unit === d.unit) &&
- checkZero(x.org_price - d.unit_price) &&
- checkRela(x.rela_lid);
- });
- if (!p) p = this.common_price.find(x => {
- return x.b_code === d.b_code &&
- ((!x.name && !d.name) || x.name === d.name) &&
- ((!x.unit && !d.unit) || x.unit === d.unit) &&
- checkZero(x.org_price - d.unit_price);
- });
- if (!p) return false;
- d.org_price = p.org_price;
- d.unit_price = p.new_price;
- d.deal_tp = ZhCalc.mul(d.deal_qty, d.unit_price, this.decimal.tp);
- d.sgfh_tp = ZhCalc.mul(d.sgfh_qty, d.unit_price, this.decimal.tp);
- d.sjcl_tp = ZhCalc.mul(d.sjcl_qty, d.unit_price, this.decimal.tp);
- d.qtcl_tp = ZhCalc.mul(d.qtcl_qty, d.unit_price, this.decimal.tp);
- d.total_price = ZhCalc.mul(d.quantity, d.unit_price, this.decimal.tp);
- return true;
- }
- loadDatas(datas) {
- super.loadDatas(datas);
- if (this.price.length > 0) {
- for (const d of this.datas) {
- if (d.children && d.children.length > 0) continue;
- if (!d.b_code) continue;
- this.checkRevisePrice(d);
- }
- }
- }
- loadPostReivsePrice(data) {
- let result = false;
- if (!this.price) return result;
- for (const d of data) {
- if (!d.is_leaf || !d.b_code) continue;
- if (this.checkRevisePrice(d)) result = true;
- }
- return result;
- }
- loadPostData(data) {
- const setting = this.setting;
- const result = {}, reCalcNodes = [];
- if (!data) return result;
- if (data.delete) {
- result.delete = this._freeData(data.delete);
- this._getReCalcNodes(reCalcNodes, result.delete);
- }
- if (data.create) {
- result.create = this._loadData(data.create);
- this.loadPostReivsePrice(result.create);
- this._getReCalcNodes(reCalcNodes, result.create);
- }
- if (data.update) {
- result.update = this._updateData(data.update);
- this.loadPostReivsePrice(result.update);
- this._getReCalcNodes(reCalcNodes, result.update);
- }
- this.sortByLevelConverse(reCalcNodes);
- for (const node of reCalcNodes) {
- treeCalc.calculateNode(this, node, this.setting.calcFields, this.setting.calcFun);
- }
- result.update = result.update ? result.update.concat(reCalcNodes) : reCalcNodes;
- return result;
- }
- }
- class StageTree extends FxTree {
- /**
- * 构造函数
- */
- constructor(setting) {
- super(setting);
- // stage关联索引
- this.stageItems = {};
- }
- _loadLockedNodes(ids){
- this.Locked = ids || [];
- for (const f of this.Locked) {
- f.ass_ledger_id = f.ass_ledger_id ? f.ass_ledger_id.split(',') : [];
- for (const id of f.ass_ledger_id) {
- const node = this.getItems(id);
- node.locked = true;
- const posterity = this.getPosterity(node);
- for (const pn of posterity) {
- pn.locked = true;
- pn.lock = true;
- }
- }
- }
- }
- /**
- * 加载数据(初始化), 并给数据添加部分树结构必须数据
- * @param datas
- */
- loadDatas(datas, locked) {
- super.loadDatas(datas);
- // 清空旧数据
- this.stageItems = {};
- // 加载全部数据
- for (const data of this.datas) {
- const keyName = itemsPre + data[this.setting.stageId];
- this.stageItems[keyName] = data;
- }
- this._loadLockedNodes(locked)
- }
- getStageItems(id) {
- return this.stageItems[itemsPre + id];
- }
- loadStageData(datas, fieldPre, fields) {
- datas = datas instanceof Array ? datas : [datas];
- const loadedData = [];
- for (const data of datas) {
- let node = this.getStageItems(data.lid);
- if (node) {
- for (const prop of fields) {
- if (data[prop] !== undefined) {
- node[fieldPre + prop] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- }
- loadPreStageData(datas) {
- this.loadStageData(datas, 'pre_', this.setting.updateFields);
- }
- loadCurStageData(datas) {
- this.loadStageData(datas, '', this.setting.updateFields);
- }
- /**
- * 加载数据(动态),只加载不同部分
- * @param {Array} datas
- * @return {Array} 加载到树的数据
- * @privateA
- */
- _updateData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- let loadedData = [];
- for (const data of datas) {
- let node = this.getItems(data[this.setting.id]);
- if (node) {
- for (const prop in data) {
- if (prop === this.setting.pid && data[prop] !== node[prop]) {
- }
- if (data[prop] !== undefined && data[prop] !== node[prop]) {
- if (prop === this.setting.pid) {
- loadedData.push(this.getItems(node[this.setting.pid]));
- loadedData.push(this.getItems(data[this.setting.pid]));
- }
- node[prop] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- loadedData = _.uniq(loadedData);
- for (const node of loadedData) {
- node.children = this.getChildren(node);
- node.expanded = node.children.length === 0 ? true : node.children[0].visible;
- }
- this.sortTreeNode(true);
- return loadedData;
- };
- /**
- * 加载数据(动态),只加载不同部分
- * @param {Array} datas
- * @return {Array} 加载到树的数据
- * @privateA
- */
- _updateStageData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- const loadedData = [];
- for (const data of datas) {
- let node = this.getStageItems(data.lid);
- if (node) {
- for (const prop of this.setting.updateFields) {
- if (data[prop] !== undefined) {
- node[prop] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- return loadedData;
- };
- /**
- *
- * @param parent
- * @param node
- * @private
- */
- _getNodesParents(parents, nodes) {
- for (const node of nodes) {
- const parent = this.getParent(node);
- if (parent) {
- const paths = this.getFullPathNodes(parent[this.setting.fullPath]);
- for (const p of paths) {
- if (parents.indexOf(p) === -1) {
- parents.push(p);
- }
- }
- }
- if (node.children && node.children.length > 0) {
- parents.push(node);
- }
- }
- }
- _updateDgnData(datas) {
- datas = datas instanceof Array ? datas : [datas];
- let loadedData = [];
- for (const data of datas) {
- let node = this.getStageItems(data.id);
- if (node) {
- for (const prop in data) {
- if (data[prop] !== undefined && data[prop] !== node[prop]) {
- node[prop] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- return loadedData;
- }
- /**
- * 提交数据至后端,返回的前端树结构应刷新的部分
- * StageTree仅有更新CurStage部分,不需要增删
- *
- * @param data - 需要更新的数据
- * @returns {Array} - 界面需要刷新的数据
- */
- loadPostStageData(data) {
- let result, parents = [];
- if (data.bills) {
- result = this._updateData(data.bills);
- this._getNodesParents(parents, result);
- }
- if (data.curStageData) {
- result = this._updateStageData(data.curStageData);
- this._getNodesParents(parents, result);
- }
- if (data.dgn) {
- const dgnResult = this._updateDgnData(data.dgn);
- result = result ? result.concat(dgnResult) : dgnResult;
- }
- result = result ? result.concat(parents) : parents;
- this.sortByLevelConverse(result);
- for (const node of result) {
- treeCalc.calculateNode(this, node);
- }
- return result;
- }
- getLockedInfo(node) {
- const ownerNodes = this.getAllParents(node);
- const lockedInfo = [];
- for (const on of ownerNodes) {
- const filter = this.Locked.filter(x => { return x.ass_ledger_id.indexOf(on.ledger_id + '') >= 0; });
- lockedInfo.push(...filter);
- }
- return lockedInfo;
- }
- }
- class MasterTree extends FxTree {
- /**
- * 构造函数
- */
- constructor(setting) {
- super(setting);
- // 关联索引
- this.masterItems = {};
- }
- /**
- * 加载数据(初始化), 并给数据添加部分树结构必须数据
- * @param datas
- */
- loadDatas(datas) {
- super.loadDatas(datas);
- // 清空旧数据
- this.masterItems = {};
- // minor数据缓存
- this.minorData = {};
- // 加载全部数据
- for (const data of this.datas) {
- const keyName = itemsPre + data[this.setting.masterId];
- this.masterItems[keyName] = data;
- }
- }
- /**
- * 根据关联id,查找节点
- * @param id
- * @returns {*}
- */
- getMasterItems(id) {
- return this.masterItems[itemsPre + id];
- }
- /**
- * 加载关联数据
- *
- * @param {Array|Object}datas - 需要关联的数据
- * @param {String} fieldPre - 关联字段前缀(关联结果)
- * @param {Array} fields - 关联字段
- * @returns {Array}
- */
- loadMinorData(datas, fieldSuf, fields, calcFields) {
- for (const cf of calcFields) {
- this.setting.calcFields.push(cf + fieldSuf);
- }
- if (!datas) return;
- datas = datas instanceof Array ? datas : [datas];
- this.minorData[fieldSuf] = datas;
- const loadedData = [];
- for (const data of datas) {
- let node = this.getMasterItems(data[this.setting.minorId]);
- if (node) {
- for (const prop of fields) {
- if (data[prop] !== undefined) {
- node[prop + fieldSuf] = data[prop];
- }
- }
- loadedData.push(node);
- }
- }
- return loadedData;
- }
- }
- class FilterTree extends BaseTree {
- clearDatas() {
- this.items = {};
- this.nodes = [];
- this.datas = [];
- this.children = [];
- }
- addData(data, fields) {
- const item = {};
- for (const prop in data) {
- if (fields.indexOf(prop) >= 0) {
- item[prop] = data[prop];
- }
- }
- const keyName = itemsPre + item[this.setting.id];
- if (!this.items[keyName]) {
- item.children = [];
- item.is_leaf = true;
- item.expanded = true;
- item.visible = true;
- this.items[keyName] = item;
- this.datas.push(item);
- if (item[setting.pid] === setting.rootId) {
- this.children.push(item);
- } else {
- const parent = this.getParent(item);
- if (parent) {
- parent.is_leaf = false;
- parent.children.push(item);
- }
- }
- } else {
- return this.items[keyName];
- }
- return item;
- }
- }
- class GatherTree extends BaseTree {
- clearDatas() {
- this.items = {};
- this.nodes = [];
- this.datas = [];
- this.children = [];
- }
- get newId() {
- if (!this._maxId) {
- this._maxId = 0;
- }
- this._maxId++;
- return this._maxId;
- }
- addNode(data, parent) {
- data[this.setting.pid] = parent ? parent[this.setting.id] : this.setting.rootId;
- let item = _.find(this.items, data);
- if (item) return item;
- item = data;
- item[this.setting.id] = this.newId;
- const keyName = itemsPre + item[this.setting.id];
- item.children = [];
- item.is_leaf = true;
- item.expanded = true;
- item.visible = true;
- this.items[keyName] = item;
- this.datas.push(item);
- if (parent) {
- item[this.setting.fullPath] = parent[this.setting.fullPath] + '-' + item[this.setting.id];
- item[this.setting.level] = parent[this.setting.level] + 1;
- item[this.setting.order] = parent.children.length + 1;
- parent.is_leaf = false;
- parent.children.push(item);
- } else {
- item[this.setting.fullPath] = '' + item[this.setting.id];
- item[this.setting.level] = 1;
- item[this.setting.order] = this.children.length + 1;
- this.children.push(item);
- }
- return item;
- }
- sortTreeNodeCustom(field, fun, isResort) {
- const self = this;
- const sortNodes = function (nodes) {
- nodes.sort(function (a, b) {
- return fun(a[field], b[field]);
- });
- for (const [i, node] of nodes.entries()) {
- node[self.setting.order] = i + 1;
- }
- };
- const addSortNodes = function (nodes) {
- if (!nodes) { return }
- for (let i = 0; i < nodes.length; i++) {
- self.nodes.push(nodes[i]);
- nodes[i].index = self.nodes.length - 1;
- if (!isResort) {
- nodes[i].children = self.getChildren(nodes[i]);
- }
- sortNodes(nodes[i].children);
- addSortNodes(nodes[i].children);
- }
- };
- this.nodes = [];
- if (!isResort) {
- this.children = this.getChildren();
- }
- sortNodes(this.children);
- addSortNodes(this.children);
- }
- }
- class CompareTree extends FxTree {
- constructor(setting) {
- super(setting);
- this._newId = 1;
- }
- get newId() {
- return this._newId++;
- }
- findCompareNode(node, parent) {
- if (this.setting.findNode) {
- return this.setting.findNode(this, node, parent);
- } else {
- const siblings = parent ? parent.children : this.children;
- return siblings.find(function (x) {
- return node.b_code
- ? x.b_code === node.b_code && x.name === node.name && x.unit === node.unit && x.unit_price === node.unit_price
- : x.code === node.code && x.name === node.name;
- });
- }
- }
- loadCompareNode(source, node, parent, loadFun) {
- let cur = this.findCompareNode(node, parent);
- if (!cur) {
- const siblings = parent ? parent.children : this.children;
- const id = this.newId;
- cur = {
- children: [], pos: [],
- code: node.code, b_code: node.b_code, name: node.name,
- unit: node.unit, unit_price: node.unit_price,
- };
- cur[this.setting.id] = id;
- cur[this.setting.pid] = parent ? parent[this.setting.id] : this.setting.rootId;
- cur[this.setting.fullPath] = parent ? parent[this.setting.fullPath] + '-' + id : '' + id;
- cur[this.setting.level] = parent ? parent[this.setting.level] + 1 : 1;
- cur[this.setting.order] = siblings.length + 1;
- siblings.push(cur);
- this.datas.push(cur);
- }
- loadFun(cur, node, source);
- for (const c of node.children) {
- this.loadCompareNode(source, c, cur, loadFun);
- }
- }
- generateSortNodes() {
- const self = this;
- const addSortNode = function (node) {
- self.nodes.push(node);
- for (const c of node.children) {
- addSortNode(c);
- }
- }
- this.nodes = [];
- for (const n of this.children) {
- addSortNode(n);
- }
- }
- loadCompareTree(data, loadFun) {
- for (const c of data.billsTree.children) {
- this.loadCompareNode(data, c, null, loadFun);
- }
- }
- calculateDiffer() {
- if (this.setting.calcDiffer) {
- for (const d of this.datas) {
- this.setting.calcDiffer(d);
- }
- }
- }
- loadCompareData(data1, data2) {
- this.loadCompareTree(data1, this.setting.loadInfo1);
- this.loadCompareTree(data2, this.setting.loadInfo2);
- for (const d of this.datas) {
- d.is_leaf = d.children.length === 0;
- d.expanded = true;
- d.visible = true;
- this.items[itemsPre + d[this.setting.id]] = d;
- }
- this.generateSortNodes();
- this.calculateDiffer();
- if (this.setting.afterLoad) this.setting.afterLoad(this);
- }
- }
- class TreeGatherTree extends FxTree {
- constructor(setting) {
- super(setting);
- this._newId = 1;
- }
- get newId() {
- return this._newId++;
- }
- loadGatherNode(node, parent, index, loadFun) {
- const siblings = parent ? parent.children : this.children;
- let cur = siblings.find(function (x) {
- return node.b_code
- ? x.b_code === node.b_code && x.name === node.name && x.unit === node.unit && x.unit_price === node.unit_price
- : x.code === node.code && x.name === node.name;
- });
- if (!cur) {
- const id = this.newId;
- cur = {
- id: id,
- pid: parent ? parent.id : this.setting.rootId,
- full_path: parent ? parent.full_path + '-' + id : '' + id,
- level: parent ? parent.level + 1 : 1,
- order: siblings.length + 1,
- children: [],
- code: node.code, b_code: node.b_code, name: node.name,
- unit: node.unit, unit_price: node.unit_price,
- };
- siblings.push(cur);
- this.datas.push(cur);
- }
- loadFun(cur, node, index);
- for (const c of node.children) {
- this.loadGatherNode(c, cur, index, loadFun);
- }
- }
- generateSortNodes() {
- const self = this;
- const addSortNode = function (node) {
- self.nodes.push(node);
- for (const c of node.children) {
- addSortNode(c);
- }
- };
- this.nodes = [];
- for (const n of this.children) {
- addSortNode(n);
- }
- }
- loadGatherTree(data, index, loadFun) {
- for (const c of data.billsTree.children) {
- this.loadGatherNode(c, null, index, loadFun);
- }
- // todo load Pos Data;
- }
- calculateSum() {
- if (this.setting.calcSum) {
- for (const d of this.datas) {
- this.setting.calcSum(d, this.count);
- }
- }
- }
- loadGatherData(datas) {
- this.count = datas.length;
- for (const [i, data] of datas.entries()) {
- this.loadGatherTree(data, i+1, this.setting.loadInfo);
- }
- for (const d of this.datas) {
- d.is_leaf = d.children.length === 0;
- d.expanded = true;
- d.visible = true;
- this.items[itemsPre + d[this.setting.id]] = d;
- }
- this.generateSortNodes();
- this.calculateSum();
- }
- }
- class FinalTree extends BaseTree {
- constructor(setting) {
- super(setting);
- this._newId = 1;
- }
- get newId() {
- return this._newId++;
- }
- loadNode(node, parent, loadFun) {
- if (node.b_code) return;
- const siblings = parent ? parent.children : this.children;
- let cur = siblings.find(function (x) {
- return x.code === node.code && x.name === node.name;
- });
- if (!cur) {
- const id = this.newId;
- cur = {
- id: id,
- pid: parent ? parent.id : this.setting.rootId,
- full_path: parent ? parent.full_path + '-' + id : '' + id,
- level: parent ? parent.level + 1 : 1,
- order: siblings.length + 1,
- children: [],
- code: node.code, name: node.name, unit: node.unit,
- };
- siblings.push(cur);
- this.datas.push(cur);
- }
- loadFun(cur, node);
- for (const c of node.children) {
- this.loadNode(c, cur, loadFun);
- }
- }
- loadTree(tree, loadFun) {
- for (const node of tree.children) {
- this.loadNode(node, null, loadFun);
- }
- }
- generateSortNodes() {
- const self = this;
- const addSortNode = function (node) {
- self.nodes.push(node);
- for (const c of node.children) {
- addSortNode(c);
- }
- };
- this.nodes = [];
- for (const n of this.children) {
- addSortNode(n);
- }
- }
- afterLoad(fun) {
- for (const d of this.datas) {
- fun && fun(d);
- d.is_leaf = d.children.length === 0;
- d.expanded = true;
- d.visible = true;
- this.items[itemsPre + d[this.setting.id]] = d;
- }
- this.generateSortNodes();
- }
- clearFinal() {
- this.datas = this.datas.filter(x => {
- return !!x.base;
- });
- this.datas.forEach(x => {
- delete x.total_price;
- delete x.dgn_qty1;
- delete x.dgn_qty2;
- delete x.dgn_qty;
- delete x.dgn_price;
- delete x.final_dgn_qty1;
- delete x.final_dgn_qty2;
- delete x.final_dgn_qty;
- delete x.final_dgn_price;
- delete x.final_tp;
- delete x.grow_dgn_qty1;
- delete x.grow_dgn_qty2;
- delete x.grow_dgn_qty;
- delete x.grow_tp;
- });
- this.loadDatas(this.datas);
- }
- resortChildrenByCustom(fun) {
- for (const n of this.nodes) {
- if (n.children && n.children.length > 1) {
- n.children.sort(fun);
- n.children.forEach((x, y) => { x.order = y + 1; });
- }
- }
- this.generateSortNodes();
- }
- }
- if (type === 'base') {
- return new BaseTree(setting);
- } else if (type === 'fx') {
- return new FxTree(setting);
- } else if (type === 'stage') {
- return new StageTree(setting);
- } else if (type === 'ledger') {
- return new LedgerTree(setting);
- } else if (type === 'revise') {
- return new ReviseTree(setting);
- } else if (type === 'measure') {
- return new MeasureTree(setting);
- } else if (type === 'master') {
- return new MasterTree(setting);
- } else if (type === 'filter') {
- return new FilterTree(setting);
- } else if (type === 'gather') {
- return new GatherTree(setting);
- } else if (type === 'compare') {
- return new CompareTree(setting);
- } else if (type === 'tree-gather') {
- return new TreeGatherTree(setting);
- } else if (type === 'final') {
- return new FinalTree(setting);
- }
- };
- const treeCalc = {
- mapTreeNode: function (tree) {
- const setting = tree.setting;
- let map = {}, maxLevel = 0;
- for (const node of tree.nodes) {
- let levelArr = map[node[setting.level]];
- if (!levelArr) {
- levelArr = [];
- map[node[setting.level]] = levelArr;
- }
- if (node[setting.level] > maxLevel) {
- maxLevel = node[setting.level];
- }
- levelArr.push(node);
- }
- return [maxLevel, map];
- },
- getMaxLevel: function (tree) {
- const setting = tree.setting;
- return Math.max.apply(Math, tree.datas.map(function (o) { return o[setting.level] }));
- },
- calculateNode: function (tree, node) {
- if (node.children && node.children.length > 0) {
- const gather = node.children.reduce(function (rst, x) {
- const result = {};
- for (const cf of tree.setting.calcFields) {
- result[cf] = ZhCalc.add(rst[cf], x[cf]);
- }
- return result;
- });
- // 汇总子项
- for (const cf of tree.setting.calcFields) {
- if (gather[cf]) {
- node[cf] = gather[cf];
- } else {
- node[cf] = null;
- }
- }
- }
- // 自身运算
- if (tree.setting.calcFun) {
- tree.setting.calcFun(node);
- }
- },
- calculateLevelNode: function (tree, level) {
- const setting = tree.setting;
- const nodes = tree.datas.filter((n) => { return n[setting.level] === level });
- for (const node of nodes) {
- this.calculateNode(tree, node);
- }
- },
- calculateAll: function (tree) {
- const [maxLevel, levelMap] = this.mapTreeNode(tree);
- for (let i = maxLevel; i >= 0; i--) {
- const levelNodes = levelMap[i];
- if (levelNodes && levelNodes.length > 0) {
- for (const node of levelNodes) {
- this.calculateNode(tree, node);
- }
- }
- }
- },
- calculateParent: function (tree, node) {
- const setting = tree.setting;
- const nodes = tree.getFullPathNodes(node[setting.fullPath]);
- tree.sortByLevel(nodes);
- for (const n of nodes) {
- this.calculateNode(tree, n);
- }
- return nodes;
- }
- };
|