Updated Transacting: upsert resolution algorithm (markdown)
parent
dcdd46c3fc
commit
8ac9f3891b
1 changed files with 1 additions and 1 deletions
|
@ -20,7 +20,7 @@ We partition the set of transaction entities into the following populations.
|
|||
| `upserts-ev` | "Complex upserts" that look like `[:db/add -1 a -2]` where `a` is `:db.unique/identity` |
|
||||
| `allocations-ev` | Entities that look like `[:db/add -1 b -2]`, where `b` is *not* `:db.unique/identity` |
|
||||
| `allocations-e` | Entities that look like `[:db/add -1 b v]`, where `b` is *not* `:db.unique/identity` |
|
||||
| `allocations-v` | Entities that look like `[:db/add e b -2]`, where `b` is *not* `:db.unique/identity` |
|
||||
| `allocations-v` | Entities that look like `[:db/add e b -2]`, with no condition on `b` |
|
||||
| `inert` | Entities that are not `[:db/add ...]`, or that do not contain a temporary ID, like `[:db/add e a v]` |
|
||||
|
||||
## Evolutionary step
|
||||
|
|
Loading…
Reference in a new issue