massmap 0.1.5

Static hash table that scales via disk-backed expansion to trim memory usage while ensuring each lookup needs exactly one I/O.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
use serde::Deserialize;
use std::borrow::Borrow;
use std::hash::{BuildHasher, Hash};
use std::io::{Error, ErrorKind, Result};
use std::marker::PhantomData;

use crate::{
    MassMapBucketMeta, MassMapDefaultHashLoader, MassMapHashLoader, MassMapHeader, MassMapInfo,
    MassMapMeta, MassMapReader,
};

/// Immutable hash map backed by a serialized massmap file.
///
/// A `MassMap` is created from a [`MassMapReader`] (typically a file) and
/// provides low-latency lookups without loading the whole dataset into memory.
/// Keys and values are deserialized on demand using `serde` and MessagePack.
///
/// # Type Parameters
/// - `K`: key type stored in the map; must implement `serde::Deserialize`.
/// - `V`: value type stored in the map; must implement `serde::Deserialize` and `Clone`.
/// - `R`: reader that satisfies [`MassMapReader`].
/// - `H`: hash loader used to reconstruct the [`BuildHasher`](BuildHasher) from
///   the persisted [`MassMapHashConfig`](crate::MassMapHashConfig).
#[derive(Debug)]
pub struct MassMapInner<R: MassMapReader, H: MassMapHashLoader = MassMapDefaultHashLoader> {
    /// Header serialized at the start of the massmap file.
    pub header: MassMapHeader,
    /// Metadata describing the layout and hashing strategy of the backing file.
    pub meta: MassMapMeta,
    /// Metadata for each hash bucket in the map.
    pub bucket_metas: Vec<MassMapBucketMeta>,
    /// Hash state initialized with the stored seed.
    build_hasher: H::BuildHasher,
    /// Reader used to access the backing storage.
    pub reader: R,
}

/// Typed view over a [`MassMapInner`].
///
/// This wrapper carries the key/value types at compile time while sharing the
/// underlying storage and hashing configuration with other typed views.
pub struct MassMap<K, V, R: MassMapReader, H: MassMapHashLoader = MassMapDefaultHashLoader> {
    inner: MassMapInner<R, H>,
    /// Phantom data to associate key and value types.
    phantom_data: PhantomData<(K, V)>,
}

impl<R: MassMapReader, H: MassMapHashLoader> MassMapInner<R, H> {
    /// Constructs an untyped massmap from a [`MassMapReader`] implementation.
    ///
    /// The method validates the leading header (magic number, metadata offset and
    /// length) and deserializes [`MassMapMeta`]. Any IO or deserialization errors
    /// are forwarded to the caller.
    pub fn load(reader: R) -> Result<Self> {
        let header =
            reader.read_exact_at(0, MassMapHeader::SIZE as u64, MassMapHeader::deserialize)?;

        let (meta, bucket_metas): (MassMapMeta, Vec<MassMapBucketMeta>) =
            reader.read_exact_at(header.meta_offset, header.meta_length, |data| {
                rmp_serde::from_slice(data).map_err(|e| {
                    Error::new(
                        ErrorKind::InvalidData,
                        format!("Failed to deserialize MassMapMeta: {}", e),
                    )
                })
            })?;

        let build_hasher = H::load(&meta.hash_config)?;
        Ok(MassMapInner {
            header,
            meta,
            bucket_metas,
            build_hasher,
            reader,
        })
    }

    /// Returns the number of entries written into this map.
    pub fn len(&self) -> u64 {
        self.meta.entry_count
    }

    /// Returns `true` if the map contains no entries.
    pub fn is_empty(&self) -> bool {
        self.meta.entry_count == 0
    }

    /// Returns information about the map's structure and contents.
    pub fn info(&self) -> MassMapInfo {
        MassMapInfo {
            header: self.header.clone(),
            meta: self.meta.clone(),
        }
    }

