Corrected memory access for vectors

Author: artemgl

src/GraphBLAS-sharp/Implementations.fs

@@ -486,15 +486,22 @@ and SparseVector<'a when 'a : struct and 'a : equality>(size: int, indices: int[
                             if firstIndicesBuffer.[middleIdx] < secondIndicesBuffer.[i - middleIdx] then leftEdge <- middleIdx + 1 else rightEdge <- middleIdx - 1
 
                         let boundaryX, boundaryY = rightEdge, i - leftEdge
-                        let firstIndex = firstIndicesBuffer.[boundaryX]
-                        let secondIndex = secondIndicesBuffer.[boundaryY]
 
-                        if boundaryX < 0 || boundaryY >= 0 && firstIndex < secondIndex then
-                            allIndicesBuffer.[i] <- secondIndex
+                        if boundaryX < 0 then
+                            allIndicesBuffer.[i] <- secondIndicesBuffer.[boundaryY]
                             allValuesBuffer.[i] <- secondValuesBuffer.[boundaryY]
-                        else
-                            allIndicesBuffer.[i] <- firstIndex
+                        elif boundaryY < 0 then
+                            allIndicesBuffer.[i] <- firstIndicesBuffer.[boundaryX]
                             allValuesBuffer.[i] <- firstValuesBuffer.[boundaryX]
+                        else
+                            let firstIndex = firstIndicesBuffer.[boundaryX]
+                            let secondIndex = secondIndicesBuffer.[boundaryY]
+                            if firstIndex < secondIndex then
+                                allIndicesBuffer.[i] <- secondIndex
+                                allValuesBuffer.[i] <- secondValuesBuffer.[boundaryY]
+                            else
+                                allIndicesBuffer.[i] <- firstIndex
+                                allValuesBuffer.[i] <- firstValuesBuffer.[boundaryX]
             @>
 
         let createSortedConcatenation =