nectar-primitives 0.1.1

Core primitives for Ethereum Swarm: chunks, addresses, and binary merkle trees
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

//! Typed Kademlia proximity order (PO) in the range `0..=MAX_PO`.
//!
//! See [`MAX_PO`] for the standard cap (31) and
//! [`address`](crate::address) for the derivation from two [`SwarmAddress`es](crate::SwarmAddress).

use crate::MAX_PO;
use derive_more::{Display, Into};

#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

/// Typed proximity order, `0..=MAX_PO` (= 0..=31).
///
/// Distinguished from [`Bin`](crate::Bin) at the type level even though they
/// share a representation. PO is the metric, Bin is the routing-table slot.
#[repr(transparent)]
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord, Display, Into)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[cfg_attr(feature = "serde", serde(transparent))]
#[display("po={_0}")]
#[into(u8, usize)]
pub struct ProximityOrder(u8);

/// Errors from constructing a [`ProximityOrder`].
#[non_exhaustive]
#[derive(Debug, Clone, Copy, PartialEq, Eq, thiserror::Error)]
pub enum ProximityOrderError {
    /// Value exceeded [`MAX_PO`].
    #[error("proximity order {raw} exceeds MAX_PO ({max})")]
    OutOfRange {
        /// The rejected value.
        raw: u8,
        /// The maximum permitted value ([`MAX_PO`]).
        max: u8,
    },
}

impl ProximityOrder {
    /// The smallest proximity order.
    pub const MIN: Self = Self(0);

    /// The largest proximity order ([`MAX_PO`] = 31).
    pub const MAX: Self = Self(MAX_PO);

    /// Construct without bounds checking. Caller must ensure `raw <= MAX_PO`.
    ///
    /// Used by internal code that already validated the range (e.g.
    /// `SwarmAddress::proximity_order`, which can never exceed `MAX_PO`).
    #[inline]
    pub(crate) const fn new_unchecked(raw: u8) -> Self {
        debug_assert!(raw <= MAX_PO);
        Self(raw)
    }

    /// Construct from a raw byte, validating the range.
    #[inline]
    pub const fn new(raw: u8) -> Result<Self, ProximityOrderError> {
        if raw <= MAX_PO {
            Ok(Self(raw))
        } else {
            Err(ProximityOrderError::OutOfRange { raw, max: MAX_PO })
        }
    }

    /// Underlying byte value.
    #[inline]
    pub const fn get(self) -> u8 {
        self.0
    }
}

impl TryFrom<u8> for ProximityOrder {
    type Error = ProximityOrderError;

    fn try_from(raw: u8) -> Result<Self, Self::Error> {
        Self::new(raw)
    }
}

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

    #[test]
    fn min_max_consts() {
        assert_eq!(ProximityOrder::MIN.get(), 0);
        assert_eq!(ProximityOrder::MAX.get(), MAX_PO);
    }

    #[test]
    fn new_in_range_ok() {
        assert!(ProximityOrder::new(0).is_ok());
        assert!(ProximityOrder::new(MAX_PO).is_ok());
    }

    #[test]
    fn new_out_of_range_errs() {
        let err = ProximityOrder::new(MAX_PO + 1).unwrap_err();
        assert!(matches!(
            err,
            ProximityOrderError::OutOfRange { raw: 32, max: 31 }
        ));
    }

    #[test]
    fn display_shows_po() {
        assert_eq!(format!("{}", ProximityOrder::new(7).unwrap()), "po=7");
    }

    #[test]
    fn try_from_byte() {
        let po: ProximityOrder = 5u8.try_into().unwrap();
        assert_eq!(po.get(), 5);
    }
}