fastalp 0.1.41

World's fastest and highest-ratio lossless floating-point compression / 全球最快、压缩比最高的通用时序浮点无损压缩
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
725
726
727
728
/// Dynamically dispatches concrete decoder type according to AlpParams (zero virtual function overhead, monomorphized).
/// 根据 AlpParams 参数动态派发具体的解码器类型(零运行时虚函数开销,单次单态化展开)
macro_rules! dispatch_decoder {
  ($params:expr, $base:expr, $F:ty, $decoder:ident => $body:expr) => {{
    let (exp_factor, fac_int, frac_flt) = $params.factors::<$F>();
    if $params.use_div {
      let $decoder = $crate::bitpack::AlpDivDecoder {
        base: $base,
        exp_factor,
      };
      $body
    } else if fac_int == 1 {
      let $decoder = $crate::bitpack::AlpFac1Decoder {
        base: $base,
        frac_flt,
      };
      $body
    } else {
      let $decoder = $crate::bitpack::AlpMulDecoder {
        base: $base,
        fac_int,
        frac_flt,
      };
      $body
    }
  }};
}

mod delta;
mod standard;

use core::{
  marker::PhantomData,
  mem::{MaybeUninit, size_of},
  ptr::copy_nonoverlapping,
  slice::from_raw_parts_mut,
};

use delta::decode_delta_raw;
use standard::decode_standard_raw;

use crate::{
  bitpack::{
    AlpDictDecoder, AlpRdConstantDecoder, bitunpack_core_generic, bitunpack_u64_raw,
    bitunpack_u64_slice, packed_byte_size,
  },
  constants::{EXC_COUNT_LEN, EXC_COUNT_LEN_U32, MAX_DICT_ENTRIES},
  error::{Error, Result},
  float::AlpFloat,
  header::{ParsedHeader, read_count, read_header},
  params::AlpParams,
};

#[inline(always)]
fn count_bitmap_ones(bitmap: &[u8], count: usize) -> usize {
  let full_bytes = count / 8;
  let full_words = full_bytes / 8;
  let mut ones = 0usize;
  let ptr = bitmap.as_ptr().cast::<u64>();
  for i in 0..full_words {
    // SAFETY: bitmap has (count + 7) / 8 bytes, which has at least full_words * 8 bytes
    let word = unsafe { ptr.add(i).read_unaligned() };
    ones += word.count_ones() as usize;
  }
  for &b in &bitmap[full_words * 8..full_bytes] {
    ones += b.count_ones() as usize;
  }
  let rem_bits = count % 8;
  if rem_bits > 0 {
    let mask = (1u8 << rem_bits) - 1;
    ones += (bitmap[full_bytes] & mask).count_ones() as usize;
  }
  ones
}

#[inline(always)]
unsafe fn expand_byte<F: AlpFloat>(
  byte: u8,
  out_pos: usize,
  src_idx: &mut usize,
  prev: &mut F,
  non_repeats: *const F,
  dst_ptr: *mut F,
) {
  unsafe {
    if byte == 0x00 {
      copy_nonoverlapping(non_repeats.add(*src_idx + 1), dst_ptr.add(out_pos), 8);
      *src_idx += 8;
      *prev = *dst_ptr.add(out_pos + 7);
    } else if byte == 0xFF {
      let p = *prev;
      for k in 0..8 {
        dst_ptr.add(out_pos + k).write(p);
      }
    } else {
      for k in 0..8 {
        if (byte & (1 << k)) == 0 {
          *src_idx += 1;
          *prev = *non_repeats.add(*src_idx);
        }
        *dst_ptr.add(out_pos + k) = *prev;
      }
    }
  }
}

