summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1c3.md
blob: 1a35438ec516fad61c40312ac96ebf5720a10708 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
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; }
```