mirror of
https://github.com/reduxjs/redux-devtools.git
synced 2025-01-31 11:51:41 +03:00
Don't recompute old states when toggling actions
This commit is contained in:
parent
f757de442f
commit
43bf473b12
|
@ -77,15 +77,32 @@ function computeNextEntry(reducer, action, state, error) {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Runs the reducer on all actions to get a fresh computation log.
|
* Runs the reducer on invalidated actions to get a fresh computation log.
|
||||||
*/
|
*/
|
||||||
function recomputeStates(reducer, committedState, actionsById, stagedActionIds, skippedActionIds) {
|
function recomputeStates(
|
||||||
const computedStates = [];
|
computedStates,
|
||||||
for (let i = 0; i < stagedActionIds.length; i++) {
|
minInvalidatedStateIndex,
|
||||||
|
reducer,
|
||||||
|
committedState,
|
||||||
|
actionsById,
|
||||||
|
stagedActionIds,
|
||||||
|
skippedActionIds
|
||||||
|
) {
|
||||||
|
// Optimization: exit early and return the same reference
|
||||||
|
// if we know nothing could have changed.
|
||||||
|
if (
|
||||||
|
minInvalidatedStateIndex >= computedStates.length &&
|
||||||
|
computedStates.length === stagedActionIds.length
|
||||||
|
) {
|
||||||
|
return computedStates;
|
||||||
|
}
|
||||||
|
|
||||||
|
const nextComputedStates = computedStates.slice(0, minInvalidatedStateIndex);
|
||||||
|
for (let i = minInvalidatedStateIndex; i < stagedActionIds.length; i++) {
|
||||||
const actionId = stagedActionIds[i];
|
const actionId = stagedActionIds[i];
|
||||||
const action = actionsById[actionId].action;
|
const action = actionsById[actionId].action;
|
||||||
|
|
||||||
const previousEntry = computedStates[i - 1];
|
const previousEntry = nextComputedStates[i - 1];
|
||||||
const previousState = previousEntry ? previousEntry.state : committedState;
|
const previousState = previousEntry ? previousEntry.state : committedState;
|
||||||
const previousError = previousEntry ? previousEntry.error : undefined;
|
const previousError = previousEntry ? previousEntry.error : undefined;
|
||||||
|
|
||||||
|
@ -94,10 +111,10 @@ function recomputeStates(reducer, committedState, actionsById, stagedActionIds,
|
||||||
previousEntry :
|
previousEntry :
|
||||||
computeNextEntry(reducer, action, previousState, previousError);
|
computeNextEntry(reducer, action, previousState, previousError);
|
||||||
|
|
||||||
computedStates.push(entry);
|
nextComputedStates.push(entry);
|
||||||
}
|
}
|
||||||
|
|
||||||
return computedStates;
|
return nextComputedStates;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -121,14 +138,13 @@ function liftReducerWith(reducer, initialCommittedState, monitorReducer) {
|
||||||
skippedActionIds: [],
|
skippedActionIds: [],
|
||||||
committedState: initialCommittedState,
|
committedState: initialCommittedState,
|
||||||
currentStateIndex: 0,
|
currentStateIndex: 0,
|
||||||
computedStates: undefined
|
computedStates: []
|
||||||
};
|
};
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Manages how the history actions modify the history state.
|
* Manages how the history actions modify the history state.
|
||||||
*/
|
*/
|
||||||
return (liftedState = initialLiftedState, liftedAction) => {
|
return (liftedState = initialLiftedState, liftedAction) => {
|
||||||
let shouldRecomputeStates = true;
|
|
||||||
let {
|
let {
|
||||||
monitorState,
|
monitorState,
|
||||||
actionsById,
|
actionsById,
|
||||||
|
@ -140,116 +156,125 @@ function liftReducerWith(reducer, initialCommittedState, monitorReducer) {
|
||||||
computedStates
|
computedStates
|
||||||
} = liftedState;
|
} = liftedState;
|
||||||
|
|
||||||
|
// By default, agressively recompute every state whatever happens.
|
||||||
|
// This has O(n) performance, so we'll override this to a sensible
|
||||||
|
// value whenever we feel like we don't have to recompute the states.
|
||||||
|
let minInvalidatedStateIndex = 0;
|
||||||
|
|
||||||
switch (liftedAction.type) {
|
switch (liftedAction.type) {
|
||||||
case ActionTypes.RESET:
|
case ActionTypes.RESET: {
|
||||||
actionsById = {
|
// Get back to the state the store was created with.
|
||||||
0: liftAction(INIT_ACTION)
|
actionsById = { 0: liftAction(INIT_ACTION) };
|
||||||
};
|
nextActionId = 1;
|
||||||
nextActionId = 1;
|
stagedActionIds = [0];
|
||||||
stagedActionIds = [0];
|
skippedActionIds = [];
|
||||||
skippedActionIds = [];
|
committedState = initialCommittedState;
|
||||||
committedState = initialCommittedState;
|
currentStateIndex = 0;
|
||||||
currentStateIndex = 0;
|
computedStates = [];
|
||||||
break;
|
break;
|
||||||
case ActionTypes.COMMIT:
|
|
||||||
actionsById = {
|
|
||||||
0: liftAction(INIT_ACTION)
|
|
||||||
};
|
|
||||||
nextActionId = 1;
|
|
||||||
stagedActionIds = [0];
|
|
||||||
skippedActionIds = [];
|
|
||||||
committedState = computedStates[currentStateIndex].state;
|
|
||||||
currentStateIndex = 0;
|
|
||||||
break;
|
|
||||||
case ActionTypes.ROLLBACK:
|
|
||||||
actionsById = {
|
|
||||||
0: liftAction(INIT_ACTION)
|
|
||||||
};
|
|
||||||
nextActionId = 1;
|
|
||||||
stagedActionIds = [0];
|
|
||||||
skippedActionIds = [];
|
|
||||||
currentStateIndex = 0;
|
|
||||||
break;
|
|
||||||
case ActionTypes.TOGGLE_ACTION:
|
|
||||||
const index = skippedActionIds.indexOf(liftedAction.id);
|
|
||||||
if (index === -1) {
|
|
||||||
skippedActionIds = [
|
|
||||||
liftedAction.id,
|
|
||||||
...skippedActionIds
|
|
||||||
];
|
|
||||||
} else {
|
|
||||||
skippedActionIds = [
|
|
||||||
...skippedActionIds.slice(0, index),
|
|
||||||
...skippedActionIds.slice(index + 1)
|
|
||||||
];
|
|
||||||
}
|
}
|
||||||
break;
|
case ActionTypes.COMMIT: {
|
||||||
case ActionTypes.JUMP_TO_STATE:
|
// Consider the last committed state the new starting point.
|
||||||
currentStateIndex = liftedAction.index;
|
// Squash any staged actions into a single committed state.
|
||||||
// Optimization: we know the history has not changed.
|
actionsById = { 0: liftAction(INIT_ACTION) };
|
||||||
shouldRecomputeStates = false;
|
nextActionId = 1;
|
||||||
break;
|
stagedActionIds = [0];
|
||||||
case ActionTypes.SWEEP:
|
skippedActionIds = [];
|
||||||
stagedActionIds = difference(stagedActionIds, skippedActionIds);
|
committedState = computedStates[currentStateIndex].state;
|
||||||
skippedActionIds = [];
|
currentStateIndex = 0;
|
||||||
currentStateIndex = Math.min(currentStateIndex, stagedActionIds.length - 1);
|
computedStates = [];
|
||||||
break;
|
break;
|
||||||
case ActionTypes.PERFORM_ACTION:
|
}
|
||||||
if (currentStateIndex === stagedActionIds.length - 1) {
|
case ActionTypes.ROLLBACK: {
|
||||||
currentStateIndex++;
|
// Forget about any staged actions.
|
||||||
|
// Start again from the last committed state.
|
||||||
|
actionsById = { 0: liftAction(INIT_ACTION) };
|
||||||
|
nextActionId = 1;
|
||||||
|
stagedActionIds = [0];
|
||||||
|
skippedActionIds = [];
|
||||||
|
currentStateIndex = 0;
|
||||||
|
computedStates = [];
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case ActionTypes.TOGGLE_ACTION: {
|
||||||
|
// Toggle whether an action with given ID is skipped.
|
||||||
|
// Being skipped means it is a no-op during the computation.
|
||||||
|
const { id: actionId } = liftedAction;
|
||||||
|
const index = skippedActionIds.indexOf(actionId);
|
||||||
|
if (index === -1) {
|
||||||
|
skippedActionIds = [actionId, ...skippedActionIds];
|
||||||
|
} else {
|
||||||
|
skippedActionIds = skippedActionIds.filter(id => id !== actionId);
|
||||||
|
}
|
||||||
|
// Optimization: we know history before this action hasn't changed
|
||||||
|
minInvalidatedStateIndex = stagedActionIds.indexOf(actionId);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case ActionTypes.JUMP_TO_STATE: {
|
||||||
|
// Without recomputing anything, move the pointer that tell us
|
||||||
|
// which state is considered the current one. Useful for sliders.
|
||||||
|
currentStateIndex = liftedAction.index;
|
||||||
|
// Optimization: we know the history has not changed.
|
||||||
|
minInvalidatedStateIndex = Infinity;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case ActionTypes.SWEEP: {
|
||||||
|
// Forget any actions that are currently being skipped.
|
||||||
|
stagedActionIds = difference(stagedActionIds, skippedActionIds);
|
||||||
|
skippedActionIds = [];
|
||||||
|
currentStateIndex = Math.min(currentStateIndex, stagedActionIds.length - 1);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case ActionTypes.PERFORM_ACTION: {
|
||||||
|
if (currentStateIndex === stagedActionIds.length - 1) {
|
||||||
|
currentStateIndex++;
|
||||||
|
}
|
||||||
|
const actionId = nextActionId++;
|
||||||
|
// Mutation! This is the hottest path, and we optimize on purpose.
|
||||||
|
// It is safe because we set a new key in a cache dictionary.
|
||||||
|
actionsById[actionId] = liftedAction;
|
||||||
|
stagedActionIds = [...stagedActionIds, actionId];
|
||||||
|
// Optimization: we know that only the new action needs computing.
|
||||||
|
minInvalidatedStateIndex = stagedActionIds.length - 1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case ActionTypes.IMPORT_STATE: {
|
||||||
|
// Completely replace everything.
|
||||||
|
({
|
||||||
|
monitorState,
|
||||||
|
actionsById,
|
||||||
|
nextActionId,
|
||||||
|
stagedActionIds,
|
||||||
|
skippedActionIds,
|
||||||
|
committedState,
|
||||||
|
currentStateIndex,
|
||||||
|
computedStates
|
||||||
|
} = liftedAction.nextLiftedState);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case '@@redux/INIT': {
|
||||||
|
// Always recompute states on hot reload and init.
|
||||||
|
minInvalidatedStateIndex = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
default: {
|
||||||
|
// If the action is not recognized, it's a monitor action.
|
||||||
|
// Optimization: a monitor action can't change history.
|
||||||
|
minInvalidatedStateIndex = Infinity;
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
const actionId = nextActionId++;
|
|
||||||
// Mutation! This is the hottest path, and we optimize on purpose.
|
|
||||||
// It is safe because we set a new key in a cache dictionary.
|
|
||||||
actionsById[actionId] = liftedAction;
|
|
||||||
stagedActionIds = [...stagedActionIds, actionId];
|
|
||||||
// Optimization: we know that the past has not changed.
|
|
||||||
shouldRecomputeStates = false;
|
|
||||||
// Instead of recomputing the states, append the next one.
|
|
||||||
const previousEntry = computedStates[computedStates.length - 1];
|
|
||||||
const nextEntry = computeNextEntry(
|
|
||||||
reducer,
|
|
||||||
liftedAction.action,
|
|
||||||
previousEntry.state,
|
|
||||||
previousEntry.error
|
|
||||||
);
|
|
||||||
computedStates = [...computedStates, nextEntry];
|
|
||||||
break;
|
|
||||||
case ActionTypes.IMPORT_STATE:
|
|
||||||
({
|
|
||||||
monitorState,
|
|
||||||
actionsById,
|
|
||||||
nextActionId,
|
|
||||||
stagedActionIds,
|
|
||||||
skippedActionIds,
|
|
||||||
committedState,
|
|
||||||
currentStateIndex,
|
|
||||||
computedStates
|
|
||||||
} = liftedAction.nextLiftedState);
|
|
||||||
break;
|
|
||||||
case '@@redux/INIT':
|
|
||||||
// Always recompute states on hot reload and init.
|
|
||||||
shouldRecomputeStates = true;
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
// Optimization: a monitor action can't change history.
|
|
||||||
shouldRecomputeStates = false;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (shouldRecomputeStates) {
|
|
||||||
computedStates = recomputeStates(
|
|
||||||
reducer,
|
|
||||||
committedState,
|
|
||||||
actionsById,
|
|
||||||
stagedActionIds,
|
|
||||||
skippedActionIds
|
|
||||||
);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
computedStates = recomputeStates(
|
||||||
|
computedStates,
|
||||||
|
minInvalidatedStateIndex,
|
||||||
|
reducer,
|
||||||
|
committedState,
|
||||||
|
actionsById,
|
||||||
|
stagedActionIds,
|
||||||
|
skippedActionIds
|
||||||
|
);
|
||||||
monitorState = monitorReducer(monitorState, liftedAction);
|
monitorState = monitorReducer(monitorState, liftedAction);
|
||||||
|
|
||||||
return {
|
return {
|
||||||
monitorState,
|
monitorState,
|
||||||
actionsById,
|
actionsById,
|
||||||
|
|
|
@ -106,17 +106,20 @@ describe('instrument', () => {
|
||||||
store.dispatch({ type: 'DECREMENT' });
|
store.dispatch({ type: 'DECREMENT' });
|
||||||
store.dispatch({ type: 'INCREMENT' });
|
store.dispatch({ type: 'INCREMENT' });
|
||||||
store.dispatch({ type: 'INCREMENT' });
|
store.dispatch({ type: 'INCREMENT' });
|
||||||
|
|
||||||
expect(store.getState()).toBe(2);
|
expect(store.getState()).toBe(2);
|
||||||
|
expect(liftedStore.getState().stagedActionIds).toEqual([0, 1, 2, 3, 4]);
|
||||||
|
expect(liftedStore.getState().skippedActionIds).toEqual([]);
|
||||||
|
|
||||||
liftedStore.dispatch(ActionCreators.toggleAction(2));
|
liftedStore.dispatch(ActionCreators.toggleAction(2));
|
||||||
expect(store.getState()).toBe(3);
|
expect(store.getState()).toBe(3);
|
||||||
|
expect(liftedStore.getState().stagedActionIds).toEqual([0, 1, 2, 3, 4]);
|
||||||
|
expect(liftedStore.getState().skippedActionIds).toEqual([2]);
|
||||||
|
|
||||||
liftedStore.dispatch(ActionCreators.sweep());
|
liftedStore.dispatch(ActionCreators.sweep());
|
||||||
expect(store.getState()).toBe(3);
|
expect(store.getState()).toBe(3);
|
||||||
|
expect(liftedStore.getState().stagedActionIds).toEqual([0, 1, 3, 4]);
|
||||||
liftedStore.dispatch(ActionCreators.toggleAction(2));
|
expect(liftedStore.getState().skippedActionIds).toEqual([]);
|
||||||
// Now it has no effect because it's not staged
|
|
||||||
expect(store.getState()).toBe(3);
|
|
||||||
});
|
});
|
||||||
|
|
||||||
it('should jump to state', () => {
|
it('should jump to state', () => {
|
||||||
|
@ -193,10 +196,53 @@ describe('instrument', () => {
|
||||||
expect(reducerCalls).toBe(4);
|
expect(reducerCalls).toBe(4);
|
||||||
});
|
});
|
||||||
|
|
||||||
|
it('should not recompute old states when toggling an action', () => {
|
||||||
|
let reducerCalls = 0;
|
||||||
|
let monitoredStore = instrument()(createStore)(() => reducerCalls++);
|
||||||
|
let monitoredLiftedStore = monitoredStore.liftedStore;
|
||||||
|
|
||||||
|
expect(reducerCalls).toBe(1);
|
||||||
|
// actionId 0 = @@INIT
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(3));
|
||||||
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(3));
|
||||||
|
expect(reducerCalls).toBe(5);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(2));
|
||||||
|
expect(reducerCalls).toBe(6);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(2));
|
||||||
|
expect(reducerCalls).toBe(8);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(1));
|
||||||
|
expect(reducerCalls).toBe(10);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(2));
|
||||||
|
expect(reducerCalls).toBe(11);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(3));
|
||||||
|
expect(reducerCalls).toBe(11);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(1));
|
||||||
|
expect(reducerCalls).toBe(12);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(3));
|
||||||
|
expect(reducerCalls).toBe(13);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch(ActionCreators.toggleAction(2));
|
||||||
|
expect(reducerCalls).toBe(15);
|
||||||
|
});
|
||||||
|
|
||||||
it('should not recompute states when jumping to state', () => {
|
it('should not recompute states when jumping to state', () => {
|
||||||
let reducerCalls = 0;
|
let reducerCalls = 0;
|
||||||
let monitoredStore = instrument()(createStore)(() => reducerCalls++);
|
let monitoredStore = instrument()(createStore)(() => reducerCalls++);
|
||||||
let monitoredInstrumentedStore = monitoredStore.liftedStore;
|
let monitoredLiftedStore = monitoredStore.liftedStore;
|
||||||
|
|
||||||
expect(reducerCalls).toBe(1);
|
expect(reducerCalls).toBe(1);
|
||||||
monitoredStore.dispatch({ type: 'INCREMENT' });
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
@ -204,13 +250,32 @@ describe('instrument', () => {
|
||||||
monitoredStore.dispatch({ type: 'INCREMENT' });
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
expect(reducerCalls).toBe(4);
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
monitoredInstrumentedStore.dispatch(ActionCreators.jumpToState(0));
|
monitoredLiftedStore.dispatch(ActionCreators.jumpToState(0));
|
||||||
expect(reducerCalls).toBe(4);
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
monitoredInstrumentedStore.dispatch(ActionCreators.jumpToState(1));
|
monitoredLiftedStore.dispatch(ActionCreators.jumpToState(1));
|
||||||
expect(reducerCalls).toBe(4);
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
monitoredInstrumentedStore.dispatch(ActionCreators.jumpToState(3));
|
monitoredLiftedStore.dispatch(ActionCreators.jumpToState(3));
|
||||||
|
expect(reducerCalls).toBe(4);
|
||||||
|
});
|
||||||
|
|
||||||
|
|
||||||
|
it('should not recompute states on monitor actions', () => {
|
||||||
|
let reducerCalls = 0;
|
||||||
|
let monitoredStore = instrument()(createStore)(() => reducerCalls++);
|
||||||
|
let monitoredLiftedStore = monitoredStore.liftedStore;
|
||||||
|
|
||||||
|
expect(reducerCalls).toBe(1);
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
monitoredStore.dispatch({ type: 'INCREMENT' });
|
||||||
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch({ type: 'lol' });
|
||||||
|
expect(reducerCalls).toBe(4);
|
||||||
|
|
||||||
|
monitoredLiftedStore.dispatch({ type: 'wat' });
|
||||||
expect(reducerCalls).toBe(4);
|
expect(reducerCalls).toBe(4);
|
||||||
});
|
});
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user