|
|
@@ -34,4 +34,8 @@ Todo, when I find the time:
|
|
|
|
|
|
|
|
|
- Think: Introduce read-dependencies
|
|
|
-
|
|
|
+
|
|
|
+- A NodeDeletion also unsets all outgoing edges of a node. Incoming edges must be unset by EdgeUpdates, and the NodeDeletion must depend on these EdgeUpdates. Maybe it will make the implementation (of conflict checking) simpler if a NodeDeletion would *not* automatically unset outgoing edges, and instead also would have to depend on EdgeUpdates that un-set the nodes?
|
|
|
+ Pro: Simpler conflict-checking code
|
|
|
+ Pro: Related to the previous, will also make the addition of read-dependencies easier to implement.
|
|
|
+ Pro: Easier to explain to people
|
