Robert

2%
Flag icon
Given enough time and enough users, even the most innocuous change will break something;9 your analysis of the value of that change must incorporate the difficulty in investigating, identifying, and resolving those breakages. Example: Hash Ordering
Robert
A real world example that I've encountered: database/object IDs; assumed monotonically increasing and used for time-based sorting 😔.
Software Engineering at Google: Lessons Learned from Programming Over Time
Rate this book
Clear rating
Open Preview