tree-store.js 8.1 KB

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