Fixed missed usages of longestCommonPrefixPartialKey

ConflictSet.cpp

@@ -626,6 +626,7 @@ bool compareStride(const uint8_t *ap, const uint8_t *bp) {
   return eq;
 }
 
+// Precondition: ap[:kStride] != bp[:kStride]
 int firstNeqStride(const uint8_t *ap, const uint8_t *bp) {
 #if defined(HAS_AVX)
   static_assert(kStride == 64);
@@ -827,7 +828,8 @@ bool checkPointRead(Node *n, const std::span<const uint8_t> key,
 
     if (n->partialKeyLen > 0) {
       int commonLen = std::min<int>(n->partialKeyLen, remaining.size());
-      int i = longestCommonPrefix(n->partialKey, remaining.data(), commonLen);
+      int i = longestCommonPrefixPartialKey(n->partialKey, remaining.data(),
+                                            commonLen);
       if (i < commonLen) {
         auto c = n->partialKey[i] <=> remaining[i];
         if (c > 0) {
@@ -1087,7 +1089,8 @@ struct CheckRangeLeftSide {
 
       if (n->partialKeyLen > 0) {
         int commonLen = std::min<int>(n->partialKeyLen, remaining.size());
-        int i = longestCommonPrefix(n->partialKey, remaining.data(), commonLen);
+        int i = longestCommonPrefixPartialKey(n->partialKey, remaining.data(),
+                                              commonLen);
         searchPathLen += i;
         if (i < commonLen) {
           auto c = n->partialKey[i] <=> remaining[i];