🖍️ fixed additional typos

Author: AshleyRoll

docs/implementation_details.adoc

@@ -15,7 +15,7 @@ and the callback that match are encoded into a `stdx::bitset`.
 
 However, once this initial representation is built, we then take this and
 perform additional work (at compile time) to encode the bitsets as RLE
-data, and store in the index just an offset into the blog of RLE data
+data, and store in the index just an offset into the blob of RLE data
 rather than the bitset itself.
 
 This is good for message maps that contain a large number of handlers as
@@ -74,8 +74,8 @@ Specifics:
 
 The `msg::rle_indexed_builder` will go through a process to take the indices and
 their bitset data and build a single blob of RLE encoded data for all indices, stored in
-and instance of a `msg::detail::rle_storage`. It also generates a set of
-`msg::detail::rle_index` entries for each of the index entries that maps the orignial bitmap
+an instance of a `msg::detail::rle_storage`. It also generates a set of
+`msg::detail::rle_index` entries for each of the index entries that maps the original bitmap
 to a location in the shared storage blob.
 
 The `rle_storage` object contains a simple array of all RLE data bytes. The `rle_index`
@@ -85,7 +85,7 @@ offset to avoid wasted storage and use that.
 NOTE: The specific `rle_storage` and `rle_index`​s are locked together using a unique type
 so that the `rle_index` can not be used with the wrong `rle_storage` object.
 
-When building the shared blog, the encoder will attempt to reduce the storage size by finding
+When building the shared blob, the encoder will attempt to reduce the storage size by finding
 and reusing repeated patterns in the RLE data.
 
 The final `msg::indexed_handler` contains an instance of the `msg::rle_indices` which contains
@@ -95,7 +95,7 @@ This means that the final compile time data generated consists of:
 
 - The Message Map lookups as per the normal implementation, however they store a simple offset
   rather than a bitset.
-- The blog of all RLE bitset data for all indices in the message handling map
+- The blob of all RLE bitset data for all indices in the message handling map
 
 ==== Runtime Handling
 
@@ -108,13 +108,13 @@ a `msg::detail::rle_decoder` by the `rle_storage`. This converts the offset into
 pointer to the sequence of `std::byte`​s for the RLE encoding.
 
 All the collected `rle_decoders` from the various maps in the set of indices are then passed
-to an instance of the `msg::detail::rle_interset` object and returned from the `rle_indices`
+to an instance of the `msg::detail::rle_intersect` object and returned from the `rle_indices`
 call operator.
 
 The `rle_decoder` provides a single-use enumerator that will step over the groups of
 `0`​s or `1`​s, providing a way to advance through them by arbitrary increments.
 
-The `rle_interset` implementation wraps the variadic set of `rle_decoder`​s so that
+The `rle_intersect` implementation wraps the variadic set of `rle_decoder`​s so that
 the caller can iterate through all `1`​s, calling the appropriate callback as it goes.
 
 ===== Efficient Iteration of Bits