decimal-scaled 0.4.1

Const-generic base-10 fixed-point decimals (D9/D18/D38/D76/D153/D307) with integer-only transcendentals correctly rounded to within 0.5 ULP — exact at the type's last representable place. Deterministic across every platform; no_std-friendly.
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
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
//! `num-traits` 0.2 trait implementations for [`D38`].
//!
//! Allows generic numeric code (nalgebra, ndarray, statrs, and other
//! crates that accept "any number type") to use `D38<SCALE>` as a
//! scalar. Crates that provide generic numeric algorithms almost
//! universally bound on [`num_traits`] traits rather than defining
//! their own numeric interfaces.
//!
//! # Trait coverage
//!
//! - [`num_traits::Zero`] / [`num_traits::One`] — additive and
//! multiplicative identities.
//! - [`num_traits::Num`] — umbrella numeric trait combining
//! `Zero + One + PartialEq + Add + Sub + Mul + Div + Rem` with a
//! `from_str_radix` constructor.
//! - [`num_traits::Bounded`] — `min_value()` / `max_value()` for
//! generic clamping code.
//! - [`num_traits::Signed`] — `abs`, `signum`, `is_positive`,
//! `is_negative`, `abs_sub`.
//! - [`num_traits::FromPrimitive`] / [`num_traits::ToPrimitive`] —
//! fallible conversions to and from the primitive numeric types.
//! - [`num_traits::CheckedAdd`] / [`num_traits::CheckedSub`] /
//! [`num_traits::CheckedMul`] / [`num_traits::CheckedDiv`] /
//! [`num_traits::CheckedRem`] / [`num_traits::CheckedNeg`] —
//! overflow-safe variants returning `Option<Self>`.
//!
//! # `from_str_radix`
//!
//! [`num_traits::Num::from_str_radix`] delegates to
//! [`core::str::FromStr`] for `radix == 10` and rejects every other
//! radix. The compile-time signature is stable regardless of whether
//! the underlying `FromStr` implementation is complete.
//!
//! # `CheckedMul` / `CheckedDiv`
//!
//! Both traits delegate to the inherent [`D38::checked_mul`] and
//! [`D38::checked_div`] methods. The trait and inherent paths are
//! bit-identical. `CheckedAdd`, `CheckedSub`, `CheckedRem`, and
//! `CheckedNeg` operate directly on the raw `i128` storage and
//! delegate to `i128`'s own checked intrinsics; no rescaling is
//! needed for those operations.

// `FromPrimitive` / `ToPrimitive` / `NumCast` for every decimal
// width are emitted by `decl_decimal_num_traits_conversions!` (see
// `src/macros/num_traits.rs` and the per-width invocations in
// `core_type.rs`). This file keeps only the test module.

use decimal_scaled::{D38, D38s12};
    // Zero / One / Num / Bounded / Signed / Checked* are emitted for
    // D38 by `decl_decimal_num_traits_basics!`; FromPrimitive /
    // ToPrimitive / NumCast stay hand-coded in this module. The tests
    // exercise the whole surface, so the traits are imported directly.
use num_traits::{
    Bounded, CheckedAdd, CheckedDiv, CheckedMul, CheckedNeg, CheckedRem, CheckedSub,
    FromPrimitive, Num, NumCast, One, Signed, ToPrimitive, Zero,
};

// ---------------------------------------------------------------------------
    // Zero / One
// ---------------------------------------------------------------------------

#[test]
fn zero_is_zero_const() {
    assert_eq!(<D38s12 as Zero>::zero(), D38s12::ZERO);
}

#[test]
fn zero_is_zero_predicate() {
    assert!(<D38s12 as Zero>::is_zero(&D38s12::ZERO));
    assert!(!<D38s12 as Zero>::is_zero(&D38s12::ONE));
    assert!(!<D38s12 as Zero>::is_zero(&D38s12::from_bits(1)));
}

#[test]
fn one_is_one_const() {
    assert_eq!(<D38s12 as One>::one(), D38s12::ONE);
}

#[test]
fn one_is_one_predicate() {
    assert!(<D38s12 as One>::is_one(&D38s12::ONE));
    assert!(!<D38s12 as One>::is_one(&D38s12::ZERO));
    // A non-canonical raw value (1 LSB) is not "one".
    assert!(!<D38s12 as One>::is_one(&D38s12::from_bits(1)));
}