/// Expands repeat run-length bitmap into output buffer.
/// 将时序重复游程位图展开还原至输出缓冲区
///
/// # Safety
///
/// - `non_repeats` 必须指向包含全部非重复元素的连续有效内存。
/// - `dst_ptr` 必须指向至少具备 `count` 个连续可写 `F` 元素的有效内存。
/// - `bitmap` 必须至少包含 `(count + 7) / 8` 个字节。
#[inline]
pub(crate) unsafe fn expand_repeats<F: AlpFloat>(
  bitmap: &[u8],
  count: usize,
  non_repeats: *const F,
  dst_ptr: *mut F,
) {
  if count == 0 {
    return;
  }
  // SAFETY: 调用方保证 non_repeats 包含足够元素,dst_ptr 在 count 范围内连续可写,bitmap 长度充足
  unsafe {
    let mut src_idx = 0usize;
    let mut prev = *non_repeats;
    *dst_ptr = prev;

    let full_words = count / 64;
    let ptr_u64 = bitmap.as_ptr().cast::<u64>();

    for w in 0..full_words {
      let word = u64::from_le(ptr_u64.add(w).read_unaligned());
      let base_out = w * 64;

      if w == 0 {
        // Word 0: bit 0 is already stored as element 0
        for k in 1..8 {
          if (bitmap[0] & (1 << k)) == 0 {
            src_idx += 1;
            prev = *non_repeats.add(src_idx);
          }
          *dst_ptr.add(k) = prev;
        }
        #[allow(clippy::needless_range_loop)]
        for b in 1..8 {
          expand_byte(
            bitmap[b],
            b * 8,
            &mut src_idx,
            &mut prev,
            non_repeats,
            dst_ptr,
          );
        }
      } else if word == 0 {
        copy_nonoverlapping(non_repeats.add(src_idx + 1), dst_ptr.add(base_out), 64);
        src_idx += 64;
        prev = *dst_ptr.add(base_out + 63);
      } else if word == u64::MAX {
        for k in 0..64 {
          dst_ptr.add(base_out + k).write(prev);
        }
      } else {
        let bytes_ptr = bitmap.as_ptr().add(base_out / 8);
        for b in 0..8 {
          expand_byte(
            *bytes_ptr.add(b),
            base_out + b * 8,
            &mut src_idx,
            &mut prev,
            non_repeats,
            dst_ptr,
          );
        }
      }
    }

    let rem_start = full_words * 64;
    let start_j = if full_words == 0 { 1 } else { 0 };
    for i in (rem_start + start_j)..count {
      let byte_idx = i / 8;
      let bit_idx = i % 8;
      if (bitmap[byte_idx] & (1 << bit_idx)) != 0 {
        *dst_ptr.add(i) = prev;
      } else {
        src_idx += 1;
        prev = *non_repeats.add(src_idx);
        *dst_ptr.add(i) = prev;
      }
    }
  }
}

/// Decodes dictionary compressed chunk into destination buffer.
/// 解码紧凑字典压缩数据块至目标指针缓冲区
///
/// # Safety
///
/// `dst_ptr` 必须指向至少具备 `count` 个连续可写 `F` 元素的有效内存。
#[inline(always)]
unsafe fn decode_dict_raw<F: AlpFloat>(
  payload: &[u8],
  count: usize,
  dst_ptr: *mut F,
) -> Result<()> {
  if payload.len() < 2 {
    return Err(Error::UnexpectedEof {
      needed: 2,
      available: payload.len(),
    });
  }

  let dict_len = payload[0] as usize;
  let bit_width = payload[1];

  if dict_len == 0 || dict_len > MAX_DICT_ENTRIES || bit_width > 6 {
    return Err(Error::InvalidHeader);
  }

  let elem_size = size_of::<F>();
  let dict_bytes = dict_len * elem_size;
  if payload.len() < 2 + dict_bytes {
    return Err(Error::UnexpectedEof {
      needed: 2 + dict_bytes,
      available: payload.len(),
    });
  }

  let mut dict = [F::ZERO; MAX_DICT_ENTRIES];
  let dict_slice = &payload[2..2 + dict_bytes];
  for (entry, chunk) in dict.iter_mut().zip(dict_slice.chunks_exact(elem_size)) {
    *entry = F::read_raw(chunk);
  }
  if dict_len > 0 {
    let pad = dict[0];
    for entry in &mut dict[dict_len..MAX_DICT_ENTRIES] {
      *entry = pad;
    }
  }

  if bit_width == 0 {
    let single_val = dict[0];
    // SAFETY: 调用方保证 dst_ptr 具有至少 count 个连续有效可写槽位
    unsafe {
      for i in 0..count {
        dst_ptr.add(i).write(single_val);
      }
    }
    return Ok(());
  }

  let indices_offset = 2 + dict_bytes;
  let packed_bytes = packed_byte_size(count, bit_width);
  if payload.len() < indices_offset + packed_bytes {
    return Err(Error::UnexpectedEof {
      needed: indices_offset + packed_bytes,
      available: payload.len(),
    });
  }

  let decoder = AlpDictDecoder { dict: &dict };
  // SAFETY: 上方已校验 payload.len() >= indices_offset + packed_bytes,dst_ptr 具备 count 个有效槽位
  unsafe {
    bitunpack_core_generic(
      &payload[indices_offset..indices_offset + packed_bytes],
      count,
      bit_width,
      decoder,
      dst_ptr,
    );
  }

  Ok(())
}

