lib/h3/traversal.rb in h3-3.3.1 vs lib/h3/traversal.rb in h3-3.4.0

@@ -36,10 +36,10 @@
     #
     # Derive the number of hexagons present in a line between two H3 indexes.
     #
     # This value is simply `h3_distance(origin, destination) + 1` when a line is computable.
     #
-    # Returns a negative number if a line cannot be computed e.g. 
+    # Returns a negative number if a line cannot be computed e.g.
     # a pentagon was encountered, or the hexagons are too far apart.
     #
     # @param [Integer] origin Origin H3 index
     # @param [Integer] destination H3 index
     #