tree-store.js 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340
  1. import Node from './node';
  2. import { getNodeKey } from './util';
  3. export default class TreeStore {
  4. constructor(options) {
  5. this.currentNode = null;
  6. this.currentNodeKey = null;
  7. for (let option in options) {
  8. if (options.hasOwnProperty(option)) {
  9. this[option] = options[option];
  10. }
  11. }
  12. this.nodesMap = {};
  13. this.root = new Node({
  14. data: this.data,
  15. store: this
  16. });
  17. if (this.lazy && this.load) {
  18. const loadFn = this.load;
  19. loadFn(this.root, (data) => {
  20. this.root.doCreateChildren(data);
  21. this._initDefaultCheckedNodes();
  22. });
  23. } else {
  24. this._initDefaultCheckedNodes();
  25. }
  26. }
  27. filter(value) {
  28. const filterNodeMethod = this.filterNodeMethod;
  29. const lazy = this.lazy;
  30. const traverse = function(node) {
  31. const childNodes = node.root ? node.root.childNodes : node.childNodes;
  32. childNodes.forEach((child) => {
  33. child.visible = filterNodeMethod.call(child, value, child.data, child);
  34. traverse(child);
  35. });
  36. if (!node.visible && childNodes.length) {
  37. let allHidden = true;
  38. allHidden = !childNodes.some(child => child.visible);
  39. if (node.root) {
  40. node.root.visible = allHidden === false;
  41. } else {
  42. node.visible = allHidden === false;
  43. }
  44. }
  45. if (!value) return;
  46. if (node.visible && !node.isLeaf && !lazy) node.expand();
  47. };
  48. traverse(this);
  49. }
  50. setData(newVal) {
  51. const instanceChanged = newVal !== this.root.data;
  52. if (instanceChanged) {
  53. this.root.setData(newVal);
  54. this._initDefaultCheckedNodes();
  55. } else {
  56. this.root.updateChildren();
  57. }
  58. }
  59. getNode(data) {
  60. if (data instanceof Node) return data;
  61. const key = typeof data !== 'object' ? data : getNodeKey(this.key, data);
  62. return this.nodesMap[key] || null;
  63. }
  64. insertBefore(data, refData) {
  65. const refNode = this.getNode(refData);
  66. refNode.parent.insertBefore({ data }, refNode);
  67. }
  68. insertAfter(data, refData) {
  69. const refNode = this.getNode(refData);
  70. refNode.parent.insertAfter({ data }, refNode);
  71. }
  72. remove(data) {
  73. const node = this.getNode(data);
  74. if (node && node.parent) {
  75. if (node === this.currentNode) {
  76. this.currentNode = null;
  77. }
  78. node.parent.removeChild(node);
  79. }
  80. }
  81. append(data, parentData) {
  82. const parentNode = parentData ? this.getNode(parentData) : this.root;
  83. if (parentNode) {
  84. parentNode.insertChild({ data });
  85. }
  86. }
  87. _initDefaultCheckedNodes() {
  88. const defaultCheckedKeys = this.defaultCheckedKeys || [];
  89. const nodesMap = this.nodesMap;
  90. defaultCheckedKeys.forEach((checkedKey) => {
  91. const node = nodesMap[checkedKey];
  92. if (node) {
  93. node.setChecked(true, !this.checkStrictly);
  94. }
  95. });
  96. }
  97. _initDefaultCheckedNode(node) {
  98. const defaultCheckedKeys = this.defaultCheckedKeys || [];
  99. if (defaultCheckedKeys.indexOf(node.key) !== -1) {
  100. node.setChecked(true, !this.checkStrictly);
  101. }
  102. }
  103. setDefaultCheckedKey(newVal) {
  104. if (newVal !== this.defaultCheckedKeys) {
  105. this.defaultCheckedKeys = newVal;
  106. this._initDefaultCheckedNodes();
  107. }
  108. }
  109. registerNode(node) {
  110. const key = this.key;
  111. if (!key || !node || !node.data) return;
  112. const nodeKey = node.key;
  113. if (nodeKey !== undefined) this.nodesMap[node.key] = node;
  114. }
  115. deregisterNode(node) {
  116. const key = this.key;
  117. if (!key || !node || !node.data) return;
  118. node.childNodes.forEach(child => {
  119. this.deregisterNode(child);
  120. });
  121. delete this.nodesMap[node.key];
  122. }
  123. getCheckedNodes(leafOnly = false, includeHalfChecked = false) {
  124. const checkedNodes = [];
  125. const traverse = function(node) {
  126. const childNodes = node.root ? node.root.childNodes : node.childNodes;
  127. childNodes.forEach((child) => {
  128. if ((child.checked || (includeHalfChecked && child.indeterminate)) && (!leafOnly || (leafOnly && child.isLeaf))) {
  129. checkedNodes.push(child.data);
  130. }
  131. traverse(child);
  132. });
  133. };
  134. traverse(this);
  135. return checkedNodes;
  136. }
  137. getCheckedKeys(leafOnly = false) {
  138. return this.getCheckedNodes(leafOnly).map((data) => (data || {})[this.key]);
  139. }
  140. getHalfCheckedNodes() {
  141. const nodes = [];
  142. const traverse = function(node) {
  143. const childNodes = node.root ? node.root.childNodes : node.childNodes;
  144. childNodes.forEach((child) => {
  145. if (child.indeterminate) {
  146. nodes.push(child.data);
  147. }
  148. traverse(child);
  149. });
  150. };
  151. traverse(this);
  152. return nodes;
  153. }
  154. getHalfCheckedKeys() {
  155. return this.getHalfCheckedNodes().map((data) => (data || {})[this.key]);
  156. }
  157. _getAllNodes() {
  158. const allNodes = [];
  159. const nodesMap = this.nodesMap;
  160. for (let nodeKey in nodesMap) {
  161. if (nodesMap.hasOwnProperty(nodeKey)) {
  162. allNodes.push(nodesMap[nodeKey]);
  163. }
  164. }
  165. return allNodes;
  166. }
  167. updateChildren(key, data) {
  168. const node = this.nodesMap[key];
  169. if (!node) return;
  170. const childNodes = node.childNodes;
  171. for (let i = childNodes.length - 1; i >= 0; i--) {
  172. const child = childNodes[i];
  173. this.remove(child.data);
  174. }
  175. for (let i = 0, j = data.length; i < j; i++) {
  176. const child = data[i];
  177. this.append(child, node.data);
  178. }
  179. }
  180. _setCheckedKeys(key, leafOnly = false, checkedKeys) {
  181. const allNodes = this._getAllNodes().sort((a, b) => b.level - a.level);
  182. const cache = Object.create(null);
  183. const keys = Object.keys(checkedKeys);
  184. allNodes.forEach(node => node.setChecked(false, false));
  185. for (let i = 0, j = allNodes.length; i < j; i++) {
  186. const node = allNodes[i];
  187. const nodeKey = node.data[key].toString();
  188. let checked = keys.indexOf(nodeKey) > -1;
  189. if (!checked) {
  190. if (node.checked && !cache[nodeKey]) {
  191. node.setChecked(false, false);
  192. }
  193. continue;
  194. }
  195. let parent = node.parent;
  196. while (parent && parent.level > 0) {
  197. cache[parent.data[key]] = true;
  198. parent = parent.parent;
  199. }
  200. if (node.isLeaf || this.checkStrictly) {
  201. node.setChecked(true, false);
  202. continue;
  203. }
  204. node.setChecked(true, true);
  205. if (leafOnly) {
  206. node.setChecked(false, false);
  207. const traverse = function(node) {
  208. const childNodes = node.childNodes;
  209. childNodes.forEach((child) => {
  210. if (!child.isLeaf) {
  211. child.setChecked(false, false);
  212. }
  213. traverse(child);
  214. });
  215. };
  216. traverse(node);
  217. }
  218. }
  219. }
  220. setCheckedNodes(array, leafOnly = false) {
  221. const key = this.key;
  222. const checkedKeys = {};
  223. array.forEach((item) => {
  224. checkedKeys[(item || {})[key]] = true;
  225. });
  226. this._setCheckedKeys(key, leafOnly, checkedKeys);
  227. }
  228. setCheckedKeys(keys, leafOnly = false) {
  229. this.defaultCheckedKeys = keys;
  230. const key = this.key;
  231. const checkedKeys = {};
  232. keys.forEach((key) => {
  233. checkedKeys[key] = true;
  234. });
  235. this._setCheckedKeys(key, leafOnly, checkedKeys);
  236. }
  237. setDefaultExpandedKeys(keys) {
  238. keys = keys || [];
  239. this.defaultExpandedKeys = keys;
  240. keys.forEach((key) => {
  241. const node = this.getNode(key);
  242. if (node) node.expand(null, this.autoExpandParent);
  243. });
  244. }
  245. setChecked(data, checked, deep) {
  246. const node = this.getNode(data);
  247. if (node) {
  248. node.setChecked(!!checked, deep);
  249. }
  250. }
  251. getCurrentNode() {
  252. return this.currentNode;
  253. }
  254. setCurrentNode(currentNode) {
  255. const prevCurrentNode = this.currentNode;
  256. if (prevCurrentNode) {
  257. prevCurrentNode.isCurrent = false;
  258. }
  259. this.currentNode = currentNode;
  260. this.currentNode.isCurrent = true;
  261. }
  262. setUserCurrentNode(node) {
  263. const key = node[this.key];
  264. const currNode = this.nodesMap[key];
  265. this.setCurrentNode(currNode);
  266. }
  267. setCurrentNodeKey(key) {
  268. if (key === null || key === undefined) {
  269. this.currentNode && (this.currentNode.isCurrent = false);
  270. this.currentNode = null;
  271. return;
  272. }
  273. const node = this.getNode(key);
  274. if (node) {
  275. this.setCurrentNode(node);
  276. }
  277. }
  278. };