tree-store.js 9.6 KB

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