notes: add graphviz-based images

mtrsk · Oct 13, 2024 · 692ec68 · 692ec68
1 parent 7d6ec46
commit 692ec68
Show file tree

Hide file tree

Showing 12 changed files with 70 additions and 9 deletions.
diff --git a/generate-graph.py b/generate-graph.py
@@ -11,7 +11,7 @@
 from networkx.drawing.nx_pydot import read_dot
 from networkx.readwrite import json_graph
 
-N_MISSING = 8  # Number of predicted missing links
+N_MISSING = 10  # Number of predicted missing links
 MAX_NODES = 200  # Number of nodes in the final graph 
 
 def to_rellink(inp: str) -> str:

diff --git a/layouts/partials/graph.html b/layouts/partials/graph.html
diff --git a/notes/20240928181517-otp.org b/notes/20240928181517-otp.org
@@ -14,4 +14,12 @@ complexity: things that are difficult because you picked inadequate
 tools. [cite:@cesarini2016designing p.20]
 #+END_QUOTE
 
+* Behaviors
+
++ [[id:1cd8fd81-a7c4-44ea-8b7a-d803e9b491af][gen_server]]
++ [[id:2daf1307-afb4-49e4-98cb-66ac7eb27cf0][supervisor]]
++ ~gen_statem~: State Machines
++ ~gen_fsm~: Finite State Machine
++ ~gen_event~
+
 #+print_bibliography: 
diff --git a/notes/20241001192402-error_handling_in_erlang.org b/notes/20241001192402-error_handling_in_erlang.org
@@ -226,7 +226,7 @@ A process ~Pid1~ can create a monitor for ~Pid2~ by calling the BIF
       sep = 1;
 
       pid1 [label="Pid 1", fontsize="10pt", style=filled, fillcolor=grey];
-      pid2 [label="Pid 2", fontsize="10pt", style=filled, fillcolor=grey, shape=square];
+      pid2 [label="Pid 2", fontsize="10pt", style=filled, fillcolor=green, shape=square];
 
       pid1 -> pid2 [fontsize="10pt", minlen=2, style=dashed];
   }
@@ -246,7 +246,7 @@ A process ~Pid1~ can create a monitor for ~Pid2~ by calling the BIF
       sep = 1;
 
       pid1 [label="💥", fontsize="10pt", style=filled, fillcolor=red];
-      pid2 [label="Pid 2", fontsize="10pt", style=filled, fillcolor=grey, shape=square];
+      pid2 [label="Pid 2", fontsize="10pt", style=filled, fillcolor=green, shape=square];
 
       pid1 -> pid2 [label="{'DOWN', Ref, process, Pid1, Reason}", fontsize="10pt", minlen=1, style=dashed];
   }

diff --git a/notes/20241010094109-gen_server.org b/notes/20241010094109-gen_server.org
@@ -5,6 +5,16 @@
 #+HUGO_CATEGORIES: "Functional Programming"
 #+HUGO_TAGS: "Erlang" "Elixir" "OTP"
 
+#+begin_quote
+Much of the work you think of as the core of a program - calculating results,
+storing information, and preparing replies - will fit neatly into the ~gen_server~
+behavior. It provides a core set of methods that let you set up a process,
+respond to requests, end the process gracefully, and even pass state to a new
+process if this one needs to be upgraded in place. [cite:@laurent2017 p.148]
+#+end_quote
+
 ~gen_server~ is a generic server process that implements a standard set of
 interface functions and functionality for tracing and error reporting, it also
 fits an [[id:6ed3a191-0128-453e-b0b6-37c48593a6f0][OTP]] supervision tree.
+
+#+print_bibliography: 
diff --git a/notes/20241013103835-supervisor.org b/notes/20241013103835-supervisor.org
@@ -0,0 +1,7 @@
+:PROPERTIES:
+:ID:       2daf1307-afb4-49e4-98cb-66ac7eb27cf0
+:END:
+#+title: supervisor
+#+HUGO_CATEGORIES: "Functional Programming"
+#+HUGO_TAGS: "OTP"
+
diff --git a/notes/20241013113437-relation.org b/notes/20241013113437-relation.org
@@ -0,0 +1,18 @@
+:PROPERTIES:
+:ID:       efd79527-1cfb-48da-868e-6286cff21c34
+:END:
+#+title: Relation
+#+HUGO_CATEGORIES: "Math"
+#+HUGO_TAGS: "Set Theory"
+
+A relation is any subset of a Cartesian product. For instance, a relation $R$
+over any subset of $X \times X$ is called a "Relation on $X$".
+
++ A Relation $R$ is said to be *reflexive* if $\forall x \in X: (x,x) \in R$.
++ A Relation $R$ is said to be *symmetric* if $\forall x,y \in X: (x,y) \in R \implies (y,x)
+  \in R$.
++ A Relation $R$ is *antisymmetric* if $\forall x,y \in X: (x,y) \in R \land (y,x) \in R \implies x
+  = y$.
++ A Relation $R$ is *transitive* if $\forall x,y,z \in X: (x,y) \in R \land (y,z) \in R \implies
+  (x,z) \in R$.
++ A Relation $R$ is an *equivalence relation* if it is *reflexive*, *symmetric* and *transitive*.
diff --git a/notes/20241013114603-partial_order.org b/notes/20241013114603-partial_order.org
@@ -0,0 +1,9 @@
+:PROPERTIES:
+:ID:       ce27d04b-aa7b-4fd5-98d3-30aa645f0d46
+:END:
+#+title: Partial Order
+#+HUGO_CATEGORIES: "Math"
+#+HUGO_TAGS: "Set Theory"
+
++ A [[id:efd79527-1cfb-48da-868e-6286cff21c34][Relation]] $R$ is said to be a *reflexive partial order* if its *reflexive*,
+  *antisymmetric*, and *transitive*.
diff --git a/notes/20241013114603-partial_orders.org b/notes/20241013114603-partial_orders.org
@@ -0,0 +1,9 @@
+:PROPERTIES:
+:ID:       ce27d04b-aa7b-4fd5-98d3-30aa645f0d46
+:END:
+#+title: Partial Order
+#+HUGO_CATEGORIES: "Math"
+#+HUGO_TAGS: "Set Theory"
+
++ A [[id:efd79527-1cfb-48da-868e-6286cff21c34][Relation]] $R$ is said to be a *reflexive partial order* if its *reflexive*,
+  *antisymmetric*, and *transitive*.
diff --git a/static/graph.json b/static/graph.json
diff --git a/static/img/notes/erlang_monitor.png b/static/img/notes/erlang_monitor.png
diff --git a/static/img/notes/erlang_monitor_error.png b/static/img/notes/erlang_monitor_error.png