Harbor Cart operations needs one current row per order after correction-file replays. The accepted arrival contract allows updates up to two days behind the stored maximum. Build current_orders with deterministic deduplication and incremental merge, test its key, deliver customer-and-currency totals, and retain a replay audit. The warehouse applies a late correction before each stateful step and repeats the learner command. Final success means the corrected source state matches the target, older orders survive, and every key test passes.
Harbor Cart operations receives repeated order correction files. Some corrections arrive behind the largest timestamp already stored, and the source also contains identical copies and conflicting versions. Build a current-order pipeline that can process the same permitted window twice without changing the logical result.
Begin with one deterministic record per order. Then add keyed incremental storage and a two-day overlap before testing the stored key.
The reporting table groups customer amounts by currency, so the handoff doesn't add unlike monetary units. You'll also build a replay audit that counts distinct orders and confirms that historical rows survive a bounded update.
Each step keeps the previous files, and the supplied late correction is replayed during the checks. Finish with an executable singular test alongside the generic key tests, leaving a project that another analyst can run and inspect.