/// Decodes Real Doubles (ALP-RD) compressed chunk into destination buffer.
/// 解码真实双精度高低位解耦(ALP-RD)压缩数据块至目标指针缓冲区
///
/// # Safety
///
/// `dst_ptr` 必须指向至少具备 `count` 个连续可写 `F` 元素的有效内存。
#[inline(always)]
unsafe fn decode_rd_raw<F: AlpFloat>(payload: &[u8], count: usize, dst_ptr: *mut F) -> Result<()> {
  if payload.len() < 5 {
    return Err(Error::UnexpectedEof {
      needed: 5,
      available: payload.len(),
    });
  }

  let right_bw = payload[0];
  let left_bw = payload[1];
  let actual_dict_size = payload[2] as usize;
  if actual_dict_size > 8 || right_bw == 0 || right_bw >= F::RD_TOTAL_BITS || left_bw > 3 {
    return Err(Error::InvalidHeader);
  }

  let exc_count = u16::from_le_bytes([payload[3], payload[4]]) as usize;

  let dict_bytes = actual_dict_size * 2;
  let mut cursor = 5;
  if payload.len() < cursor + dict_bytes {
    return Err(Error::UnexpectedEof {
      needed: cursor + dict_bytes,
      available: payload.len(),
    });
  }

  let mut dict = [0u16; 8];
  // SAFETY: 已校验 payload.len() >= cursor + dict_bytes 且 actual_dict_size <= 8,读取字典项不越界
  unsafe {
    let dict_ptr = payload.as_ptr().add(cursor).cast::<u16>();
    for (i, entry) in dict.iter_mut().take(actual_dict_size).enumerate() {
      *entry = u16::from_le(dict_ptr.add(i).read_unaligned());
    }
  }
  cursor += dict_bytes;

  let left_bytes = if left_bw > 0 {
    packed_byte_size(count, left_bw)
  } else {
    0
  };
  let right_bytes = packed_byte_size(count, right_bw);
  let exc_bytes = exc_count * 4;

  if payload.len() < cursor + left_bytes + right_bytes + exc_bytes {
    return Err(Error::UnexpectedEof {
      needed: cursor + left_bytes + right_bytes + exc_bytes,
      available: payload.len(),
    });
  }

  let shift = right_bw as u64;
  let mut shifted_dict = [0u64; 8];
  for (i, &entry) in dict.iter().take(actual_dict_size).enumerate() {
    shifted_dict[i] = (entry as u64) << shift;
  }

  let right_cursor = cursor + left_bytes;
  let exc_cursor = right_cursor + right_bytes;

  if left_bw == 0 {
    let decoder = AlpRdConstantDecoder {
      high_bits: shifted_dict[0],
      _phantom: PhantomData,
    };
    // SAFETY: 上方已前置校验 payload.len() >= right_cursor + right_bytes,dst_ptr 具备 count 个有效 F 槽位
    unsafe {
      bitunpack_core_generic(
        &payload[right_cursor..right_cursor + right_bytes],
        count,
        right_bw,
        decoder,
        dst_ptr,
      );
    }
  } else {
    let mut block_offset = 0;
    let mut cur_left_cursor = cursor;
    let mut cur_right_cursor = right_cursor;
    let mut left_buf = [0u64; 1024];
    let mut right_buf = [0u64; 1024];
    while block_offset < count {
      let cur_count = (count - block_offset).min(1024);
      let cur_left_bytes = packed_byte_size(cur_count, left_bw);
      let cur_right_bytes = packed_byte_size(cur_count, right_bw);

      bitunpack_u64_slice(
        &payload[cur_left_cursor..cur_left_cursor + cur_left_bytes],
        cur_count,
        left_bw,
        &mut left_buf[..cur_count],
      )?;
      cur_left_cursor += cur_left_bytes;

      if size_of::<F>() == 8 {
        // SAFETY: dst_ptr + block_offset has cur_count elements, for size_of 8, u64 layout is identical
        let dst_u64_ptr = unsafe { dst_ptr.add(block_offset).cast::<u64>() };
        unsafe {
          bitunpack_u64_raw(
            &payload[cur_right_cursor..cur_right_cursor + cur_right_bytes],
            cur_count,
            right_bw,
            dst_u64_ptr,
          )?;
        }
        cur_right_cursor += cur_right_bytes;

        let dst_u64 = unsafe { from_raw_parts_mut(dst_u64_ptr, cur_count) };
        let (dst_chunks, dst_rem) = dst_u64.as_chunks_mut::<8>();
        let (left_chunks, left_rem) = left_buf[..cur_count].as_chunks::<8>();
        for (dc, lc) in dst_chunks.iter_mut().zip(left_chunks.iter()) {
          unroll_8!(k => {
            dc[k] |= shifted_dict[lc[k] as usize & 7];
          });
        }
        for (d, l) in dst_rem.iter_mut().zip(left_rem.iter()) {
          *d |= shifted_dict[*l as usize & 7];
        }
      } else {
        bitunpack_u64_slice(
          &payload[cur_right_cursor..cur_right_cursor + cur_right_bytes],
          cur_count,
          right_bw,
          &mut right_buf[..cur_count],
        )?;
        cur_right_cursor += cur_right_bytes;

        unsafe {
          for i in 0..cur_count {
            *dst_ptr.add(block_offset + i) =
              F::from_u64_raw(shifted_dict[left_buf[i] as usize & 7] | right_buf[i]);
          }
        }
      }

      block_offset += cur_count;
    }
  }

  // SAFETY: 已校验 payload 长度覆盖至 exc_cursor + exc_bytes,read_unaligned 安全读取,
  // pos < count 严格校验确保 dst_ptr 写入不越界。
  unsafe {
    let exc_ptr = payload.as_ptr().add(exc_cursor);
    for i in 0..exc_count {
      let pos = u16::from_le(exc_ptr.add(i * 4).cast::<u16>().read_unaligned()) as usize;
      let left_val = u16::from_le(exc_ptr.add(i * 4 + 2).cast::<u16>().read_unaligned()) as u64;
      if pos >= count {
        return Err(Error::CorruptedData { index: pos, count });
      }
      let cur = (*dst_ptr.add(pos)).to_u64_key();
      let right = cur & ((1u64 << right_bw) - 1);
      let raw = (left_val << shift) | right;
      *dst_ptr.add(pos) = F::from_u64_raw(raw);
    }
  }

  Ok(())
}