    /// Casts this untyped massmap into a typed view with the specified key and value types.
    pub fn cast<K, V>(self) -> MassMap<K, V, R, H>
    where
        K: for<'de> Deserialize<'de> + Eq + Hash,
        V: for<'de> Deserialize<'de> + Clone,
    {
        MassMap {
            inner: self,
            phantom_data: PhantomData,
        }
    }
}

impl<K, V, R: MassMapReader, H: MassMapHashLoader> MassMap<K, V, R, H>
where
    K: for<'de> Deserialize<'de> + Eq + Hash,
    V: for<'de> Deserialize<'de> + Clone,
{
    /// Constructs a massmap from a [`MassMapReader`] implementation.
    ///
    /// The method validates the leading header (magic number, metadata offset and
    /// length) and deserializes [`MassMapMeta`]. Any IO or deserialization errors
    /// are forwarded to the caller.
    pub fn load(reader: R) -> Result<Self> {
        let inner = MassMapInner::load(reader)?;
        Ok(MassMap {
            inner,
            phantom_data: PhantomData,
        })
    }

    /// Returns the number of entries written into this map.
    pub fn len(&self) -> u64 {
        self.inner.len()
    }

    /// Returns `true` if the map contains no entries.
    pub fn is_empty(&self) -> bool {
        self.inner.is_empty()
    }

    /// Returns the number of buckets in the underlying massmap.
    ///
    /// This is mainly intended for testing and diagnostics.
    pub fn bucket_count(&self) -> usize {
        self.inner.bucket_metas.len()
    }

    /// Exposes a reference to the underlying immutable metadata.
    pub fn meta(&self) -> &MassMapMeta {
        &self.inner.meta
    }

    /// Exposes a reference to the underlying bucket metadata array.
    pub fn bucket_metas(&self) -> &[MassMapBucketMeta] {
        &self.inner.bucket_metas
    }

    /// Returns a reference to the underlying massmap header.
    ///
    /// This can be used to inspect metadata about the massmap file, such as version or configuration.
    pub fn header(&self) -> &MassMapHeader {
        &self.inner.header
    }

    /// Returns a reference to the underlying reader used to access the backing storage.
    pub fn reader(&self) -> &R {
        &self.inner.reader
    }

    /// Returns information about the map's structure and contents.
    pub fn info(&self) -> MassMapInfo {
        self.inner.info()
    }

    /// Attempts to deserialize the value associated with `k`.
    ///
    /// Keys are hashed using the stored seed and only the relevant bucket is
    /// deserialized, minimizing IO when the entry is missing.
    ///
    /// # Errors
    ///
    /// Returns an error if the reader fails to provide the bucket or if the
    /// serialized data cannot be deserialized into `(K, V)` pairs.
    pub fn get<Q>(&self, k: &Q) -> Result<Option<V>>
    where
        K: Borrow<Q>,
        Q: Eq + Hash + ?Sized,
    {
        let index = self.bucket_index(k);
        let entries = self.get_bucket(index)?;
        for (key, value) in entries.iter() {
            if key.borrow() == k {
                return Ok(Some(value.clone()));
            }
        }
        Ok(None)
    }

    /// Performs multiple lookups in a single pass.
    ///
    /// The reader is asked to fetch each bucket sequentially; implementations
    /// may override [`MassMapReader::batch_read_at`] to issue true scatter/gather
    /// reads where available. Results preserve the order of `keys`.
    ///
    /// # Errors
    ///
    /// Returns an error under the same conditions as [`get`](Self::get).
    pub fn batch_get<Q>(
        &self,
        keys: impl IntoIterator<Item = impl Borrow<Q>>,
    ) -> Result<Vec<Option<V>>>
    where
        K: Borrow<Q>,
        Q: Eq + Hash + ?Sized,
    {
        let iov = keys.into_iter().map(|key| {
            let index = self.bucket_index(key.borrow());
            let bucket = &self.inner.bucket_metas[index];
            (key, bucket.offset, bucket.length as u64)
        });

        self.inner.reader.batch_read_at(iov, |expected, data| {
            if data.is_empty() {
                return Ok(None);
            }

            let entries: Vec<(K, V)> = rmp_serde::from_slice(data).map_err(|e| {
                Error::new(
                    ErrorKind::InvalidData,
                    format!("Failed to deserialize bucket entries: {}", e),
                )
            })?;

            for (key, value) in entries.iter() {
                if key.borrow() == expected.borrow() {
                    return Ok(Some(value.clone()));
                }
            }
            Ok(None)
        })
    }

    /// Creates an iterator that traverses all entries in the map by bucket order.
    ///
    /// The iterator reads each bucket sequentially from the backing storage,
    /// deserializes all entries in the bucket, and yields them one at a time.
    /// Each bucket is fully loaded into memory before any of its entries are
    /// yielded. Iteration stops immediately if a bucket fails to deserialize.
    ///
    /// # Examples
    ///
    /// ```
    /// use massmap::{MassMap, MassMapBuilder};
    ///
    /// # fn main() -> std::io::Result<()> {
    /// let entries = [("a", 1), ("b", 2), ("c", 3)];
    /// let file = std::fs::File::create("examples/iter_test.massmap")?;
    /// MassMapBuilder::default().build(&file, entries.iter())?;
    ///
    /// let file = std::fs::File::open("examples/iter_test.massmap")?;
    /// let map = MassMap::<String, i32, _>::load(file)?;
    /// let all_entries: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>()?;
    /// assert_eq!(all_entries.len(), 3);
    /// # Ok(())
    /// # }
    /// ```
    pub fn iter(&self) -> MassMapIter<'_, K, V, R, H> {
        MassMapIter {
            map: self,
            bucket_index: 0,
            current_entries: Vec::new().into_iter(),
        }
    }

    /// Retrieves all entries in the specified bucket.
    ///
    /// This method is primarily intended for testing and debugging.
    ///
    /// # Errors
    ///
    /// Returns an error if the reader fails to provide the bucket or if the
    /// serialized data cannot be deserialized into `(K, V)` pairs.
    pub fn get_bucket(&self, index: usize) -> Result<Vec<(K, V)>> {
        let bucket = &self.inner.bucket_metas[index];
        if bucket.count == 0 {
            return Ok(Vec::new());
        }

        self.inner
            .reader
            .read_exact_at(bucket.offset, bucket.length as u64, |data| {
                let entries: Vec<(K, V)> = rmp_serde::from_slice(data).map_err(|e| {
                    Error::new(
                        ErrorKind::InvalidData,
                        format!("Failed to deserialize bucket entries: {}", e),
                    )
                })?;
                Ok(entries)
            })
    }

    /// Computes the bucket index for the given key.
    pub fn bucket_index<Q>(&self, k: &Q) -> usize
    where
        K: Borrow<Q>,
        Q: Eq + Hash + ?Sized,
    {
        (self.inner.build_hasher.hash_one(k) % (self.inner.bucket_metas.len() as u64)) as usize
    }
}