// ---------------------------------------------------------------------------
    // Bounded
// ---------------------------------------------------------------------------

#[test]
fn bounded_min_max() {
    assert_eq!(<D38s12 as Bounded>::min_value(), D38s12::MIN);
    assert_eq!(<D38s12 as Bounded>::max_value(), D38s12::MAX);
}

// ---------------------------------------------------------------------------
    // Signed
// ---------------------------------------------------------------------------

#[test]
fn signed_abs_basic() {
    let pos = D38s12::from_bits(1_500_000_000_000);
    let neg = D38s12::from_bits(-1_500_000_000_000);
    assert_eq!(<D38s12 as Signed>::abs(&pos), pos);
    assert_eq!(<D38s12 as Signed>::abs(&neg), pos);
    assert_eq!(<D38s12 as Signed>::abs(&D38s12::ZERO), D38s12::ZERO);
}

#[test]
fn signed_signum_basic() {
    let pos = D38s12::from_bits(1_500_000_000_000);
    let neg = D38s12::from_bits(-1_500_000_000_000);
    assert_eq!(<D38s12 as Signed>::signum(&pos), D38s12::ONE);
    assert_eq!(<D38s12 as Signed>::signum(&neg), -D38s12::ONE);
    assert_eq!(<D38s12 as Signed>::signum(&D38s12::ZERO), D38s12::ZERO);
}

#[test]
fn signed_is_positive_negative() {
    let pos = D38s12::from_bits(1_500_000_000_000);
    let neg = D38s12::from_bits(-1_500_000_000_000);
    assert!(<D38s12 as Signed>::is_positive(&pos));
    assert!(!<D38s12 as Signed>::is_positive(&neg));
    assert!(!<D38s12 as Signed>::is_positive(&D38s12::ZERO));

    assert!(!<D38s12 as Signed>::is_negative(&pos));
    assert!(<D38s12 as Signed>::is_negative(&neg));
    assert!(!<D38s12 as Signed>::is_negative(&D38s12::ZERO));
}

    /// `abs_sub(a, b)` clamps to zero when `a <= b`.
#[test]
fn signed_abs_sub_clamps_to_zero() {
    let two = D38s12::from_bits(2_000_000_000_000);
    let five = D38s12::from_bits(5_000_000_000_000);

    // 5 - 2 = 3 (positive case)
    let three = D38s12::from_bits(3_000_000_000_000);
    assert_eq!(<D38s12 as Signed>::abs_sub(&five, &two), three);

    // 2 - 5 clamps to ZERO (a <= b)
    assert_eq!(<D38s12 as Signed>::abs_sub(&two, &five), D38s12::ZERO);

    // 5 - 5 = ZERO (equal inputs)
    assert_eq!(<D38s12 as Signed>::abs_sub(&five, &five), D38s12::ZERO);
}

// ---------------------------------------------------------------------------
    // FromPrimitive
// ---------------------------------------------------------------------------

#[test]
fn from_primitive_i64_in_range() {
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i64(0),
        Some(D38s12::ZERO)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i64(1),
        Some(D38s12::ONE)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i64(42),
        Some(D38s12::from_bits(42_000_000_000_000))
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i64(-42),
        Some(D38s12::from_bits(-42_000_000_000_000))
    );
}

#[test]
fn from_primitive_u64_in_range() {
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u64(0),
        Some(D38s12::ZERO)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u64(42),
        Some(D38s12::from_bits(42_000_000_000_000))
    );
    // u64::MAX * 10^12 fits in i128, so this succeeds.
    let large = <D38s12 as FromPrimitive>::from_u64(u64::MAX);
    assert!(large.is_some());
}

#[test]
fn from_primitive_i128_overflow_returns_none() {
    // i128::MAX cannot be scaled by 10^12 — TryFrom returns Err,
    // FromPrimitive surfaces that as None.
    assert_eq!(<D38s12 as FromPrimitive>::from_i128(i128::MAX), None);
    assert_eq!(<D38s12 as FromPrimitive>::from_i128(i128::MIN), None);

    // Small values succeed.
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i128(7),
        Some(D38s12::from_bits(7_000_000_000_000))
    );
}

