developer guide: fix italics

Author: Johan Tibell

docs/developer-guide.md

@@ -93,17 +93,17 @@ Here's a quick overview in order of simplicty:
  * `Leaf` -- A key-value pair.
  * `Collision` -- An array of key-value pairs where the keys have identical hash
    values. Element order doesn't matter.
- * `Full` -- An array of /2^B/ children. Given a key you can find the child it
-   is part of by taking /B/ bits of the hash value for the key and indexing into
+ * `Full` -- An array of *2^B* children. Given a key you can find the child it
+   is part of by taking *B* bits of the hash value for the key and indexing into
    the key. Which bits to use depends on the tree level.
  * `BitmapIndexed` -- Similar to above except that the array is implemented as a
    sparse array (to avoid storing `Empty` values). A bitmask and popcount is
    used to convert from the index taken from the hash value, just like above, to
    the actual index in the array. This node gets upgraded to a `Full` node when
-   it contains /2^B/ elements.
+   it contains *2^B* elements.
 
-The number of bits of the hash value to use at each level of the tree, /B/, is a
-compiled time constant (i.e. 4). In general a larger /B/ improves lookup
+The number of bits of the hash value to use at each level of the tree, *B*, is a
+compiled time constant (i.e. 4). In general a larger *B* improves lookup
 performance (shallower tree) but hurts modification (large nodes to copy when
 updating the spine of the tree).