/// Iterator over all entries in a [`MassMap`].
///
/// This iterator traverses buckets sequentially, loading each bucket fully into
/// memory before yielding its entries one by one. Items are returned as
/// `Result`s so that IO or deserialization failures propagate to the caller.
pub struct MassMapIter<'a, K, V, R: MassMapReader, H: MassMapHashLoader> {
    map: &'a MassMap<K, V, R, H>,
    bucket_index: usize,
    current_entries: std::vec::IntoIter<(K, V)>,
}

impl<'a, K, V, R: MassMapReader, H: MassMapHashLoader> Iterator for MassMapIter<'a, K, V, R, H>
where
    K: for<'de> Deserialize<'de> + Eq + Hash,
    V: for<'de> Deserialize<'de> + Clone,
{
    type Item = Result<(K, V)>;

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            // If we have entries in the current bucket, yield the next one
            if let Some(entry) = self.current_entries.next() {
                return Some(Ok(entry));
            }

            // Move to the next bucket
            if self.bucket_index >= self.map.inner.bucket_metas.len() {
                return None;
            }

            // Read and deserialize the bucket
            let result = self.map.get_bucket(self.bucket_index);
            self.bucket_index += 1;

            match result {
                Ok(entries) => {
                    let vec: Vec<(K, V)> = entries;
                    self.current_entries = vec.into_iter();
                }
                Err(e) => return Some(Err(e)),
            }
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::*;

    #[test]
    fn test_basic() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = vec![
            ("apple", 1),
            ("banana", 2),
            ("cherry", 3),
            ("date", 4),
            ("elderberry", 5),
        ];
        let builder = MassMapBuilder::default()
            .with_hash_seed(42)
            .with_bucket_count(8)
            .with_writer_buffer_size(8 << 20) // 8 MiB
            .with_field_names(true);
        let info = builder.build(&writer, entries.iter()).unwrap();
        assert_eq!(info.meta.entry_count, 5);

        let file = std::fs::File::open(&file).unwrap();
        assert_eq!(
            info.header.meta_length + info.header.meta_offset,
            file.metadata().unwrap().len()
        );
        let map = MassMap::<String, i32, _>::load(file).unwrap();
        assert_eq!(info, map.info());
        assert_eq!(map.len(), 5);
        assert!(!map.is_empty());
        assert_eq!(map.bucket_count(), 8);
        assert_eq!(
            map.inner.bucket_metas.iter().map(|b| b.count).sum::<u32>(),
            5
        );
        assert_eq!(map.get("apple").unwrap(), Some(1));
        assert_eq!(map.get("banana").unwrap(), Some(2));
        assert_eq!(map.get("steins").unwrap(), None);
        assert_eq!(map.get("gate").unwrap(), None);

        let keys = vec!["cherry", "date", "fig", "elderberry", "steins", "gate"];
        let results = map.batch_get::<str>(keys).unwrap();
        assert_eq!(results, vec![Some(3), Some(4), None, Some(5), None, None]);

        let keys = ["cherry", "date", "fig", "elderberry", "steins", "gate"].map(|s| s.to_string());
        let results = map.batch_get::<String>(&keys).unwrap();
        assert_eq!(results, vec![Some(3), Some(4), None, Some(5), None, None]);
    }

    #[test]
    fn test_1m() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap.bin");
        let writer = std::fs::File::create(&file).unwrap();
        const N: u64 = 1_000_000;
        let entries = (0..N).map(|i| (i, i));

        let builder = MassMapBuilder::default()
            .with_bucket_count(N as u64)
            .with_writer_buffer_size(8 << 20); // 8 MiB
        builder.build(&writer, entries).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        println!("massmap file size: {}", file.metadata().unwrap().len());

        let map = MassMap::<u64, u64, _>::load(file).unwrap();
        assert_eq!(map.len(), N as u64);
        assert_eq!(map.bucket_count(), N as usize);
        assert_eq!(
            map.inner
                .bucket_metas
                .iter()
                .map(|b| b.count as usize)
                .sum::<usize>(),
            N as usize
        );

        for _ in 0..10 {
            let k = rand::random::<u64>() % N as u64;
            assert_eq!(map.get(&k).unwrap(), Some(k));

            let k = k + N as u64;
            assert_eq!(map.get(&k).unwrap(), None);
        }
    }

    #[test]
    fn test_invalid_data() {
        let dir = tempfile::tempdir().unwrap();
        let path = dir.path().join("massmap_invalid.bin");
        let writer = std::fs::File::create(&path).unwrap();
        const N: u64 = 1000;
        let entries = (0..N).map(|i| (i, i));

        let builder = MassMapBuilder::default()
            .with_bucket_count(1)
            .with_writer_buffer_size(8 << 20); // 8 MiB
        let info = builder.build(&writer, entries).unwrap();

        let file = std::fs::OpenOptions::new()
            .read(true)
            .write(true)
            .open(&path)
            .unwrap();

        {
            file.write_all_at(b"invalid data", 24).unwrap();
            let file = std::fs::File::open(&path).unwrap();
            let map = MassMap::<u64, u64, _>::load(file).unwrap();
            map.get(&0).unwrap_err();
            map.batch_get([0]).unwrap_err();
        }

        {
            file.write_all_at(b"invalid data", info.header.meta_offset)
                .unwrap();
            let file = std::fs::File::open(&path).unwrap();
            assert!(MassMap::<u64, u64, _>::load(file).is_err());
        }

        {
            file.set_len(info.header.meta_offset + info.header.meta_length - 8)
                .unwrap();
            let file = std::fs::File::open(&path).unwrap();
            assert!(MassMap::<u64, u64, _>::load(file).is_err());
        }

        {
            file.write_all_at(b"invalid data", 0).unwrap();
            let file = std::fs::File::open(&path).unwrap();
            assert!(MassMap::<u64, u64, _>::load(file).is_err());
        }

        {
            let file = std::fs::File::create(&path).unwrap();
            assert!(MassMap::<u64, u64, _>::load(file).is_err());
        }

        let writer = std::fs::File::create(&path).unwrap();
        let builder = MassMapBuilder::default()
            .with_bucket_count(1)
            .with_writer_buffer_size(8 << 20)
            .with_bucket_size_limit(16);
        let entries = (0..N).map(|i| (i, i));
        builder.build(&writer, entries).unwrap_err();
    }

    #[test]
    fn test_iterator_basic() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = vec![
            ("apple", 1),
            ("banana", 2),
            ("cherry", 3),
            ("date", 4),
            ("elderberry", 5),
        ];
        let builder = MassMapBuilder::default()
            .with_hash_seed(42)
            .with_bucket_count(8);
        builder.build(&writer, entries.iter()).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<String, i32, _>::load(file).unwrap();

        // Collect all entries from the iterator
        let mut collected: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected.len(), 5);

        // Sort to compare with original entries
        collected.sort_by(|a, b| a.0.cmp(&b.0));
        let mut expected = entries
            .iter()
            .map(|(k, v)| (k.to_string(), *v))
            .collect::<Vec<_>>();
        expected.sort_by(|a, b| a.0.cmp(&b.0));
        assert_eq!(collected, expected);
    }

    #[test]
    fn test_iterator_empty() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter_empty.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries: Vec<(String, i32)> = vec![];
        let builder = MassMapBuilder::default().with_bucket_count(8);
        builder.build(&writer, entries.iter()).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<String, i32, _>::load(file).unwrap();

        let collected: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected.len(), 0);
    }

    #[test]
    fn test_iterator_single_bucket() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter_single.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = vec![("a", 1), ("b", 2), ("c", 3), ("d", 4), ("e", 5)];
        // Use 1 bucket to ensure all entries are in the same bucket
        let builder = MassMapBuilder::default().with_bucket_count(1);
        builder.build(&writer, entries.iter()).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<String, i32, _>::load(file).unwrap();

        let collected: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected.len(), 5);

        // All entries should be present
        let mut collected_sorted = collected.clone();
        collected_sorted.sort_by(|a, b| a.0.cmp(&b.0));
        let mut expected = entries
            .iter()
            .map(|(k, v)| (k.to_string(), *v))
            .collect::<Vec<_>>();
        expected.sort_by(|a, b| a.0.cmp(&b.0));
        assert_eq!(collected_sorted, expected);
    }

    #[test]
    fn test_iterator_many_buckets() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter_many.bin");
        let writer = std::fs::File::create(&file).unwrap();
        const N: u64 = 1000;
        let entries = (0..N).map(|i| (i, i * 2));
        // Use many buckets
        let builder = MassMapBuilder::default().with_bucket_count(100);
        builder.build(&writer, entries).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<u64, u64, _>::load(file).unwrap();

        let collected: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected.len(), N as usize);

        // Verify all entries are present
        let mut collected_sorted = collected.clone();
        collected_sorted.sort_by(|a, b| a.0.cmp(&b.0));
        for i in 0..N {
            assert_eq!(collected_sorted[i as usize], (i, i * 2));
        }
    }

    #[test]
    fn test_iterator_multiple_iterations() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter_multiple.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = vec![("x", 10), ("y", 20), ("z", 30)];
        let builder = MassMapBuilder::default().with_bucket_count(4);
        builder.build(&writer, entries.iter()).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<String, i32, _>::load(file).unwrap();

        // First iteration
        let collected1: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected1.len(), 3);

        // Second iteration should yield the same results
        let collected2: Vec<_> = map.iter().collect::<std::io::Result<Vec<_>>>().unwrap();
        assert_eq!(collected2.len(), 3);
        assert_eq!(collected1, collected2);
    }

    #[test]
    fn test_iterator_partial_iteration() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_iter_partial.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = (0..100).map(|i| (i, i));
        let builder = MassMapBuilder::default().with_bucket_count(10);
        builder.build(&writer, entries).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMap::<u64, u64, _>::load(file).unwrap();

        // Take only the first 10 entries
        let partial: Vec<_> = map
            .iter()
            .take(10)
            .collect::<std::io::Result<Vec<_>>>()
            .unwrap();
        assert_eq!(partial.len(), 10);

        // Skip some and take more
        let skip_take: Vec<_> = map
            .iter()
            .skip(20)
            .take(5)
            .collect::<std::io::Result<Vec<_>>>()
            .unwrap();
        assert_eq!(skip_take.len(), 5);
    }

    #[test]
    fn test_iterator_invalid_bucket() {
        let dir = tempfile::tempdir().unwrap();
        let path = dir.path().join("massmap_iter_invalid.bin");
        let writer = std::fs::File::create(&path).unwrap();
        let entries = (0..100).map(|i| (i, i));

        let builder = MassMapBuilder::default()
            .with_bucket_count(10)
            .with_writer_buffer_size(8 << 20);
        builder.build(&writer, entries).unwrap();

        // Corrupt bucket data by writing invalid data at offset 24 (start of bucket data)
        // Open the corrupted file and try to iterate
        let file = std::fs::File::open(&path).unwrap();
        let map = MassMap::<u64, u64, _>::load(file).unwrap();

        for bucket in &map.inner.bucket_metas {
            if bucket.offset != 24 && bucket.count > 0 {
                // Corrupt the first non-empty bucket
                let file = std::fs::OpenOptions::new()
                    .read(true)
                    .write(true)
                    .open(&path)
                    .unwrap();
                file.write_all_at(b"corrupted bucket", bucket.offset)
                    .unwrap();
                break;
            }
        }

        // The iterator should return an error when it tries to read the corrupted bucket
        let mut found_error = false;
        for result in map.iter() {
            if result.is_err() {
                found_error = true;
                break;
            }
        }
        assert!(found_error);
    }

    #[test]
    fn test_massmap_cast() {
        let dir = tempfile::tempdir().unwrap();
        let file = dir.path().join("massmap_cast.bin");
        let writer = std::fs::File::create(&file).unwrap();
        let entries = vec![
            ("apple", 1),
            ("banana", 2),
            ("cherry", 3),
            ("date", 4),
            ("elderberry", 5),
        ];
        let builder = MassMapBuilder::default()
            .with_hash_seed(42)
            .with_bucket_count(8);
        builder.build(&writer, entries.iter()).unwrap();

        let file = std::fs::File::open(&file).unwrap();
        let map = MassMapInner::<_>::load(file).unwrap();

        let casted_map: MassMap<String, i64, _, _> = map.cast();
        assert_eq!(casted_map.get("apple").unwrap(), Some(1i64));
        assert_eq!(casted_map.get("banana").unwrap(), Some(2i64));
        assert_eq!(casted_map.get("steins").unwrap(), None);
    }
}