排序算法
原理:#
1 4 = 1 2 1 +1 = 2 3 2 +1 = 3 4 3 +1 = 4 5 5 = 5 prev: null next: 1 newOrder 1 < originOrder 4 >0 && < 4 1 2 -1 = 1 2 3 -1 = 2 3 1 = 3 4 4 = 4 5 5 = 5 prev: 3 next: 4 newOrder 3 > originOrder 1 >1 && <4 1 1 = 1 2 3 -1 = 2 3 4 -1 = 3 4 5 -1 = 4 5 2 = 5 prev: 5 next: null newOrder 5 > originOrder 2 >2 && <6 newOrder > originOrder,中间部分序号-1 newOrder < originOrder,中间部分序号+1
伪代码:#
private async Task SortAsync(Guid id, int? toPreviousOrder, int? toNextOrder) { var newOrder = GetNewOrder(toPreviousOrder, toNextOrder); var entity = await _store.FindAsync(id, required: true); if (entity.Order == newOrder) return; IEnumerable<Entity> entitiesBetween; if (newOrder > entity.Order) { entitiesBetween = await GetEntitiesAsync(x => x.Order > entity.Order && x.Order < newOrder + 1); } else { entitiesBetween = await GetEntitiesAsync(x => x.Order > newOrder - 1 && x.Order < entity.Order); } if (entitiesBetween.Any()) { foreach (var entityBetween in entitiesBetween) { if (newOrder > entity.Order) { entityBetween.Order -= 1; } else { entityBetween.Order += 1; } entityBetween.WhenUpdated = DateTime.Now; } _store.UpdateRange(entitiesBetween); } entity.Order = newOrder; entity.WhenUpdated = DateTime.Now; _store.Update(entity); await _store.SaveChangesAsync(); } private int GetNewOrder(int? toPreviousOrder, int? toNextOrder) { if (toPreviousOrder.HasValue && toNextOrder.HasValue) { return toPreviousId.Value; } else if (toPreviousOrder.HasValue && !toNextOrder.HasValue) { return toPreviousOrder.Value; } else if (!toPreviousOrder.HasValue && toNextOrder.HasValue) { return toNextOrder.Value; } else throw new InvalidOperationException(); }
纠正代码(调用 GetNewOrderId 的地方需要改成调用这个):
public static Guid GetNewOrderId(Guid? toPreviousId, Guid? toNextId, int? toPreviousOrder, int currentOrder) { if (toPreviousId.HasValue && toNextId.HasValue) { if (toPreviousOrder < currentOrder) { return toNextId.Value; } else { return toPreviousId.Value; } } else if (toPreviousId.HasValue && !toNextId.HasValue) { return toPreviousId.Value; } else if (!toPreviousId.HasValue && toNextId.HasValue) { return toNextId.Value; } else throw new InvalidOperationException(); }
分类:
c sharp
【推荐】FlashTable:表单开发界的极速跑车,让你的开发效率一路狂飙
【推荐】Flutter适配HarmonyOS 5知识地图,实战解析+高频避坑指南
【推荐】博客园的心动:当一群程序员决定开源共建一个真诚相亲平台
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· JavaScript中如何遍历对象?
· 领域模型应用
· 记一次 ADL 导致的 C++ 代码编译错误
· MySQL查询执行顺序:一张图看懂SQL是如何工作的
· 为什么PostgreSQL不自动缓存执行计划?
· 从被喷“假开源”到登顶 GitHub 热榜,这个开源项目上演王者归来!
· Stack Overflow,轰然倒下!
· Cursor 1.2重磅更新,这个痛点终于被解决了!
· 上周热点回顾(6.30-7.6)
· .NET AI 模板