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

use account_compression::{MerkleTreeMetadata, QueueMetadata};
use anchor_lang::prelude::Pubkey;
use light_concurrent_merkle_tree::ConcurrentMerkleTree;
use light_hasher::Hasher;

pub fn assert_rolledover_merkle_trees<H, const HEIGHT: usize>(
    old_merkle_tree: &ConcurrentMerkleTree<H, HEIGHT>,
    new_merkle_tree: &ConcurrentMerkleTree<H, HEIGHT>,
) where
    H: Hasher,
{
    assert_eq!(old_merkle_tree.height, new_merkle_tree.height);
    assert_eq!(
        old_merkle_tree.changelog.capacity(),
        new_merkle_tree.changelog.capacity(),
    );
    assert_eq!(
        old_merkle_tree.changelog.capacity(),
        new_merkle_tree.changelog.capacity()
    );
    assert_eq!(
        old_merkle_tree.roots.capacity(),
        new_merkle_tree.roots.capacity()
    );
    assert_eq!(
        old_merkle_tree.roots.capacity(),
        new_merkle_tree.roots.capacity()
    );
    assert_eq!(old_merkle_tree.canopy_depth, new_merkle_tree.canopy_depth);
}

pub fn assert_rolledover_merkle_trees_metadata(
    old_merkle_tree_metadata: &MerkleTreeMetadata,
    new_merkle_tree_metadata: &MerkleTreeMetadata,
    current_slot: u64,
    new_queue_pubkey: &Pubkey,
) {
    // Old Merkle tree
    // 1. rolled over slot is set to current slot
    // 2. next Merkle tree is set to the new Merkle tree

    // New Merkle tree
    // 1. index is equal to the old Merkle tree index
    // 2. rollover fee is equal to the old Merkle tree rollover fee (the fee is calculated onchain in case rent should change the fee might be different)
    // 3. network_fee is equal to the old Merkle tree network_fee
    // 4. rollover threshold is equal to the old Merkle tree rollover threshold
    // 5. rolled over slot is set to u64::MAX (not rolled over)
    // 6. close threshold is equal to the old Merkle tree close threshold
    // 7. associated queue is equal to the new queue
    // 7. next merkle tree is set to Pubkey::default() (not set)
    // 8. owner is equal to the old Merkle tree owner
    // 9. delegate is equal to the old Merkle tree delegate

    assert_eq!(
        old_merkle_tree_metadata.access_metadata,
        new_merkle_tree_metadata.access_metadata
    );

    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.index,
        new_merkle_tree_metadata.rollover_metadata.index
    );
    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.rollover_fee,
        new_merkle_tree_metadata.rollover_metadata.rollover_fee,
    );
    assert_eq!(
        old_merkle_tree_metadata
            .rollover_metadata
            .rollover_threshold,
        new_merkle_tree_metadata
            .rollover_metadata
            .rollover_threshold,
    );
    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.network_fee,
        new_merkle_tree_metadata.rollover_metadata.network_fee,
    );
    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.rolledover_slot,
        current_slot,
    );
    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.close_threshold,
        new_merkle_tree_metadata.rollover_metadata.close_threshold
    );
    assert_eq!(
        old_merkle_tree_metadata.rollover_metadata.additional_bytes,
        new_merkle_tree_metadata.rollover_metadata.additional_bytes
    );

    assert_eq!(new_merkle_tree_metadata.associated_queue, *new_queue_pubkey);
    assert_eq!(new_merkle_tree_metadata.next_merkle_tree, Pubkey::default());
}

#[allow(clippy::too_many_arguments)]
pub fn assert_rolledover_queues_metadata(
    old_queue_metadata: &QueueMetadata,
    new_queue_metadata: &QueueMetadata,
    current_slot: u64,
    new_merkle_tree_pubkey: &Pubkey,
    new_queue_pubkey: &Pubkey,
    old_merkle_tree_lamports: u64,
    new_merkle_tree_lamports: u64,
    new_queue_lamports: u64,
) {
    assert_eq!(
        old_queue_metadata.rollover_metadata.rolledover_slot,
        current_slot
    );
    // Isn't this wrong???
    assert_eq!(
        old_queue_metadata.rollover_metadata.index,
        new_queue_metadata.rollover_metadata.index,
    );
    assert_eq!(
        old_queue_metadata.rollover_metadata.rollover_fee,
        new_queue_metadata.rollover_metadata.rollover_fee
    );
    assert_eq!(
        old_queue_metadata.rollover_metadata.network_fee,
        new_queue_metadata.rollover_metadata.network_fee
    );
    assert_eq!(
        u64::MAX,
        new_queue_metadata.rollover_metadata.rolledover_slot
    );

    assert_eq!(
        old_queue_metadata.access_metadata.owner,
        new_queue_metadata.access_metadata.owner
    );

    assert_eq!(
        old_queue_metadata.access_metadata.program_owner,
        new_queue_metadata.access_metadata.program_owner
    );
    assert_eq!(
        new_queue_metadata.associated_merkle_tree,
        *new_merkle_tree_pubkey
    );
    assert_eq!(old_queue_metadata.next_queue, *new_queue_pubkey);
    assert_eq!(
        old_merkle_tree_lamports,
        new_merkle_tree_lamports + new_queue_lamports + old_merkle_tree_lamports
    );
}