tree-store.js 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428
  1. import Node from './node';
  2. import {
  3. getNodeKey,
  4. getPropertyFromData
  5. } from '../tool/util';
  6. export default class TreeStore {
  7. constructor(options) {
  8. this.ready = false;
  9. this.currentNode = null;
  10. this.currentNodeKey = null;
  11. Object.assign(this, options);
  12. if (!this.key) {
  13. throw new Error('[Tree] nodeKey is required');
  14. }
  15. this.nodesMap = {};
  16. this.root = new Node({
  17. data: this.data,
  18. store: this
  19. });
  20. if (this.lazy && this.load) {
  21. const loadFn = this.load;
  22. loadFn(this.root, (data) => {
  23. this.root.doCreateChildren(data);
  24. this._initDefaultCheckedNodes();
  25. this.ready = true;
  26. uni.$emit('updateKey') //加了异步才会展示数据
  27. });
  28. } else {
  29. this._initDefaultCheckedNodes();
  30. this.ready = true;
  31. }
  32. }
  33. getReady() {
  34. return this.ready
  35. }
  36. filter(value, data) {
  37. const filterNodeMethod = this.filterNodeMethod;
  38. const lazy = this.lazy;
  39. const _self = this;
  40. const traverse = function(node) {
  41. const childNodes = node.root ? node.root.getChildNodes(node.root.childNodesId) : node.getChildNodes(
  42. node.childNodesId);
  43. childNodes.forEach((child) => {
  44. if (data && typeof data === 'object') {
  45. let nodePath = _self.getNodePath(child.data);
  46. if (!nodePath.some(pathItem => pathItem[_self.key] === data[_self.key])) {
  47. child.visible = false;
  48. traverse(child);
  49. return;
  50. }
  51. }
  52. if (_self.childVisibleForFilterNode) {
  53. let parent = child.getParent(child.parentId);
  54. child.visible = filterNodeMethod.call(child, value, child.data, child) || (parent &&
  55. parent.visible);
  56. } else {
  57. child.visible = filterNodeMethod.call(child, value, child.data, child);
  58. }
  59. traverse(child);
  60. });
  61. if (!node.visible && childNodes.length) {
  62. let allHidden = true;
  63. allHidden = !childNodes.some(child => child.visible);
  64. if (node.root) {
  65. node.root.visible = allHidden === false;
  66. } else {
  67. node.visible = allHidden === false;
  68. }
  69. }
  70. if (!value) return;
  71. if (node.visible && !node.isLeaf && !lazy) node.expand();
  72. };
  73. traverse(this);
  74. }
  75. setData(newVal) {
  76. const instanceChanged = newVal !== this.root.data;
  77. if (instanceChanged) {
  78. this.root.setData(newVal);
  79. this._initDefaultCheckedNodes();
  80. } else {
  81. this.root.updateChildren();
  82. }
  83. }
  84. getNode(data) {
  85. if (data instanceof Node) return data;
  86. const key = typeof data !== 'object' ? data : getNodeKey(this.key, data);
  87. if (!key) return null;
  88. return this.nodesMap[key] || null;
  89. }
  90. insertBefore(data, refData) {
  91. const refNode = this.getNode(refData);
  92. let parent = refNode.getParent(refNode.parentId);
  93. parent.insertBefore({
  94. data
  95. }, refNode);
  96. }
  97. insertAfter(data, refData) {
  98. const refNode = this.getNode(refData);
  99. let parent = refNode.getParent(refNode.parentId);
  100. parent.insertAfter({
  101. data
  102. }, refNode);
  103. }
  104. remove(data) {
  105. const node = this.getNode(data);
  106. if (node && node.parentId !== null) {
  107. let parent = node.getParent(node.parentId);
  108. if (node === this.currentNode) {
  109. this.currentNode = null;
  110. }
  111. parent.removeChild(node);
  112. }
  113. }
  114. append(data, parentData) {
  115. const parentNode = parentData ? this.getNode(parentData) : this.root;
  116. if (parentNode) {
  117. parentNode.insertChild({
  118. data
  119. });
  120. }
  121. }
  122. _initDefaultCheckedNodes() {
  123. const defaultCheckedKeys = this.defaultCheckedKeys || [];
  124. const nodesMap = this.nodesMap;
  125. let checkedKeyfromData = [];
  126. let totalCheckedKeys = []
  127. for (let key in nodesMap) {
  128. let checked = getPropertyFromData(nodesMap[key], 'checked') || false;
  129. checked && checkedKeyfromData.push(key);
  130. }
  131. totalCheckedKeys = Array.from(new Set([...defaultCheckedKeys, ...checkedKeyfromData]));
  132. totalCheckedKeys.forEach((checkedKey) => {
  133. const node = nodesMap[checkedKey];
  134. if (node) {
  135. node.setChecked(true, !this.checkStrictly);
  136. }
  137. });
  138. }
  139. _initDefaultCheckedNode(node) {
  140. const defaultCheckedKeys = this.defaultCheckedKeys || [];
  141. if (defaultCheckedKeys.indexOf(node.key) !== -1) {
  142. node.setChecked(true, !this.checkStrictly);
  143. }
  144. }
  145. toggleExpendAll(isExpandAll) {
  146. const allNodes = this._getAllNodes();
  147. allNodes.forEach(item => {
  148. const node = this.getNode(item.key);
  149. if (node) isExpandAll ? node.expand() : node.collapse();
  150. });
  151. }
  152. setCheckAll(isCkeckAll) {
  153. const allNodes = this._getAllNodes();
  154. allNodes.forEach(item => {
  155. item.setChecked(isCkeckAll, false);
  156. });
  157. }
  158. setDefaultCheckedKey(newVal) {
  159. if (newVal !== this.defaultCheckedKeys) {
  160. this.defaultCheckedKeys = newVal;
  161. this._initDefaultCheckedNodes();
  162. }
  163. }
  164. registerNode(node) {
  165. const key = this.key;
  166. if (!key || !node || !node.data) return;
  167. const nodeKey = node.key;
  168. if (nodeKey !== undefined) this.nodesMap[node.key] = node;
  169. }
  170. deregisterNode(node) {
  171. const key = this.key;
  172. if (!key || !node || !node.data) return;
  173. let childNodes = node.getChildNodes(node.childNodesId);
  174. childNodes.forEach(child => {
  175. this.deregisterNode(child);
  176. });
  177. delete this.nodesMap[node.key];
  178. }
  179. getNodePath(data) {
  180. if (!this.key) throw new Error('[Tree] nodeKey is required in getNodePath');
  181. const node = this.getNode(data);
  182. if (!node) return [];
  183. const path = [node.data];
  184. let parent = node.getParent(node.parentId);
  185. while (parent && parent !== this.root) {
  186. path.push(parent.data);
  187. parent = parent.getParent(parent.parentId);
  188. }
  189. return path.reverse();
  190. }
  191. getCheckedNodes(leafOnly = false, includeHalfChecked = false) {
  192. const checkedNodes = [];
  193. const traverse = function(node) {
  194. const childNodes = node.root ? node.root.getChildNodes(node.root.childNodesId) : node.getChildNodes(
  195. node.childNodesId);
  196. childNodes.forEach((child) => {
  197. if ((child.checked || (includeHalfChecked && child.indeterminate)) && (!leafOnly || (
  198. leafOnly && child.isLeaf))) {
  199. checkedNodes.push(child.data);
  200. }
  201. traverse(child);
  202. });
  203. };
  204. traverse(this);
  205. return checkedNodes;
  206. }
  207. getCheckedKeys(leafOnly = false, includeHalfChecked = false) {
  208. return this.getCheckedNodes(leafOnly, includeHalfChecked).map((data) => (data || {})[this.key]);
  209. }
  210. getHalfCheckedNodes() {
  211. const nodes = [];
  212. const traverse = function(node) {
  213. const childNodes = node.root ? node.root.getChildNodes(node.root.childNodesId) : node.getChildNodes(
  214. node.childNodesId);
  215. childNodes.forEach((child) => {
  216. if (child.indeterminate) {
  217. nodes.push(child.data);
  218. }
  219. traverse(child);
  220. });
  221. };
  222. traverse(this);
  223. return nodes;
  224. }
  225. getHalfCheckedKeys() {
  226. return this.getHalfCheckedNodes().map((data) => (data || {})[this.key]);
  227. }
  228. _getAllNodes() {
  229. const allNodes = [];
  230. const nodesMap = this.nodesMap;
  231. for (let nodeKey in nodesMap) {
  232. if (nodesMap.hasOwnProperty(nodeKey)) {
  233. allNodes.push(nodesMap[nodeKey]);
  234. }
  235. }
  236. return allNodes;
  237. }
  238. updateChildren(key, data) {
  239. const node = this.nodesMap[key];
  240. if (!node) return;
  241. const childNodes = node.getChildNodes(node.childNodesId);
  242. for (let i = childNodes.length - 1; i >= 0; i--) {
  243. const child = childNodes[i];
  244. this.remove(child.data);
  245. }
  246. for (let i = 0, j = data.length; i < j; i++) {
  247. const child = data[i];
  248. this.append(child, node.data);
  249. }
  250. }
  251. _setCheckedKeys(key, leafOnly = false, checkedKeys) {
  252. const allNodes = this._getAllNodes().sort((a, b) => b.level - a.level);
  253. const cache = Object.create(null);
  254. const keys = Object.keys(checkedKeys);
  255. allNodes.forEach(node => node.setChecked(false, false));
  256. for (let i = 0, j = allNodes.length; i < j; i++) {
  257. const node = allNodes[i];
  258. let nodeKey = node.data[key];
  259. if (typeof nodeKey === 'undefined') continue;
  260. nodeKey = nodeKey.toString();
  261. let checked = keys.indexOf(nodeKey) > -1;
  262. if (!checked) {
  263. if (node.checked && !cache[nodeKey]) {
  264. node.setChecked(false, false);
  265. }
  266. continue;
  267. }
  268. let parent = node.getParent(node.parentId);
  269. while (parent && parent.level > 0) {
  270. cache[parent.data[key]] = true;
  271. parent = parent.getParent(parent.parentId);
  272. }
  273. if (node.isLeaf || this.checkStrictly) {
  274. node.setChecked(true, false);
  275. continue;
  276. }
  277. node.setChecked(true, true);
  278. if (leafOnly) {
  279. node.setChecked(false, false);
  280. const traverse = function(node) {
  281. const childNodes = node.getChildNodes(node.childNodesId);
  282. childNodes.forEach((child) => {
  283. if (!child.isLeaf) {
  284. child.setChecked(false, false);
  285. }
  286. traverse(child);
  287. });
  288. };
  289. traverse(node);
  290. }
  291. }
  292. }
  293. setCheckedNodes(array, leafOnly = false) {
  294. const key = this.key;
  295. const checkedKeys = {};
  296. array.forEach((item) => {
  297. checkedKeys[(item || {})[key]] = true;
  298. });
  299. this._setCheckedKeys(key, leafOnly, checkedKeys);
  300. }
  301. setCheckedKeys(keys, leafOnly = false) {
  302. this.defaultCheckedKeys = keys;
  303. const key = this.key;
  304. const checkedKeys = {};
  305. keys.forEach((key) => {
  306. checkedKeys[key] = true;
  307. });
  308. this._setCheckedKeys(key, leafOnly, checkedKeys);
  309. }
  310. setDefaultExpandedKeys(keys) {
  311. keys = keys || [];
  312. this.defaultExpandedKeys = keys;
  313. keys.forEach((key) => {
  314. const node = this.getNode(key);
  315. if (node) node.expand(null, this.autoExpandParent);
  316. });
  317. }
  318. setChecked(data, checked, deep) {
  319. const node = this.getNode(data);
  320. if (node) {
  321. node.setChecked(!!checked, deep);
  322. }
  323. }
  324. getCurrentNode() {
  325. return this.currentNode;
  326. }
  327. setCurrentNode(currentNode) {
  328. const prevCurrentNode = this.currentNode;
  329. if (prevCurrentNode) {
  330. prevCurrentNode.isCurrent = false;
  331. }
  332. this.currentNode = currentNode;
  333. this.currentNode.isCurrent = true;
  334. this.expandCurrentNodeParent && this.currentNode.expand(null, true)
  335. }
  336. setUserCurrentNode(node) {
  337. const key = node[this.key];
  338. const currNode = this.nodesMap[key];
  339. this.setCurrentNode(currNode);
  340. }
  341. setCurrentNodeKey(key) {
  342. if (key === null || key === undefined) {
  343. this.currentNode && (this.currentNode.isCurrent = false);
  344. this.currentNode = null;
  345. return;
  346. }
  347. const node = this.getNode(key);
  348. if (node) {
  349. this.setCurrentNode(node);
  350. }
  351. }
  352. };