summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1c3.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/2e1c3.md')
-rw-r--r--content/zettel/2e1c3.md20
1 files changed, 20 insertions, 0 deletions
diff --git a/content/zettel/2e1c3.md b/content/zettel/2e1c3.md
new file mode 100644
index 0000000..1a35438
--- /dev/null
+++ b/content/zettel/2e1c3.md
@@ -0,0 +1,20 @@
++++
+title = "Partial strict order of predicates"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["2e1c2"]
+forwardlinks = ["2e1c4", "2e1c3a"]
+zettelid = "2e1c3"
++++
+
+Therefore, only solution I can think of is to perform strict ordering
+only on conditions that are *unsatisfiable*, but this seems
+computationally expensive.
+
+``` c
+if (Q) { x = 2; }
+else if (R) { x = 3; }
+else if (P) { x = 1; }
+else { x = 4; }
+```