Data Structures: Use fences for code blocks
@@ -120,9 +120,11 @@ every parent key must exist before the user
can append a key to a key set.
For example, the key set with the keys
+```
system
system/elektra
system/elektra/mountpoints
+```
would allow the
key `system/elektra/mountpoints/tcl` to be added,
@@ -154,9 +156,11 @@ The worst-case of the complexity applies when the inserting works
without a parent key.
For example, with the keys
+```
user/sw/apps/abc/current/bindings
user/sw/apps/abc/current/bindings/key1
user/sw/apps/abc/current/bindings/key2
+```
the weak consistency would allow inserting
`user/sw/apps/abc/current/bindings/key3`
@@ -318,6 +322,7 @@ an initial key set is split into many key sets.
These key sets are stored in the `Split` object.
`Split` advanced to the central data structure for the algorithm:
+```c
typedef struct _Split Split;
struct _Split {
@@ -328,6 +333,7 @@ These key sets are stored in the `Split` object.
Key **parents;
int *syncbits;
};
+```
The data structure `Split` contains the following fields:
