tree-store.js 9.7 KB

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