#[test]
fn from_primitive_u128_overflow_returns_none() {
    // u128::MAX > i128::MAX — the first try_from step fails.
    assert_eq!(<D38s12 as FromPrimitive>::from_u128(u128::MAX), None);

    // Small values succeed.
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u128(99),
        Some(D38s12::from_bits(99_000_000_000_000))
    );
}

#[test]
fn from_primitive_f32_basic() {
    assert_eq!(
        <D38s12 as FromPrimitive>::from_f32(0.0),
        Some(D38s12::ZERO)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_f32(1.0),
        Some(D38s12::ONE)
    );
    // Non-finite inputs return None.
    assert_eq!(<D38s12 as FromPrimitive>::from_f32(f32::NAN), None);
    assert_eq!(<D38s12 as FromPrimitive>::from_f32(f32::INFINITY), None);
    assert_eq!(<D38s12 as FromPrimitive>::from_f32(f32::NEG_INFINITY), None);
}

#[test]
fn from_primitive_f64_basic() {
    assert_eq!(
        <D38s12 as FromPrimitive>::from_f64(0.0),
        Some(D38s12::ZERO)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_f64(1.0),
        Some(D38s12::ONE)
    );
    // Use a value that is not close to any well-known math constant
    // so the approx_constant lint stays quiet.
    let v = <D38s12 as FromPrimitive>::from_f64(1.234567890123_f64);
    assert!(v.is_some());

    // Non-finite inputs return None.
    assert_eq!(<D38s12 as FromPrimitive>::from_f64(f64::NAN), None);
    assert_eq!(<D38s12 as FromPrimitive>::from_f64(f64::INFINITY), None);

    // Finite but out-of-range: 1e30 * 10^12 = 1e42 > i128::MAX.
    assert_eq!(<D38s12 as FromPrimitive>::from_f64(1e30), None);
}

    /// `FromPrimitive` provides default impls for `from_i32`, `from_u32`, etc.
    /// via `from_i64` / `from_u64`. Verify the delegation chain works.
#[test]
fn from_primitive_smaller_int_types_via_default_impl() {
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i32(7),
        Some(D38s12::from_bits(7_000_000_000_000))
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i16(-3),
        Some(D38s12::from_bits(-3_000_000_000_000))
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_i8(0),
        Some(D38s12::ZERO)
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u32(7),
        Some(D38s12::from_bits(7_000_000_000_000))
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u16(3),
        Some(D38s12::from_bits(3_000_000_000_000))
    );
    assert_eq!(
        <D38s12 as FromPrimitive>::from_u8(255),
        Some(D38s12::from_bits(255_000_000_000_000))
    );
}

// ---------------------------------------------------------------------------
    // ToPrimitive
// ---------------------------------------------------------------------------

#[test]
fn to_primitive_i64_in_range() {
    let v = D38s12::from_bits(42_000_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&v), Some(42_i64));

    let neg = D38s12::from_bits(-42_000_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&neg), Some(-42_i64));

    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&D38s12::ZERO), Some(0_i64));
}

#[test]
fn to_primitive_i64_truncates_toward_zero() {
    // 2.5 truncates to 2
    let v = D38s12::from_bits(2_500_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&v), Some(2_i64));

    // -2.5 truncates to -2 (toward zero, not toward -inf)
    let neg = D38s12::from_bits(-2_500_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&neg), Some(-2_i64));
}

#[test]
fn to_primitive_i64_out_of_range_returns_none() {
    // D38::MAX integer part ~= 1.7e26, which exceeds i64::MAX.
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&D38s12::MAX), None);
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&D38s12::MIN), None);
}

#[test]
fn to_primitive_u64_negative_returns_none() {
    let neg = D38s12::from_bits(-1_000_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_u64(&neg), None);
}

#[test]
fn to_primitive_u64_in_range() {
    let v = D38s12::from_bits(42_000_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_u64(&v), Some(42_u64));

    assert_eq!(<D38s12 as ToPrimitive>::to_u64(&D38s12::ZERO), Some(0_u64));
}

