feat: 个人轻量看板工具 MVP
从零实现一个 local-first 的个人任务看板,数据只存在浏览器本地,不依赖后端。 功能 - 固定三列看板(待办 / 进行中 / 已完成),支持拖拽改状态与列内排序 - 快速新增、详情编辑、删除撤销、已完成归档 - 搜索与筛选(关键词 / 优先级 / 标签 / 今日到期 / 逾期) - 今日视图:按紧急度分组(逾期 > 今天到期 > 进行中)+ 统计卡片 - 导出导入 JSON;启动时自动留快照,保留最近 3 份 - 键盘快捷键(N / 「/」/ ? / Esc) - PWA:可安装、离线可用、更新提示 技术要点 - 持久化采用 TaskRepository 端口 + 整份快照读写,schemaVersion 迁移表 显式登记升级规则(当前 v2,v1 -> v2 为归档功能补 archivedAt) - 同列排序用相邻中点插入,间距不足时按列 normalize,避免浮点精度耗尽 - 拖拽只消费 Sortable 的事件,store 保持唯一数据源,不接管数据 - 数据损坏时先备份到 *.corrupt.<时间戳> 再报错,不覆盖用户数据 - 引入 vue-router 拆分看板与今日两个视图(见 docs/adr.md ADR-005) 验证 - 单元测试 437 个(33 个文件),行覆盖率 96.8% - 端到端测试 23 个(Playwright),含真实拖拽与断网离线场景 - npm run build 通过,产物可静态托管 注:部署时需配置 SPA 回落,否则直接访问 /today 会 404(详见 README)。
This commit is contained in:
@@ -0,0 +1,141 @@
|
||||
import { describe, expect, it } from 'vitest'
|
||||
|
||||
import type { Task } from '@/types/task'
|
||||
|
||||
import { buildTodayBuckets, countTodayTasks, sortByUrgency } from './today'
|
||||
|
||||
const TODAY = '2026-10-18'
|
||||
|
||||
function makeTask(overrides: Partial<Task> = {}): Task {
|
||||
return {
|
||||
id: 'task-1',
|
||||
title: '任务',
|
||||
description: '',
|
||||
status: 'todo',
|
||||
priority: 2,
|
||||
tags: [],
|
||||
dueDate: null,
|
||||
sortOrder: 1024,
|
||||
createdAt: '2026-10-01T00:00:00.000Z',
|
||||
updatedAt: '2026-10-01T00:00:00.000Z',
|
||||
completedAt: null,
|
||||
archivedAt: null,
|
||||
...overrides,
|
||||
}
|
||||
}
|
||||
|
||||
function ids(tasks: readonly Task[]): string[] {
|
||||
return tasks.map((task) => task.id)
|
||||
}
|
||||
|
||||
describe('buildTodayBuckets 分组', () => {
|
||||
it('逾期任务进入 overdue', () => {
|
||||
const task = makeTask({ id: 'a', dueDate: '2026-10-17' })
|
||||
expect(ids(buildTodayBuckets([task], TODAY).overdue)).toEqual(['a'])
|
||||
})
|
||||
|
||||
it('今天到期的进入 dueToday', () => {
|
||||
const task = makeTask({ id: 'a', dueDate: TODAY })
|
||||
expect(ids(buildTodayBuckets([task], TODAY).dueToday)).toEqual(['a'])
|
||||
})
|
||||
|
||||
it('进行中且无更紧急截止日期的进入 inProgress', () => {
|
||||
const task = makeTask({ id: 'a', status: 'doing' })
|
||||
expect(ids(buildTodayBuckets([task], TODAY).inProgress)).toEqual(['a'])
|
||||
})
|
||||
|
||||
it('未开始且没有截止日期的任务不出现', () => {
|
||||
const task = makeTask({ id: 'a', status: 'todo', dueDate: null })
|
||||
const buckets = buildTodayBuckets([task], TODAY)
|
||||
expect(countTodayTasks(buckets)).toBe(0)
|
||||
})
|
||||
|
||||
it('未来截止但未开始的任务不出现', () => {
|
||||
const task = makeTask({ id: 'a', status: 'todo', dueDate: '2026-12-01' })
|
||||
expect(countTodayTasks(buildTodayBuckets([task], TODAY))).toBe(0)
|
||||
})
|
||||
|
||||
it('已完成任务不出现', () => {
|
||||
const task = makeTask({ id: 'a', status: 'done', dueDate: '2026-10-01', completedAt: null })
|
||||
expect(countTodayTasks(buildTodayBuckets([task], TODAY))).toBe(0)
|
||||
})
|
||||
|
||||
it('已归档任务不出现', () => {
|
||||
const task = makeTask({ id: 'a', dueDate: '2026-10-01', archivedAt: '2026-10-05T00:00:00.000Z' })
|
||||
expect(countTodayTasks(buildTodayBuckets([task], TODAY))).toBe(0)
|
||||
})
|
||||
|
||||
it('每个任务只归属一组:逾期优先于今天到期,今天到期优先于进行中', () => {
|
||||
const overdue = makeTask({ id: 'overdue', status: 'doing', dueDate: '2026-10-01' })
|
||||
const dueToday = makeTask({ id: 'dueToday', status: 'doing', dueDate: TODAY })
|
||||
const doing = makeTask({ id: 'doing', status: 'doing' })
|
||||
|
||||
const buckets = buildTodayBuckets([overdue, dueToday, doing], TODAY)
|
||||
|
||||
expect(ids(buckets.overdue)).toEqual(['overdue'])
|
||||
expect(ids(buckets.dueToday)).toEqual(['dueToday'])
|
||||
expect(ids(buckets.inProgress)).toEqual(['doing'])
|
||||
expect(countTodayTasks(buckets)).toBe(3)
|
||||
})
|
||||
})
|
||||
|
||||
describe('sortByUrgency', () => {
|
||||
it('优先级高的排前面', () => {
|
||||
const low = makeTask({ id: 'low', priority: 1 })
|
||||
const high = makeTask({ id: 'high', priority: 3 })
|
||||
const medium = makeTask({ id: 'medium', priority: 2 })
|
||||
|
||||
expect(ids(sortByUrgency([low, high, medium]))).toEqual(['high', 'medium', 'low'])
|
||||
})
|
||||
|
||||
it('同优先级下截止日期早的排前面', () => {
|
||||
const later = makeTask({ id: 'later', priority: 2, dueDate: '2026-10-20' })
|
||||
const earlier = makeTask({ id: 'earlier', priority: 2, dueDate: '2026-10-10' })
|
||||
|
||||
expect(ids(sortByUrgency([later, earlier]))).toEqual(['earlier', 'later'])
|
||||
})
|
||||
|
||||
it('没有截止日期的排在有截止日期的后面', () => {
|
||||
const none = makeTask({ id: 'none', priority: 2, dueDate: null })
|
||||
const dated = makeTask({ id: 'dated', priority: 2, dueDate: '2026-12-31' })
|
||||
|
||||
expect(ids(sortByUrgency([none, dated]))).toEqual(['dated', 'none'])
|
||||
})
|
||||
|
||||
it('条件完全相同时按 sortOrder 稳定排序', () => {
|
||||
const second = makeTask({ id: 'second', priority: 2, dueDate: TODAY, sortOrder: 2048 })
|
||||
const first = makeTask({ id: 'first', priority: 2, dueDate: TODAY, sortOrder: 1024 })
|
||||
|
||||
expect(ids(sortByUrgency([second, first]))).toEqual(['first', 'second'])
|
||||
})
|
||||
|
||||
it('不修改入参', () => {
|
||||
const tasks = [makeTask({ id: 'a', priority: 1 }), makeTask({ id: 'b', priority: 3 })]
|
||||
sortByUrgency(tasks)
|
||||
expect(ids(tasks)).toEqual(['a', 'b'])
|
||||
})
|
||||
})
|
||||
|
||||
describe('buildTodayBuckets 排序', () => {
|
||||
it('各组内部按紧急度排序', () => {
|
||||
const low = makeTask({ id: 'low', dueDate: '2026-10-01', priority: 1 })
|
||||
const high = makeTask({ id: 'high', dueDate: '2026-10-02', priority: 3 })
|
||||
|
||||
expect(ids(buildTodayBuckets([low, high], TODAY).overdue)).toEqual(['high', 'low'])
|
||||
})
|
||||
})
|
||||
|
||||
describe('countTodayTasks', () => {
|
||||
it('统计三组之和', () => {
|
||||
const tasks = [
|
||||
makeTask({ id: 'a', dueDate: '2026-10-01' }),
|
||||
makeTask({ id: 'b', dueDate: TODAY }),
|
||||
makeTask({ id: 'c', status: 'doing' }),
|
||||
]
|
||||
expect(countTodayTasks(buildTodayBuckets(tasks, TODAY))).toBe(3)
|
||||
})
|
||||
|
||||
it('空列表为 0', () => {
|
||||
expect(countTodayTasks(buildTodayBuckets([], TODAY))).toBe(0)
|
||||
})
|
||||
})
|
||||
Reference in New Issue
Block a user