@@ -84,7 +84,7 @@ function* treeWalker(refresh) {
84
84
const isOpened = yield refresh
85
85
? {
86
86
id,
87
- isLeaf: children .length === 0 ,
87
+ isLeaf: children? .length === 0 ,
88
88
isOpenByDefault: true ,
89
89
name,
90
90
nestingLevel,
@@ -93,13 +93,13 @@ function* treeWalker(refresh) {
93
93
94
94
// Basing on the node openness state we are deciding if we need to render
95
95
// the child nodes (if they exist).
96
- if (node . children .length !== 0 && isOpened) {
96
+ if (children? .length !== 0 && isOpened) {
97
97
// Since it is a stack structure, we need to put nodes we want to render
98
98
// first to the end of the stack.
99
- for (let i = node . children .length - 1 ; i >= 0 ; i-- ) {
99
+ for (let i = children? .length - 1 ; i >= 0 ; i-- ) {
100
100
stack .push ({
101
101
nestingLevel: nestingLevel + 1 ,
102
- node: node . children [i],
102
+ node: children[i],
103
103
});
104
104
}
105
105
}
@@ -253,18 +253,18 @@ function* treeWalker(refresh) {
253
253
// object.
254
254
defaultHeight: 30 ,
255
255
id,
256
- isLeaf: children .length === 0 ,
256
+ isLeaf: children? .length === 0 ,
257
257
isOpenByDefault: true ,
258
258
name,
259
259
nestingLevel,
260
260
}
261
261
: id;
262
262
263
- if (node . children .length !== 0 && isOpened) {
264
- for (let i = node . children .length - 1 ; i >= 0 ; i-- ) {
263
+ if (children? .length !== 0 && isOpened) {
264
+ for (let i = children? .length - 1 ; i >= 0 ; i-- ) {
265
265
stack .push ({
266
266
nestingLevel: nestingLevel + 1 ,
267
- node: node . children [i],
267
+ node: children[i],
268
268
});
269
269
}
270
270
}
0 commit comments