#[test]
fn to_primitive_i128_always_succeeds() {
    // Even MAX and MIN succeed because the integer part is bounded
    // by i128::MAX / 10^12, which is well within i128.
    assert!(<D38s12 as ToPrimitive>::to_i128(&D38s12::MAX).is_some());
    assert!(<D38s12 as ToPrimitive>::to_i128(&D38s12::MIN).is_some());
    assert_eq!(
        <D38s12 as ToPrimitive>::to_i128(&D38s12::ZERO),
        Some(0_i128)
    );
    assert_eq!(
        <D38s12 as ToPrimitive>::to_i128(&D38s12::from_bits(42_000_000_000_000)),
        Some(42_i128)
    );
}

#[test]
fn to_primitive_u128_negative_returns_none() {
    assert_eq!(
        <D38s12 as ToPrimitive>::to_u128(&D38s12::from_bits(-1)),
        None
    );
}

#[test]
fn to_primitive_u128_in_range() {
    assert_eq!(
        <D38s12 as ToPrimitive>::to_u128(&D38s12::ZERO),
        Some(0_u128)
    );
    assert_eq!(
        <D38s12 as ToPrimitive>::to_u128(&D38s12::from_bits(99_000_000_000_000)),
        Some(99_u128)
    );
}

#[test]
fn to_primitive_f64_round_trip_within_lsb() {
    let lsb = 1.0 / (D38s12::multiplier() as f64);
    // Use a value not close to any well-known math constant.
    let v = D38s12::from_f64(1.234567890123_f64);
    let back = <D38s12 as ToPrimitive>::to_f64(&v).expect("to_f64 always returns Some");
    assert!(
        (back - 1.234567890123_f64).abs() <= lsb * 2.0,
        "round-trip exceeded 2 LSB: back = {back}, lsb = {lsb}"
    );
}

#[test]
fn to_primitive_f32_matches_to_f32_lossy() {
    let v = D38s12::from_bits(1_500_000_000_000);
    assert_eq!(
        <D38s12 as ToPrimitive>::to_f32(&v),
        Some(v.to_f32())
    );
}

    /// `ToPrimitive` provides default impls for `to_i32`, `to_u32`, etc.
    /// via `to_i64` / `to_u64`. Verify the delegation chain works.
#[test]
fn to_primitive_smaller_int_types_via_default_impl() {
    let v = D38s12::from_bits(42_000_000_000_000);
    assert_eq!(<D38s12 as ToPrimitive>::to_i32(&v), Some(42_i32));
    assert_eq!(<D38s12 as ToPrimitive>::to_u32(&v), Some(42_u32));
    assert_eq!(<D38s12 as ToPrimitive>::to_i16(&v), Some(42_i16));
    assert_eq!(<D38s12 as ToPrimitive>::to_u16(&v), Some(42_u16));
    assert_eq!(<D38s12 as ToPrimitive>::to_i8(&v), Some(42_i8));
    assert_eq!(<D38s12 as ToPrimitive>::to_u8(&v), Some(42_u8));

    // Out-of-range narrowing returns None.
    let big = D38s12::from_bits(40_000_000_000_000_000); // 40_000
    assert_eq!(<D38s12 as ToPrimitive>::to_i8(&big), None);
    assert_eq!(<D38s12 as ToPrimitive>::to_u8(&big), None);
}

// ---------------------------------------------------------------------------
    // CheckedAdd / CheckedSub
// ---------------------------------------------------------------------------

#[test]
fn checked_add_basic() {
    let one = D38s12::ONE;
    let two = D38s12::from_bits(2_000_000_000_000);
    assert_eq!(
        <D38s12 as CheckedAdd>::checked_add(&one, &one),
        Some(two)
    );
}

#[test]
fn checked_add_overflow_returns_none() {
    // MAX + ONE overflows.
    assert_eq!(
        <D38s12 as CheckedAdd>::checked_add(&D38s12::MAX, &D38s12::ONE),
        None
    );
    // MAX + ZERO is fine.
    assert_eq!(
        <D38s12 as CheckedAdd>::checked_add(&D38s12::MAX, &D38s12::ZERO),
        Some(D38s12::MAX)
    );
}

