TypeScript undoHistory.computeUndoStacks函数代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› TypeScript›TypeScript教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了TypeScript中reducers/undoHistory.computeUndoStacks函数的典型用法代码示例。如果您正苦于以下问题：TypeScript computeUndoStacks函数的具体用法？TypeScript computeUndoStacks怎么用？TypeScript computeUndoStacks使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。

在下文中一共展示了computeUndoStacks函数的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。

示例1: test

  test('should store data when relevant actions dispatched', () => {
    const hist0 = produce(state.undoHistoryState, (draft) => {
      draft.future.push(draft);
    });
    const hist1 = computeUndoStacks(hist0, newFSA(WATCHED_ACTION), state, mutatedState, config);
    const hist2 = computeUndoStacks(hist1, newFSA(WATCHED_ACTION), mutatedState, state, config);

    // Expect history to change
    expect(hist1).not.toEqual(hist0);

    // Erases future
    expect(hist0.future).toHaveLength(1);
    expect(hist1.future).toHaveLength(0);

    // Add present to past if present did not exist
    expect(hist0.past).toHaveLength(0);
    expect(hist0.present).toBeUndefined(); // Present did not exist
    expect(hist1.past).toHaveLength(1);
    expect(hist1.past[0]).toEqual(pick(state, config.whitelist));

    // Set new present
    const present1 = pick(mutatedState, config.whitelist);
    expect(hist1.present).toEqual(present1);
    expect(hist1.present).not.toEqual(pick(state, config.whitelist)); // Just make sure both states are different

    // Add present to past if present exists
    expect(hist2.past).toHaveLength(2);
    expect(hist2.past[1]).toEqual(present1);
    expect(hist2.present).toEqual(pick(state, config.whitelist));
  });

开发者ID:nusmodifications，项目名称:nusmods，代码行数:30，代码来源:undoHistory.test.ts

注：本文中的reducers/undoHistory.computeUndoStacks函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。