/// Decompresses concrete chunk type directly into raw pointer memory without repeat expansion.
/// 解码具体块类型至裸指针内存(未展开时序重复行程)
///
/// # Safety
///
/// `dst_ptr` 必须指向至少具备 `count` 个连续可写 `F` 元素的有效内存。
#[inline(always)]
unsafe fn decompress_into_raw_direct<F: AlpFloat>(
  src: &[u8],
  cursor: usize,
  type_byte: u8,
  count: usize,
  params: Option<AlpParams>,
  dst_ptr: *mut F,
) -> Result<()> {
  if type_byte == F::TYPE_RAW_BYTE {
    let raw_bytes_needed = count
      .checked_mul(size_of::<F>())
      .ok_or(Error::InvalidHeader)?;
    if src.len() < cursor + raw_bytes_needed {
      return Err(Error::UnexpectedEof {
        needed: cursor + raw_bytes_needed,
        available: src.len(),
      });
    }
    // SAFETY: 上方已校验可用字节充足,dst_ptr 具备 count 个有效 F 空间,字节大小匹配
    unsafe {
      copy_nonoverlapping(
        src.as_ptr().add(cursor),
        dst_ptr.cast::<u8>(),
        raw_bytes_needed,
      );
    }
    return Ok(());
  }

  if type_byte == F::TYPE_DICT_BYTE {
    // SAFETY: 调用方保证 dst_ptr 具有至少 count 个连续可写槽位
    unsafe {
      decode_dict_raw::<F>(&src[cursor..], count, dst_ptr)?;
    }
    return Ok(());
  }

  if type_byte == F::TYPE_RD_BYTE {
    // SAFETY: 调用方保证 dst_ptr 具有至少 count 个连续可写槽位
    unsafe {
      decode_rd_raw::<F>(&src[cursor..], count, dst_ptr)?;
    }
    return Ok(());
  }

  let is_delta = type_byte == F::TYPE_DELTA_BYTE || type_byte == F::TYPE_DEC_DELTA_BYTE;
  let is_standard = type_byte == F::TYPE_BYTE || type_byte == F::TYPE_DEC_BYTE;

  if !is_standard && !is_delta {
    return Err(Error::InvalidHeader);
  }

  let alp_params = match params {
    Some(p) => p,
    None => return Err(Error::InvalidHeader),
  };

  if !alp_params.validate::<F>() {
    return Err(Error::UnsupportedParams {
      exp: alp_params.exp,
      fac: alp_params.fac,
      bit_width: alp_params.bit_width,
    });
  }

  let payload = &src[cursor..];
  if is_delta {
    // SAFETY: 调用方保证 dst_ptr 具有至少 count 个连续可写槽位
    unsafe {
      decode_delta_raw::<F>(payload, count, alp_params, dst_ptr)?;
    }
  } else {
    // SAFETY: 调用方保证 dst_ptr 具有至少 count 个连续可写槽位
    unsafe {
      decode_standard_raw::<F>(payload, count, alp_params, dst_ptr)?;
    }
  }
  Ok(())
}