#[test]
fn checked_sub_basic() {
    let three = D38s12::from_bits(3_000_000_000_000);
    let two = D38s12::from_bits(2_000_000_000_000);
    assert_eq!(
        <D38s12 as CheckedSub>::checked_sub(&three, &two),
        Some(D38s12::ONE)
    );
}

#[test]
fn checked_sub_underflow_returns_none() {
    // MIN - ONE underflows.
    assert_eq!(
        <D38s12 as CheckedSub>::checked_sub(&D38s12::MIN, &D38s12::ONE),
        None
    );
}

// ---------------------------------------------------------------------------
    // CheckedMul / CheckedDiv / CheckedRem
// ---------------------------------------------------------------------------

#[test]
fn checked_mul_basic() {
    let half = D38s12::from_bits(500_000_000_000); // 0.5
    let quarter = D38s12::from_bits(250_000_000_000); // 0.25
    assert_eq!(
        <D38s12 as CheckedMul>::checked_mul(&half, &half),
        Some(quarter)
    );
}

#[test]
fn checked_mul_overflow_returns_none() {
    // MAX * 2 overflows.
    let two = D38s12::from_bits(2_000_000_000_000);
    assert_eq!(
        <D38s12 as CheckedMul>::checked_mul(&D38s12::MAX, &two),
        None
    );
}

#[test]
fn checked_div_basic() {
    let half = D38s12::from_bits(500_000_000_000); // 0.5
    let quarter = D38s12::from_bits(250_000_000_000); // 0.25
    let two = D38s12::from_bits(2_000_000_000_000); // 2.0
    // 0.5 / 2.0 == 0.25
    assert_eq!(
        <D38s12 as CheckedDiv>::checked_div(&half, &two),
        Some(quarter)
    );
}

#[test]
fn checked_div_by_zero_returns_none() {
    assert_eq!(
        <D38s12 as CheckedDiv>::checked_div(&D38s12::ONE, &D38s12::ZERO),
        None
    );
}

#[test]
fn checked_div_overflow_returns_none() {
    // The only true checked_div overflow is MIN / -ONE (negating i128::MIN
    // overflows in two's-complement).
    let neg_one = -D38s12::ONE;
    assert_eq!(
        <D38s12 as CheckedDiv>::checked_div(&D38s12::MIN, &neg_one),
        None
    );
    // MAX / ONE returns Some(MAX) via the widening path.
    assert_eq!(
        <D38s12 as CheckedDiv>::checked_div(&D38s12::MAX, &D38s12::ONE),
        Some(D38s12::MAX)
    );
}

#[test]
fn checked_rem_basic() {
    let a = D38s12::from_bits(5_500_000_000_000); // 5.5
    let b = D38s12::from_bits(2_000_000_000_000); // 2.0
    let expected = D38s12::from_bits(1_500_000_000_000); // 1.5
    assert_eq!(
        <D38s12 as CheckedRem>::checked_rem(&a, &b),
        Some(expected)
    );
}

#[test]
fn checked_rem_by_zero_returns_none() {
    assert_eq!(
        <D38s12 as CheckedRem>::checked_rem(&D38s12::ONE, &D38s12::ZERO),
        None
    );
}

// ---------------------------------------------------------------------------
    // CheckedNeg
// ---------------------------------------------------------------------------

#[test]
fn checked_neg_basic() {
    let one = D38s12::ONE;
    let neg_one = -D38s12::ONE;
    assert_eq!(
        <D38s12 as CheckedNeg>::checked_neg(&one),
        Some(neg_one)
    );
    assert_eq!(
        <D38s12 as CheckedNeg>::checked_neg(&D38s12::ZERO),
        Some(D38s12::ZERO)
    );
}

#[test]
fn checked_neg_min_returns_none() {
    // i128::MIN has no positive counterpart, so checked_neg returns None.
    assert_eq!(
        <D38s12 as CheckedNeg>::checked_neg(&D38s12::MIN),
        None
    );
}

// ---------------------------------------------------------------------------
    // CheckedMul / CheckedDiv trait-vs-inherent alignment
