Fix IndexStore: rename Finalize() to CompleteIndex() to fix CS0465 collision with Object.Finalize

FastSeekWpf/Core/IndexStore.cs

@@ -38,32 +38,19 @@ public struct IndexEntry
     public readonly FileKind Kind => IsDir ? FileKind.Directory : FileKind.File;
 }
 
-/// <summary>
-/// High-performance index store matching the Rust design:
-/// - Arena-backed name storage (List&lt;byte&gt; for O(1) append)
-/// - Parallel cached lowercase strings for zero-allocation search
-/// - Sorted ref_lookup for O(log n) parent lookups
-/// - Multi-drive support via per-entry DriveIdx
-/// </summary>
 public class IndexStore
 {
     public List<IndexEntry> Entries = new();
-    // Arena stores UTF-8 bytes
     public List<byte> NameArena = new();
     public List<byte> NameLowerArena = new();
-    // Parallel string cache for hot-path search (no UTF8 decoding during search)
     public List<string> NameCache = new();
     public List<string> NameLowerCache = new();
-    // Sorted by file_ref for binary search
     public List<(ulong fileRef, int idx)> RefLookup = new();
-    // One root per drive — entries reference via DriveIdx
     public List<string> DriveRoots = new();
     public List<JournalCheckpoint> Checkpoints = new();
 
     public int Count => Entries.Count;
 
-    // ---- Hot path: cached name access (zero-allocation) ----
-
     public string NameAt(int i) => NameCache[i];
     public string NameLowerAt(int i) => NameLowerCache[i];
     public string DriveRootAt(int i) => DriveRoots[Entries[i].DriveIdx];
@@ -93,7 +80,6 @@ public class IndexStore
 
     public void PopulateFromScan(ScanResult scan, string driveRoot)
     {
-        // Find or add drive root
         byte driveIdx = 0;
         int existing = DriveRoots.IndexOf(driveRoot);
         if (existing >= 0)
@@ -155,9 +141,8 @@ public class IndexStore
     /// Sort entries by lowercase name and rebuild lookup tables.
     /// Matches Rust IndexStore::finalize().
     /// </summary>
-    public void Finalize()
+    public void CompleteIndex()
     {
-        // Sort by lowercase name for search
         var indices = Enumerable.Range(0, Entries.Count).ToArray();
         Array.Sort(indices, (a, b) => string.CompareOrdinal(NameLowerCache[a], NameLowerCache[b]));
 
@@ -177,7 +162,6 @@ public class IndexStore
         NameLowerCache = sortedLower;
         RebuildRefLookup();
 
-        // Shrink arenas to fit — matches Rust shrink_to_fit
         NameArena.TrimExcess();
         NameLowerArena.TrimExcess();
     }
@@ -251,8 +235,6 @@ public class IndexStore
         return store;
     }
 
-    // ── Live mutations ───────────────────────────────────────────────
-
     public void Insert(FileRecord record)
     {
         string nameLower = record.Name.ToLowerInvariant();
@@ -268,7 +250,6 @@ public class IndexStore
         ushort nlLen = (ushort)lowerBytes.Length;
         NameLowerArena.AddRange(lowerBytes);
 
-        // Default to first drive if unknown
         byte driveIdx = 0;
         if (DriveRoots.Count == 0)
             DriveRoots.Add("C:\\");
@@ -285,7 +266,6 @@ public class IndexStore
             DriveIdx = driveIdx
         };
 
-        // Insert in sorted position by lowercase name — matches Rust partition_point + insert
         int pos = 0;
         for (; pos < Entries.Count; pos++)
         {
@@ -296,14 +276,11 @@ public class IndexStore
         NameCache.Insert(pos, record.Name);
         NameLowerCache.Insert(pos, nameLower);
 
-        // Rebuild lookup (rare operation, acceptable) — matches Rust
         RebuildRefLookup();
     }
 
     public void Remove(ulong fileRef)
     {
-        // Name bytes left as dead space in arena (negligible for rare deletes)
-        // — matches Rust comment exactly
         int idx = -1;
         for (int i = 0; i < Entries.Count; i++)
         {