grokking_simplicity/ch17

ch17

dz / grokking_simplicity / ch17

Summary

Grokking Simplicity Chapter 17: Coordinating Timelines

Node Tree

Nodes

formula_possible_orderings
content Formula for possible orderings: o = (ta)! / (a!)^t, where t is number of timelines, and a is number of actions per timeline
remarks would be nice to get a TeX metadata entry for this

possible_orderings_analysis
content Possible Orderings Analysis
remarks I liked this term. It's when you look at a timeline and examing all the possible orderings that can happen in each part of the timeline

cut_primitive
content Cut Primitive

race_condition
content Race Condition

race_condition_definition
content Occurs when the behavior depends on which timeline finishes first.
remarks Really like the brevity of this definition. Often definitions of race conditions involve hard to follow examples, followed by a "and that's a race condition".

idempotent
content Idempotent
children idempotent_def (definition), just_once

just_once
content Just Once (function primitive)
parents idempotent

idempotent_def
content Action that only has an effect the first time you call it
parents idempotent

models_of_time
content Models of Time
children implicit, explicit

implicit
content Implicit
children all_pl_implicit
parents models_of_time

explicit
content Explicit
children explicit_ordering_repitition, solves_problem_better, queue (example of explicit model of time (forces order))
parents models_of_time

all_pl_implicit
content All programming languages have some implicit model of time
parents implicit

explicit_ordering_repitition
content Builing explicit model of ordering and repetition
parents explicit

queue
content queue
parents explicit

solves_problem_better
content Explicit time models are used by functional programmers to solve problems better
parents explicit