// ---------------------------------------------------------------------------
    //
    // Assert that the num-traits trait impls and the inherent methods
    // produce bit-identical results for 256 deterministic pairs plus
    // boundary cases. A failure here means the two paths diverged.

    /// Generates a deterministic sequence of `i128` values using a
    /// linear congruential generator seeded from `seed`.
fn lcg_i128_seq(seed: i128, n: usize) -> Vec<i128> {
    // LCG constants from Knuth TAOCP Vol 2 (applied in i128 with wrapping).
    let mut state: i128 = seed;
    let mut out = Vec::with_capacity(n);
    for _ in 0..n {
        state = state
            .wrapping_mul(6_364_136_223_846_793_005_i128)
            .wrapping_add(1_442_695_040_888_963_407_i128);
        out.push(state);
    }
    out
}

    /// For 256 deterministic pairs, `<D38 as CheckedMul>::checked_mul`
    /// must equal `D38::checked_mul` (the inherent method).
#[test]
fn checked_mul_trait_matches_inherent_256_pairs() {
    let seeds = lcg_i128_seq(0x1234_5678_9ABC_DEF0, 512);
    for pair in seeds.chunks_exact(2) {
        let a = D38s12::from_bits(pair[0]);
        let b = D38s12::from_bits(pair[1]);
        let trait_result = <D38s12 as CheckedMul>::checked_mul(&a, &b);
        let inherent_result = a.checked_mul(b);
        assert_eq!(
            trait_result, inherent_result,
            "CheckedMul trait != inherent for a={a:?} b={b:?}"
        );
    }
}

    /// For 256 deterministic pairs, `<D38 as CheckedDiv>::checked_div`
    /// must equal `D38::checked_div` (the inherent method).
#[test]
fn checked_div_trait_matches_inherent_256_pairs() {
    let seeds = lcg_i128_seq(0xDEAD_BEEF_CAFE_0001, 512);
    for pair in seeds.chunks_exact(2) {
        let a = D38s12::from_bits(pair[0]);
        // Avoid divide-by-zero: if the LCG lands on zero, substitute ONE.
        // The by-zero case is covered by a dedicated test.
        let b_bits = if pair[1] == 0 { D38s12::multiplier() } else { pair[1] };
        let b = D38s12::from_bits(b_bits);
        let trait_result = <D38s12 as CheckedDiv>::checked_div(&a, &b);
        let inherent_result = a.checked_div(b);
        assert_eq!(
            trait_result, inherent_result,
            "CheckedDiv trait != inherent for a={a:?} b={b:?}"
        );
    }
}

    /// Boundary cases for CheckedMul trait-vs-inherent alignment.
#[test]
fn checked_mul_trait_matches_inherent_boundary() {
    let cases: &[(D38s12, D38s12)] = &[
        (D38s12::MAX, D38s12::ZERO),
        (D38s12::MIN, D38s12::ZERO),
        (D38s12::MAX, D38s12::ONE),
        (D38s12::MIN, D38s12::ONE),
        (D38s12::MAX, D38s12::MAX),
        (D38s12::MIN, D38s12::MIN),
        (D38s12::from_bits(0), D38s12::from_bits(0)),
        (D38s12::from_bits(1), D38s12::from_bits(1)),
        (D38s12::from_bits(-1), D38s12::from_bits(1)),
        (D38s12::from_bits(1), D38s12::from_bits(-1)),
        (D38s12::from_bits(-1), D38s12::from_bits(-1)),
    ];
    for &(a, b) in cases {
        let trait_result = <D38s12 as CheckedMul>::checked_mul(&a, &b);
        let inherent_result = a.checked_mul(b);
        assert_eq!(
            trait_result, inherent_result,
            "CheckedMul trait != inherent at boundary a={a:?} b={b:?}"
        );
    }
}

    /// Boundary cases for CheckedDiv trait-vs-inherent alignment.