/// Generic floating-point decompression directly into raw pointer memory.
/// 通用解压浮点数组至裸指针内存(零堆分配、零内存拷贝,避免未初始化切片构造)
///
/// # Safety
///
/// `dst_ptr` 必须指向至少具备 `dst_cap` 个连续可写 `F` 元素的有效内存。
pub unsafe fn decompress_into_raw<F: AlpFloat>(
  src: &[u8],
  dst_ptr: *mut F,
  dst_cap: usize,
) -> Result<usize> {
  let ParsedHeader {
    type_byte,
    count,
    params,
    mut cursor,
    has_repeat,
    ..
  } = read_header(src)?;

  if count == 0 {
    return Ok(0);
  }

  if dst_cap < count {
    return Err(Error::BufferTooSmall {
      needed: count,
      available: dst_cap,
    });
  }

  if !has_repeat {
    // SAFETY: dst_cap >= count 已校验,dst_ptr 在 count 范围内连续有效
    unsafe {
      decompress_into_raw_direct::<F>(src, cursor, type_byte, count, params, dst_ptr)?;
    }
    return Ok(count);
  }

  let bitmap_len = count.div_ceil(8);
  if src.len() < cursor + bitmap_len {
    return Err(Error::UnexpectedEof {
      needed: cursor + bitmap_len,
      available: src.len(),
    });
  }
  let bitmap = &src[cursor..cursor + bitmap_len];
  cursor += bitmap_len;

  let repeats = count_bitmap_ones(bitmap, count);
  let non_repeat_count = count - repeats;
  if non_repeat_count == 0 {
    return Err(Error::InvalidHeader);
  }

  let mut stack_buf = MaybeUninit::<[F; 1024]>::uninit();
  let mut heap_buf: Vec<F> = Vec::new();
  let tmp_ptr: *mut F = if non_repeat_count <= 1024 {
    stack_buf.as_mut_ptr().cast::<F>()
  } else {
    heap_buf.reserve(non_repeat_count);
    heap_buf.as_mut_ptr()
  };

  // SAFETY: tmp_ptr 指向至少 non_repeat_count 个连续有效 F 空间,dst_ptr 在 count 范围内有效,bitmap 已校验
  unsafe {
    decompress_into_raw_direct::<F>(src, cursor, type_byte, non_repeat_count, params, tmp_ptr)?;
    expand_repeats::<F>(bitmap, count, tmp_ptr, dst_ptr);
  }

  Ok(count)
}

/// Generic floating-point decompression into destination slice.
/// 通用解压浮点数组至目标切片(零堆分配、零内存拷贝)
#[inline(always)]
pub fn decompress_into_slice<F: AlpFloat>(src: &[u8], dst: &mut [F]) -> Result<usize> {
  // SAFETY: dst.as_mut_ptr() 指向 dst.len() 个有效连续元素,契约完全满足
  unsafe { decompress_into_raw(src, dst.as_mut_ptr(), dst.len()) }
}

