Safe Sorting & Stable Order Allow-list sort fields and add deterministic tie-breaking for pagination
Phase 15 - Filtering, Search, Sorting & Pagination Volume 04 - Professional Backend
sort + order
v
v
v
Phase 15 turns an unbounded collection endpoint into a validated, queryable, stable, paginated API contract.
Sorting must be allow-listed Never accept an arbitrary field name and inject it into dynamic ordering. Phase 15 validates sort against a small public set and maps each option to a known Prisma orderBy shape.
private buildOrderBy(sort: TaskSortField, order: SortOrder) { switch (sort) { case "updatedAt": return [{ updatedAt: order }, { id: "asc" }]; case "dueAt": return [{ dueAt: order }, { id: "asc" }]; case "title": return [{ title: order }, { id: "asc" }]; case "createdAt": default: return [{ createdAt: order }, { id: "asc" }]; } }
Why add id as a tiebreaker? createdAt, dueAt, updatedAt, and title are not guaranteed unique. Without a deterministic secondary key, rows tied on the primary sort can move between requests, making paginated results appear unstable.
v
v
v
v
Stable pagination starts with stable ordering.
Null sorting deserves a product decision dueAt is optional. Decide whether tasks without due dates should appear first or last when sorting by dueAt. Prisma/PostgreSQL support explicit null ordering in appropriate query shapes, but the course keeps the initial mapping simple and asks you to make the product decision before optimizing the query.
Changing default sort later can visibly reorder every page. Treat it like behavior, not an implementation detail.
Safe Sorting and Stable Order matters because it changes a real boundary in TaskFlow. The goal is to understand the inputs, owner, observable output, and failure modes before adding more abstraction.
Restate the goal of “Safe Sorting and Stable Order” as one observable behavior. Write the success signal before touching code.
Trace the boundary map: query parameters → validated filter/sort → stable query → page/cursor → response metadata. Mark the one boundary this lesson changes.
Inspect the current repository state and record the exact files, route, table, or runtime involved. Avoid creating an abstraction before you can name the existing owner.
Implement the smallest vertical slice. Add one coherent change, run the narrowest verification command, and read the output before continuing.
Connect the slice to TaskFlow’s phase artifact: Task list API with filter/search/sort/page contract plus metadata and indexes justified by measured query patterns.. Verify behavior from the outside as a user or API client would.
Create one controlled failure that is safe to reproduce. Predict the symptom first, capture evidence, locate the earliest broken boundary, then fix only that cause.
Close the reference and rebuild or explain the core change from memory. Record what you would monitor or test before trusting the same change in production.
orderBy: [{ createdAt: "desc" }, { id: "desc" }],
take: limit + 1,
where: cursor ? {
OR: [
{ createdAt: { lt: cursor.createdAt } },
{ createdAt: cursor.createdAt, id: { lt: cursor.id } },
],
} : undefinedDo not copy this as a finished answer. Predict what each boundary does, type the smallest useful slice, run it, then compare the result with your prediction.
Return to the nearest observable boundary: input, network, process log, database, or rendered UI. Compare actual evidence with the predicted path.
Change one variable at a time and reproduce the original failure after the fix; otherwise you have correlation, not diagnosis.
Without copying the final source, create a second small scenario that applies “Safe Sorting and Stable Order” to a different TaskFlow resource or input. Write the acceptance criteria first, implement it, and provide the evidence that each criterion is satisfied.
Guarantee deterministic ordering with a unique tie-breaker.
Use the smallest change that demonstrates this lesson. Stop after it works and capture evidence.Unbounded page size
Predict the symptom before causing the failure. Then locate the earliest boundary where reality diverges from expectation.Why does this responsibility live here, what input does it trust, what output proves success, and what would go wrong if another layer owned it?
If your explanation is vague, repeat the boundary trace before moving on.Close the reference. Reproduce the core idea from memory or explain the exact request/data flow aloud. Then check your diff or notes for accidental shortcuts that bypass validation, authorization, error handling, or verification earned in earlier phases.