#[test]
fn checked_div_trait_matches_inherent_boundary() {
    let neg_one = -D38s12::ONE;
    let cases: &[(D38s12, D38s12)] = &[
        (D38s12::MAX, D38s12::ONE),
        (D38s12::MIN, D38s12::ONE),
        (D38s12::MAX, D38s12::MAX),
        (D38s12::MIN, D38s12::MIN),
        (D38s12::ZERO, D38s12::ONE),
        (D38s12::ONE, D38s12::MAX),
        // divide by zero — both must return None
        (D38s12::ONE, D38s12::ZERO),
        (D38s12::MAX, D38s12::ZERO),
        // true overflow case: MIN / -ONE
        (D38s12::MIN, neg_one),
        (D38s12::from_bits(1), D38s12::from_bits(1)),
        (D38s12::from_bits(-1), D38s12::from_bits(1)),
        (D38s12::from_bits(1), D38s12::from_bits(-1)),
        (D38s12::from_bits(-1), D38s12::from_bits(-1)),
    ];
    for &(a, b) in cases {
        let trait_result = <D38s12 as CheckedDiv>::checked_div(&a, &b);
        let inherent_result = a.checked_div(b);
        assert_eq!(
            trait_result, inherent_result,
            "CheckedDiv trait != inherent at boundary a={a:?} b={b:?}"
        );
    }
}

// ---------------------------------------------------------------------------
    // Num::from_str_radix
// ---------------------------------------------------------------------------

    /// Non-base-10 radix is rejected without delegating to FromStr.
#[test]
fn from_str_radix_non_ten_returns_invalid() {
    let result = <D38s12 as Num>::from_str_radix("1", 16);
    assert!(result.is_err());

    let result_2 = <D38s12 as Num>::from_str_radix("1", 2);
    assert!(result_2.is_err());
}

    /// Base-10 delegates to the FromStr implementation.
#[test]
fn from_str_radix_base_ten_delegates_to_from_str() {
    let parsed = <D38s12 as Num>::from_str_radix("1", 10).expect("parse 1");
    assert_eq!(parsed, D38s12::ONE);
}

// ---------------------------------------------------------------------------
    // Cross-scale exercise — non-default SCALE
// ---------------------------------------------------------------------------

    /// At SCALE = 6 the trait surface works correctly.
#[test]
fn traits_compile_at_scale_6() {
    type D6 = D38<6>;
    assert_eq!(<D6 as Zero>::zero(), D6::ZERO);
    assert_eq!(<D6 as One>::one(), D6::ONE);
    assert_eq!(<D6 as Bounded>::min_value(), D6::MIN);
    assert_eq!(<D6 as Bounded>::max_value(), D6::MAX);

    let v: D6 = <D6 as FromPrimitive>::from_i64(42).unwrap();
    assert_eq!(<D6 as ToPrimitive>::to_i64(&v), Some(42_i64));
}

// ---------------------------------------------------------------------------
    // NumCast
// ---------------------------------------------------------------------------

    /// `NumCast::from` round-trips an in-range `i32` exactly.
#[test]
fn numcast_from_i32() {
    let v: D38s12 = <D38s12 as NumCast>::from(42_i32).expect("in-range");
    assert_eq!(v, <D38s12 as From<i32>>::from(42_i32));
}

    /// `NumCast::from` preserves the fractional part of an `f64` input
    /// because the float path runs before the integer truncation path.
#[test]
fn numcast_from_f64_preserves_fractional() {
    let v: D38s12 = <D38s12 as NumCast>::from(1.5_f64).expect("in-range");
    assert_eq!(v, D38s12::from_f64(1.5_f64));
}

    /// `NumCast::from` returns `None` for `f64::NAN`.
#[test]
fn numcast_from_f64_nan_returns_none() {
    assert!(<D38s12 as NumCast>::from(f64::NAN).is_none());
}

    /// `NumCast::from` returns `None` for finite out-of-range `f64`.
#[test]
fn numcast_from_f64_out_of_range_returns_none() {
    assert!(<D38s12 as NumCast>::from(1e30_f64).is_none());
}

    /// `NumCast::from` keeps integer inputs exact for `i64` values above
    /// f64's 53-bit mantissa range, validating the integer fast path.
#[test]
fn numcast_from_i64_above_f64_mantissa_is_exact() {
    // 2^54 = 18_014_398_509_481_984 — above f64's exact-integer range.
    let v: i64 = 1_i64 << 54;
    let d: D38s12 = <D38s12 as NumCast>::from(v).expect("in-range");
    assert_eq!(<D38s12 as ToPrimitive>::to_i64(&d), Some(v));
}