/// Generic floating-point decompression into `dst` buffer.
/// 通用解压浮点数组至 `dst` 缓冲区(自动分发 RAW、标准 FOR 与 Delta 差分块)
pub fn decompress_into<F: AlpFloat>(src: &[u8], dst: &mut Vec<F>) -> Result<()> {
  let count = read_count(src)?;
  if count == 0 {
    return Ok(());
  }
  let old_len = dst.len();
  dst.reserve(count);
  // SAFETY: dst has reserved count slots, decompress_into_raw writes directly to pointer,
  // initializes count elements before updating Vec len. Never constructs uninitialized slice.
  // SAFETY: dst 已预留 count 个空间,decompress_into_raw 直接写入裸指针,
  // 严格初始化 count 个元素后安全更新 Vec 长度。绝不构造未初始化内存的切片引用。
  unsafe {
    let written = decompress_into_raw(src, dst.as_mut_ptr().add(old_len), count)?;
    dst.set_len(old_len + written);
  }
  Ok(())
}

/// Generic floating-point slice decompression.
/// 通用解压浮点数切片
#[inline]
pub fn decompress<F: AlpFloat>(src: &[u8]) -> Result<Vec<F>> {
  let mut dst = Vec::new();
  decompress_into(src, &mut dst)?;
  Ok(dst)
}

/// Patches exceptions into decoded buffer directly using raw pointer.
/// 将异常值字典打补丁至解码缓冲区(统一处理普通 u16 与超大数组 u32 格式,严格校验内存边界)
///
/// # Safety
///
/// `dst_ptr` 必须指向至少具备 `count` 个有效 `F` 元素的内存空间。
#[inline]
pub(crate) unsafe fn patch_exceptions<F: AlpFloat>(
  src: &[u8],
  count: usize,
  dst_ptr: *mut F,
) -> Result<()> {
  if src.is_empty() {
    return Ok(());
  }

  let mut cursor = 0;
  let is_large = count > u16::MAX as usize;
  let (exc_count, exc_count_len) = if is_large {
    if src.len() < cursor + EXC_COUNT_LEN_U32 {
      return Err(Error::UnexpectedEof {
        needed: cursor + EXC_COUNT_LEN_U32,
        available: src.len(),
      });
    }
    let c = u32::from_le_bytes(
      src[cursor..cursor + 4]
        .try_into()
        .map_err(|_| Error::InvalidHeader)?,
    ) as usize;
    (c, EXC_COUNT_LEN_U32)
  } else {
    if src.len() < cursor + EXC_COUNT_LEN {
      return Err(Error::UnexpectedEof {
        needed: cursor + EXC_COUNT_LEN,
        available: src.len(),
      });
    }
    let c = u16::from_le_bytes([src[cursor], src[cursor + 1]]) as usize;
    (c, EXC_COUNT_LEN)
  };
  cursor += exc_count_len;

  let entry_size = if is_large {
    F::EXC_ENTRY_SIZE_U32
  } else {
    F::EXC_ENTRY_SIZE
  };
  let exc_bytes_needed = exc_count
    .checked_mul(entry_size)
    .ok_or(Error::InvalidHeader)?;
  if src.len() < cursor + exc_bytes_needed {
    return Err(Error::UnexpectedEof {
      needed: cursor + exc_bytes_needed,
      available: src.len(),
    });
  }

  let exc_slice = &src[cursor..cursor + exc_bytes_needed];
  if is_large {
    for chunk in exc_slice.chunks_exact(entry_size) {
      let (pos, val) = F::read_exception_u32(chunk);
      if pos >= count {
        return Err(Error::CorruptedData { index: pos, count });
      }
      // SAFETY: pos < count verified above, and caller guarantees dst_ptr is valid for count elements
      // SAFETY: 上方已校验 pos < count,且调用方保证 count 范围内指针有效
      unsafe {
        *dst_ptr.add(pos) = val;
      }
    }
  } else {
    for chunk in exc_slice.chunks_exact(entry_size) {
      let (pos, val) = F::read_exception(chunk);
      if pos >= count {
        return Err(Error::CorruptedData { index: pos, count });
      }
      // SAFETY: pos < count verified above, and caller guarantees dst_ptr is valid for count elements
      // SAFETY: 上方已校验 pos < count,且调用方保证 count 范围内指针有效
      unsafe {
        *dst_ptr.add(pos) = val;
      }
    }
  }

  Ok(())
}