Notes - jaredgorski.org

  1. Blue Bottle Three Africas + Blue Bottle dripper
  2. Client-side rendering
  3. Incremental static regeneration
  4. Rendering
  5. Server-side rendering
  6. Static generation
  7. 1993 4runner doc
  8. HTTP keep-alive
  9. Backlinks should be context-rich
  10. Notetaking should be low-commitment
  11. Breadth-first search
  12. Dijkstra's algorithm
  13. Graph
  14. Queue
  15. Stack
  16. Weighted graph
  17. Tutorials should be used primarily as analogs
  18. Arrays vs. linked lists
  19. Effective interfaces are low-friction
  20. Hash table
  21. Hashing algorithm
  22. Interface concepts should be atomic
  23. It should be possible to conveniently keep self-data
  24. Keep data about yourself
  25. Progressive testing trees
  26. Quicksort
  27. Big O notation
  28. Binary search
  29. Selection sort
  30. Traveling salesperson problem
  31. Writing atomic notes encourages honest epistemology
  32. Keywords are for convenience, not conceptual linking
  33. Notes should be atomic
  34. Habits that promote linking notes by title
  35. Linking notes by title promotes conceptual cohesion
  36. Note titles should express note content
  37. My brain is for capture and synthesis, not storage
  38. Some notes will be descriptive, others prescriptive
  39. Telling stories boosts output, not creativity
  40. Must-reads for terminal users
  41. Origin of Unix pipes
  42. Unix streams
  43. Unix TTY
  44. Classless inter-domain routing
  45. Writing naturally
  46. iOS development - Creating a view programmatically
  47. iOS development - UIView
  48. iOS development - View animations
  49. iOS development - View drawing cycle
  50. Objective-C basic syntax
  51. iOS development - Windows and Views
  52. SPAC
  53. Game warping in Ethereum
  54. Nash equilibrium
  55. Prisoner's dilemma
  56. Caesar cipher
  57. Computational complexity theory
  58. Cryptographic security
  59. Cryptography
  60. Famous cryptographic ciphers
  61. Solving the Graphql N+1 problem
  62. Avalanche effect
  63. Lambda calculus
  64. Y combinator
  65. Cons
  66. Convolutional neural network
  67. Percolation theory
  68. Steps to developing a usable algorithm
  69. Connected component
  70. Disjoint-set data structure
  71. Dynamic connectivity
  72. Union-find - applications
  73. Union-find algorithm
  74. Union-find approach - quick-find
  75. Union-find approach - quick-union
  76. Union-find approach - weighted quick-union
  77. Graphql N+1 problem
  78. 6 levels of vehicle autonomy
  79. Comma.ai approach to autonomous driving
  80. CSS units - ch
  81. First principles thinking
  82. Graphql resolvers
  83. Graphql
  84. Service workers
  85. Branchless programming
  86. Decentralized web
  87. Clean code - naming
  88. Collatz conjecture
  89. My knowledge management system
  90. What is clean code
  91. Ergonomic emacs
  92. Lisp basics
  93. Rust ownership
  94. Reasons I don't use emacs
  95. Basics of HTML
  96. CSS selectors
  97. HTML elements and structure
  98. HTML tables
  99. The web