splitgraph.com/lib/tree.js at master · splitgraph/splitgraph.com · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
const mapTree = ({
  root,
  callback = (item, parent, depth) => {
    // no-op
  },
  parent,
  twin = {},
  depth = 0,
}) => {
  if (!root) {
    return;
  }

  root.children = root.children
    ? root.children.filter((c) => !!c && Object.keys(c).length > 0 && !c.isMeta)
    : undefined;

  if (root.children) {
    twin.children = [];
    for (let i = 0; i < root.children.length; i++) {
      let node = root.children[i];
      twin.children.push(
        mapTree({
          root: node,
          callback: callback,
          parent: root,
          twin: twin.children[i],
          depth: depth + 1,
        })
      );
    }
  }

  Object.assign(twin, callback(root, parent, depth));

  return twin;
};

const walkTree = ({
  root,
  callback = (item, parent, depth) => {
    // no-op
  },
  parent,
  depth = 0,
}) => {
  if (!root) {
    return;
  }

  root.children = root.children
    ? root.children.filter((c) => !!c && Object.keys(c).length > 0 && !c.isMeta)
    : undefined;

  if (root.children) {
    root.children.forEach((node) =>
      walkTree({
        root: node,
        callback: callback,
        parent: root,
        depth: depth + 1,
      })
    );
  }

  return callback(root, parent, depth);
};

const filterTree = ({ root, match = (node) => false }) => {
  const foundNodes = [];

  walkTree({
    root,
    callback: (node) => {
      if (match(node)) {
        foundNodes.push(node);
      }
    },
    parent: null,
  });

  return foundNodes;
};

// TODO
// This should not loop over the whole tree. need a way to "break" from walk
// This is currently returning the *last* found node w/ this ID instead of the first,
// but IDs are supposed to be unique

//
// It would probably be best to simply memoize the chain of parents when walking the tree,
// but that requires picking ahead of time which is the "id" key (could be optionally passed)
//

const findNodeInTree = ({ root, match = (node) => false }) => {
  return filterTree({ root, match }).pop();
};

const findParentsOfNodeInTree = ({ root, match }) => {
  const parents = filterTree({
    root,
    match: (node) =>
      findNodeInTree({
        root: node,
        match,
      }),
  });

  return parents;
};

const flattenTree = ({ root, filter }) => {
  const flattened = [];

  walkTree({
    root,
    callback: (item, parent, depth) => {
      if (!!filter && !filter(item)) {
        return;
      }

      flattened.push({
        ...item,
        parent,
        depth,
      });
    },
  });

  return flattened;
};

const sortTree = ({ root, comparator = (a, b) => 0 }) => {
  return mapTree({
    root,
    callback: (item) =>
      item.children
        ? {
            ...item,
            children: item.children.sort(comparator),
          }
        : item,
  });
};

module.exports = {
  sortTree,
  mapTree,
  walkTree,
  filterTree,
  findNodeInTree,
  findParentsOfNodeInTree,
  flattenTree,
};