Add food-delivery module: order state table, FIFO dispatcher, nearest / rated / longest-idle rider strategies, atomic stock and kitchen capacity, idempotent placing, seeded simulation (13 test classes, 19 transcripts)
Co-Authored-By: Claude Sonnet 5.5 <[email protected]> Claude-Session: https://claude.ai/code/session_017ic4b5BMpRV6przXHwuKTz
This commit is contained in:
co-authored by
Claude Sonnet 5.5
parent
76012dd8c3
commit
3336e2ba15
@@ -0,0 +1,8 @@
|
||||
16 orders reach for one free rider, 5000 rounds
|
||||
===============================================
|
||||
|
||||
Timing dependent: the naive count differs from run to run; the compare-and-set count never does.
|
||||
|
||||
naive, check then write, nothing in between: rounds where more than one order got the rider: 0 of 5000, most winners in one round 1
|
||||
naive, with a yield between the check and the write: rounds where more than one order got the rider: 389 of 5000, most winners in one round 7
|
||||
atomic (compare-and-set), no gap needed: rounds with anything other than one winner: 0 of 5000
|
||||
Reference in New Issue
Block a user