有个边界没处理好
This commit is contained in:
parent
bd8eca9943
commit
ac57e2473d
|
|
@ -1923,11 +1923,13 @@ export class RunningTree extends Feature {
|
||||||
createNode(options, isPage) {
|
createNode(options, isPage) {
|
||||||
const { entity, pagination, path: fullPath, filters, sorters, projection, isList, id, getTotal, zombie, stale, } = options;
|
const { entity, pagination, path: fullPath, filters, sorters, projection, isList, id, getTotal, zombie, stale, } = options;
|
||||||
const rollback = this.begin();
|
const rollback = this.begin();
|
||||||
this.redoBranchModis(fullPath);
|
|
||||||
this.redoBranchOperations(fullPath);
|
|
||||||
let node;
|
let node;
|
||||||
const { parent, path } = analyzePath(fullPath);
|
const { parent, path } = analyzePath(fullPath);
|
||||||
const parentNode = parent ? this.findNode(parent) : undefined;
|
const parentNode = parent ? this.findNode(parent) : undefined;
|
||||||
|
if (parentNode) {
|
||||||
|
this.redoBranchModis(fullPath);
|
||||||
|
this.redoBranchOperations(fullPath);
|
||||||
|
}
|
||||||
node = this.findNode(fullPath);
|
node = this.findNode(fullPath);
|
||||||
// 找到了之前的node,需要检查是否需要重用
|
// 找到了之前的node,需要检查是否需要重用
|
||||||
if (node) {
|
if (node) {
|
||||||
|
|
|
||||||
|
|
@ -1926,11 +1926,13 @@ class RunningTree extends Feature_1.Feature {
|
||||||
createNode(options, isPage) {
|
createNode(options, isPage) {
|
||||||
const { entity, pagination, path: fullPath, filters, sorters, projection, isList, id, getTotal, zombie, stale, } = options;
|
const { entity, pagination, path: fullPath, filters, sorters, projection, isList, id, getTotal, zombie, stale, } = options;
|
||||||
const rollback = this.begin();
|
const rollback = this.begin();
|
||||||
this.redoBranchModis(fullPath);
|
|
||||||
this.redoBranchOperations(fullPath);
|
|
||||||
let node;
|
let node;
|
||||||
const { parent, path } = analyzePath(fullPath);
|
const { parent, path } = analyzePath(fullPath);
|
||||||
const parentNode = parent ? this.findNode(parent) : undefined;
|
const parentNode = parent ? this.findNode(parent) : undefined;
|
||||||
|
if (parentNode) {
|
||||||
|
this.redoBranchModis(fullPath);
|
||||||
|
this.redoBranchOperations(fullPath);
|
||||||
|
}
|
||||||
node = this.findNode(fullPath);
|
node = this.findNode(fullPath);
|
||||||
// 找到了之前的node,需要检查是否需要重用
|
// 找到了之前的node,需要检查是否需要重用
|
||||||
if (node) {
|
if (node) {
|
||||||
|
|
|
||||||
|
|
@ -2325,11 +2325,13 @@ export class RunningTree<ED extends EntityDict & BaseEntityDict> extends Feature
|
||||||
stale,
|
stale,
|
||||||
} = options;
|
} = options;
|
||||||
const rollback = this.begin();
|
const rollback = this.begin();
|
||||||
this.redoBranchModis(fullPath);
|
|
||||||
this.redoBranchOperations(fullPath);
|
|
||||||
let node: ListNode<ED, T> | SingleNode<ED, T> | VirtualNode<ED> | undefined;
|
let node: ListNode<ED, T> | SingleNode<ED, T> | VirtualNode<ED> | undefined;
|
||||||
const { parent, path } = analyzePath(fullPath);
|
const { parent, path } = analyzePath(fullPath);
|
||||||
const parentNode = parent ? this.findNode(parent) : undefined;
|
const parentNode = parent ? this.findNode(parent) : undefined;
|
||||||
|
if (parentNode) {
|
||||||
|
this.redoBranchModis(fullPath);
|
||||||
|
this.redoBranchOperations(fullPath);
|
||||||
|
}
|
||||||
node = this.findNode(fullPath) as (ListNode<ED, T>
|
node = this.findNode(fullPath) as (ListNode<ED, T>
|
||||||
| SingleNode<ED, T>
|
| SingleNode<ED, T>
|
||||||
| VirtualNode<ED>
|
| VirtualNode<ED>
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue