light_concurrent_merkle_tree/
errors.rs

1use light_bounded_vec::BoundedVecError;
2use light_hasher::errors::HasherError;
3use thiserror::Error;
4
5#[derive(Debug, Error, PartialEq)]
6pub enum ConcurrentMerkleTreeError {
7    #[error("Integer overflow")]
8    IntegerOverflow,
9    #[error("Invalid height, it has to be greater than 0")]
10    HeightZero,
11    #[error("Invalud height, expected {0}")]
12    InvalidHeight(usize),
13    #[error("Invalid changelog size, it has to be greater than 0. Changelog is used for storing Merkle paths during appends.")]
14    ChangelogZero,
15    #[error("Invalid number of roots, it has to be greater than 0")]
16    RootsZero,
17    #[error("Canopy depth has to be lower than height")]
18    CanopyGeThanHeight,
19    #[error("Merkle tree is full, cannot append more leaves.")]
20    TreeIsFull,
21    #[error("Number of leaves ({0}) exceeds the changelog capacity ({1}).")]
22    BatchGreaterThanChangelog(usize, usize),
23    #[error("Invalid proof length, expected {0}, got {1}.")]
24    InvalidProofLength(usize, usize),
25    #[error("Invalid Merkle proof, expected root: {0:?}, the provided proof produces root: {1:?}")]
26    InvalidProof([u8; 32], [u8; 32]),
27    #[error("Attempting to update the leaf which was updated by an another newest change.")]
28    CannotUpdateLeaf,
29    #[error("Cannot update the empty leaf")]
30    CannotUpdateEmpty,
31    #[error("The batch of leaves is empty")]
32    EmptyLeaves,
33    #[error("Invalid buffer size, expected {0}, got {1}")]
34    BufferSize(usize, usize),
35    #[error("Hasher error: {0}")]
36    Hasher(#[from] HasherError),
37    #[error("Bounded vector error: {0}")]
38    BoundedVec(#[from] BoundedVecError),
39}
40
41impl From<ConcurrentMerkleTreeError> for u32 {
42    fn from(e: ConcurrentMerkleTreeError) -> u32 {
43        match e {
44            ConcurrentMerkleTreeError::IntegerOverflow => 10001,
45            ConcurrentMerkleTreeError::HeightZero => 10002,
46            ConcurrentMerkleTreeError::InvalidHeight(_) => 10003,
47            ConcurrentMerkleTreeError::ChangelogZero => 10004,
48            ConcurrentMerkleTreeError::RootsZero => 10005,
49            ConcurrentMerkleTreeError::CanopyGeThanHeight => 10006,
50            ConcurrentMerkleTreeError::TreeIsFull => 10007,
51            ConcurrentMerkleTreeError::BatchGreaterThanChangelog(_, _) => 10008,
52            ConcurrentMerkleTreeError::InvalidProofLength(_, _) => 10009,
53            ConcurrentMerkleTreeError::InvalidProof(_, _) => 10010,
54            ConcurrentMerkleTreeError::CannotUpdateLeaf => 10011,
55            ConcurrentMerkleTreeError::CannotUpdateEmpty => 10012,
56            ConcurrentMerkleTreeError::EmptyLeaves => 10013,
57            ConcurrentMerkleTreeError::BufferSize(_, _) => 10014,
58            ConcurrentMerkleTreeError::Hasher(e) => e.into(),
59            ConcurrentMerkleTreeError::BoundedVec(e) => e.into(),
60        }
61    }
62}
63
64#[cfg(feature = "solana")]
65impl From<ConcurrentMerkleTreeError> for solana_program_error::ProgramError {
66    fn from(e: ConcurrentMerkleTreeError) -> Self {
67        solana_program_error::ProgramError::Custom(e.into())
68    }
69}
70
71#[cfg(feature = "pinocchio")]
72impl From<ConcurrentMerkleTreeError> for pinocchio::program_error::ProgramError {
73    fn from(e: ConcurrentMerkleTreeError) -> Self {
74        pinocchio::program_error::ProgramError::Custom(e.into())
75    }
76}
light_concurrent_merkle_tree/errors.rs

light_concurrent_merkle_tree/
errors.rs
