From 55c20de1356ce290c4ff96927a6b134f203ec90f Mon Sep 17 00:00:00 2001
From: Chris Jordan <jordanchriss@gmail.com>
Date: Fri, 16 Feb 2024 00:03:39 -0500
Subject: [PATCH] added calculation of fragmentKey to do the correct chunk
 lookup when fragmentId != fragmentKey fixed lint errors

---
 src/mesh/frontend.ts | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/mesh/frontend.ts b/src/mesh/frontend.ts
index 41ae8c940..882041339 100644
--- a/src/mesh/frontend.ts
+++ b/src/mesh/frontend.ts
@@ -589,7 +589,8 @@ export class MeshLayer extends PerspectiveViewRenderLayer<ThreeDimensionalRender
   ): Float32Array | undefined {
     const transform = this.displayState.transform.value;
     if (transform.error !== undefined) return undefined;
-    const chunk = this.source.chunks.get(getObjectKey(id));
+    const key = getObjectKey(id);
+    const chunk = this.source.chunks.get(key);
     if (chunk === undefined) return undefined;
     const { rank } = transform;
     const inverseModelToRenderLayerTransform = new Float32Array(
@@ -611,10 +612,11 @@ export class MeshLayer extends PerspectiveViewRenderLayer<ThreeDimensionalRender
       rank,
     );
     const { fragmentIds } = chunk;
-    let closestVertex = new Float32Array(rank);
+    const closestVertex = new Float32Array(rank);
     let closestDistanceSq = Number.POSITIVE_INFINITY;
-    for (let fragmentId of fragmentIds) {
-      const fragmentChunk = this.source.fragmentSource.chunks.get(fragmentId);
+    for (const fragmentId of fragmentIds) {
+      const { key: fragmentKey } = this.source.getFragmentKey(key, fragmentId);
+      const fragmentChunk = this.source.fragmentSource.chunks.get(fragmentKey);
       if (fragmentChunk === undefined) continue;
       const { state, meshData } = fragmentChunk;
       if (
@@ -628,10 +630,8 @@ export class MeshLayer extends PerspectiveViewRenderLayer<ThreeDimensionalRender
       for (let i = 0; i < vertexPositions.length; i += rank) {
         let distanceSq = 0;
         for (let j = 0; j < rank; j++) {
-          distanceSq += Math.pow(
-            vertexPositions[i + j] - nearestPositionInModal[j],
-            2,
-          );
+          distanceSq +=
+            (vertexPositions[i + j] - nearestPositionInModal[j]) ** 2;
         }
         if (distanceSq < closestDistanceSq) {
           closestDistanceSq = distanceSq;