bump tests

Author: nnethercott

src/tests/reader.rs

@@ -117,7 +117,10 @@ fn two_dimension_on_a_line() {
 
     // if we can't look into enough nodes we find some random points
     let ret = reader.nns(5).search_k(NonZeroUsize::new(1).unwrap()).by_item(&rtxn, 1).unwrap();
-    insta::assert_snapshot!(NnsRes(ret), @"id(63): distance(62)");
+    insta::assert_snapshot!(NnsRes(ret), @r"
+    id(1): distance(0)
+    id(0): distance(1)
+    ");
 
     // if we can look into all the node there is no inifinite loop and it works
     let ret =

src/tests/snapshots/arroy__tests__upgrade__large_upgrade_v0_6_to_v0_7-10.snap

@@ -77,7 +77,7 @@ fn simple_upgrade_v0_6_to_v0_7() {
     Dumping index 0
     Root: Metadata { dimensions: 2, items: RoaringBitmap<[0, 1, 2, 3, 4, 5]>, roots: [0], distance: "euclidean" }
     Version: Version { major: 0, minor: 7, patch: 0 }
-    Tree 0: SplitPlaneNormal(SplitPlaneNormal<euclidean> { left: 5, right: 4, normal: [1.0000, 0.0000] })
+    Tree 0: SplitPlaneNormal(SplitPlaneNormal<euclidean> { left: 5, right: 4, normal: Leaf { header: NodeHeaderEuclidean { bias: 0.0 }, vector: [1.0000, 0.0000] } })
     Tree 1: Descendants(Descendants { descendants: [1, 5] })
     Tree 2: Descendants(Descendants { descendants: [3, 4] })
     Tree 3: SplitPlaneNormal(SplitPlaneNormal<euclidean> { left: 2, right: 6, normal: "none" })