LEVERAGING SPIRE FOR COMPLEX TIME ALLOCATION LOGIC

on YouTube ↗25m

" summary

Uses Spire’s interval and interval set primitives to build practical schedulers: merges calendars to compute free one‑hour meeting slots for three people, intersects per-person work sequences to find co-working periods, and measures covered vs uncovered vs unused time for resource allocation. Shows two lawful time orders (strict zone-aware vs instance-based), warns about boundaries, precision and negative infinity, and recommends wrapping Spire in domain types (e.g. interval sets, left-closed right-open) to avoid invalid values and leaking abstractions.

AI-written summary · about

" chapters (11)

1. 0:00Spire and time allocation
2. 1:30Theoretical foundations
3. 5:53Intervals and ordering
4. 7:17Spire API for intervals
5. 10:10Calendar scheduling with intervals
6. 14:22Overlapping work periods
7. 15:52Set operations and monoids
8. 17:37Resource allocation with intervals
9. 20:02Domain integration and DDD
10. 22:30Constraints and best practices
11. 24:16Q&A

" related talks

• 41mLeveraging Spire for complex time allocation logicVladimir Pavkin · Scala Days Berlin 2018
• 49mNumeric Programming With SpireLars Hupel · Scala Italy 2018
• 50mPick your number type with SpireDenis Rosset · Scala Days Lausanne 2019
• 51mFast Immutable Interval SetsRudiger Klaehn · Scala World 2017
• 21mLawful AIAdam Pingel · Scale By the Bay 2017
• 03mDavid Cleaver InterviewAlexy Khrabrov, David Cleaver · Scale By the Bay 2017
• 24mScio data processing nirvana at SpotifyJulien Tournay, Bram Leenders · Scale By The Bay 2018
• 29mEnhancing Spark's Power with ZIOLeo Benkel · Scale By the Bay 2020