Make length comparison cross-platform

Author: poyea

bktree/bktree.hpp

@@ -80,8 +80,7 @@ class LengthDistance final : public Distance<LengthDistance> {
 public:
   explicit LengthDistance(){};
   integer_type compute_distance(std::string_view s, std::string_view t) const {
-    std::int64_t const d = s.length() - t.length();
-    return d >= 0 ? d : -d;
+    return s.length() > t.length() ? s.length() - t.length() : t.length() - s.length();
   }
 };
 

examples/bktree_damerau.cpp

@@ -7,7 +7,7 @@ void example() {
   bk_tree::BKTree<bk_tree::metrics::DamerauLevenshteinDistance> tree;
   {
     std::vector<std::string> input{"tall", "tell",  "teel",  "feel", "tally",
-                                  "tuck", "belly", "kelly", "kill", "tal"};
+                                   "tuck", "belly", "kelly", "kill", "tal"};
     for (auto &s : input) {
       tree.insert(s);
     }

examples/bktree_edit.cpp

@@ -7,7 +7,7 @@ void example() {
   bk_tree::BKTree<bk_tree::metrics::EditDistance> tree;
   {
     std::vector<std::string> input{"tall", "tell",  "teel",  "feel", "tally",
-                                  "tuck", "belly", "kelly", "kill", "tal"};
+                                   "tuck", "belly", "kelly", "kill", "tal"};
     for (auto &s : input) {
       tree.insert(s);
     }

examples/bktree_hamming.cpp

@@ -7,7 +7,7 @@ void example() {
   bk_tree::BKTree<bk_tree::metrics::HammingDistance> tree;
   {
     std::vector<std::string> input{"tall", "tell",  "teel",  "feel", "tally",
-                                  "tuck", "belly", "kelly", "kill", "tal"};
+                                   "tuck", "belly", "kelly", "kill", "tal"};
     for (auto &s : input) {
       tree.insert(s);
     }

examples/bktree_lcs.cpp

@@ -7,7 +7,7 @@ void example() {
   bk_tree::BKTree<bk_tree::metrics::LCSubseqDistance> tree;
   {
     std::vector<std::string> input{"tall",  "tell",  "teel", "feel", "tally",
-                                  "belly", "kelly", "kill", "tal",  "tuck"};
+                                   "belly", "kelly", "kill", "tal",  "tuck"};
     for (auto &s : input) {
       tree.insert(s);
     }